Using a genetic algorithm to solve the generalized orienteering problem
From MaRDI portal
Publication:3564360
DOI10.1007/978-0-387-77778-8_12zbMATH Open1190.90294OpenAlexW2138200410MaRDI QIDQ3564360FDOQ3564360
Authors:
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_12
Recommendations
- The effective application of a new approach to the generalized orienteering problem
- Using artificial neural networks to solve the orienteering problem
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- A fast and effective heuristic for the orienteering problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cited In (19)
- The time-dependent orienteering problem with time windows: a fast ant colony system
- The orienteering problem: a survey
- Tour recommendation for groups
- A matheuristic approach to the orienteering problem with service time dependent profits
- A Tabu search algorithm for the probabilistic orienteering problem
- An efficient evolutionary algorithm for the orienteering problem
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving the orienteering problem with time windows via the pulse framework
- Variable neighborhood search to solve the generalized orienteering problem
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- Modeling recreational systems using optimization techniques and information technologies
- The effective application of a new approach to the generalized orienteering problem
- Using artificial neural networks to solve the orienteering problem
- A randomized heuristics for the mapping problem: The genetic approach
- Selective generalized travelling salesman problem
- Analysis of the selective traveling salesman problem with time-dependent profits
- A fast solution method for the time-dependent orienteering problem
This page was built for publication: Using a genetic algorithm to solve the generalized orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564360)