Algorithms to solve the orienteering problem: A comparison
From MaRDI portal
Publication:1119489
DOI10.1016/0377-2217(89)90388-3zbMath0671.90091OpenAlexW2023645131MaRDI QIDQ1119489
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90388-3
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)
Related Items (22)
Strong linear programming relaxations for the orienteering problem ⋮ Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ The clustered orienteering problem ⋮ A TSSP+1 decomposition strategy for the vehicle routing problem ⋮ Managing platelet supply through improved routing of blood collection vehicles ⋮ Using artificial neural networks to solve the orienteering problem ⋮ Routing problems: A bibliography ⋮ The team orienteering problem with time windows: an LP-based granular variable neighborhood search ⋮ The orienteering problem: a survey ⋮ Trip planning for visitors in a service system with capacity constraints ⋮ Solving Relaxation Orienteering Problem Using DCA-CUT ⋮ A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem ⋮ A path relinking approach for the team orienteering problem ⋮ A heuristic approach for the travelling purchaser problem ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ The traveling purchaser problem with budget constraint ⋮ A fast and effective heuristic for the orienteering problem ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem ⋮ A tabu search heuristic for the undirected selective travelling salesman problem ⋮ An effective PSO-inspired algorithm for the team orienteering problem
Cites Work
This page was built for publication: Algorithms to solve the orienteering problem: A comparison
