Algorithms to solve the orienteering problem: A comparison
From MaRDI portal
Publication:1119489
DOI10.1016/0377-2217(89)90388-3zbMath0671.90091MaRDI 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
heuristics; traveling salesman; orienteering problem; performance comparison; multiobjective vending
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C31: Sensitivity, stability, parametric optimization
90C27: Combinatorial optimization
Related Items
A heuristic approach for the travelling purchaser problem, 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, Strong linear programming relaxations for the orienteering problem, A TSSP+1 decomposition strategy for the vehicle routing problem, A tabu search heuristic for the undirected selective travelling salesman problem, Using artificial neural networks to solve the orienteering problem, Routing problems: A bibliography, Multiobjective transportation network design and routing problems: Taxonomy and annotation
Cites Work
