A fast and effective heuristic for the orienteering problem
From MaRDI portal
Publication:1266618
DOI10.1016/0377-2217(95)00035-6zbMath0911.90146OpenAlexW1999883971MaRDI QIDQ1266618
Bruce L. Golden, Edward A. Wasil, I-Ming Chao
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00035-6
Related Items
Iterated local search for the team orienteering problem with time windows, The clustered orienteering problem, A guided local search metaheuristic for the team orienteering problem, An iterated local search algorithm for the team orienteering problem with variable profits, Boosting ant colony optimization via solution prediction and machine learning, Time dependent orienteering problem with time windows and service time dependent profits, UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections, Efficient meta-heuristics for the multi-objective time-dependent orienteering problem, Orienteering problem: a survey of recent variants, solution approaches and applications, Heuristic algorithms for visiting the customers in a rolling schedule environment, A two-stage approach to the orienteering problem with stochastic weights, Solving the orienteering problem with time windows via the pulse framework, Managing platelet supply through improved routing of blood collection vehicles, An efficient evolutionary algorithm for the orienteering problem, Multi-directional local search, Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem, Evolution-inspired local improvement algorithm solving orienteering problem, The time-dependent orienteering problem with time windows: a fast ant colony system, The orienteering problem with variable profits, Ants can orienteer a thief in their robbery, A dynamic and probabilistic orienteering problem, The team orienteering problem with time windows: an LP-based granular variable neighborhood search, Coupling ant colony systems with strong local searches, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach, The orienteering problem: a survey, Variable neighborhood search to solve the generalized orienteering problem, Recent advances in integrating demand management and vehicle routing: a methodological review, An adaptive memory matheuristic for the set orienteering problem, Solving Relaxation Orienteering Problem Using DCA-CUT, Hybridized evolutionary local search algorithm for the team orienteering problem with time windows, A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem, Hybrid genetic algorithm for undirected traveling salesman problems with profits, A new mathematical model and a heuristic algorithm for the tourist trip design problem under new constraints: a real-world application, A simulated annealing heuristic for the team orienteering problem with time windows, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, The orienteering problem with stochastic travel and service times, Modeling recreational systems using optimization techniques and information technologies, Robust UAV mission planning, Application of fuzzy optimization to the orienteering problem, Solving the stochastic time-dependent orienteering problem with time windows, An iterative three-component heuristic for the team orienteering problem with time windows, A TABU search heuristic for the team orienteering problem, The effective application of a new approach to the generalized orienteering problem, A path relinking approach for the team orienteering problem, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A Tabu search algorithm for the probabilistic orienteering problem, A biased random-key genetic algorithm for the set orienteering problem, The multi-visit team orienteering problem with precedence constraints, Capacitated ring arborescence problems with profits, Heuristics for the multi-period orienteering problem with multiple time windows, The team orienteering problem, Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory, Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: a case study in offshore wind energy, An effective PSO-inspired algorithm for the team orienteering problem, A fast solution method for the time-dependent orienteering problem
Cites Work
- Unnamed Item
- Unnamed Item
- The selective travelling salesman problem
- Algorithms to solve the orienteering problem: A comparison
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- The team orienteering problem
- Strong linear programming relaxations for the orienteering problem
- The orienteering problem
- The prize collecting traveling salesman problem
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- The Orienteering Problem with Time Windows
- An Optimal Algorithm for the Orienteering Tour Problem
- Computer Solutions of the Traveling Salesman Problem
