The effective application of a new approach to the generalized orienteering problem

Authors:
John Silberholz;Bruce Golden
Affiliations:
R.H. Smith School of Business, University of Maryland, College Park, USA 20742;R.H. Smith School of Business, University of Maryland, College Park, USA 20742
Venue:
Journal of Heuristics
Year:
2010

Citing 7
Cited 0

The selective travelling salesman problem

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
An efficient four-phase heuristic for the generalized orienteering problem

Computers and Operations Research
Solving the Orienteering Problem Through Branch-And-Cut

INFORMS Journal on Computing
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software
Algorithms and solutions to multi-level vehicle routing problems

Algorithms and solutions to multi-level vehicle routing problems
A Recursive Greedy Algorithm for Walks in Directed Graphs

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Harmony search for generalized orienteering problem: best touring in China

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Orienteering Problem (OP) is an important problem in network optimization in which each city in a network is assigned a score and a maximum-score path from a designated start city to a designated end city is sought that is shorter than a pre-specified length limit. The Generalized Orienteering Problem (GOP) is a generalized version of the OP in which each city is assigned a number of scores for different attributes and the overall function to optimize is a function of these attribute scores. In this paper, the function used was a non-linear combination of attribute scores, making the problem difficult to solve. The GOP has a number of applications, largely in the field of routing. We designed a two-parameter iterative algorithm for the GOP, and computational experiments suggest that this algorithm performs as well as or better than other heuristics for the GOP in terms of solution quality while running faster. Further computational experiments suggest that our algorithm also outperforms the leading algorithm for solving the OP in terms of solution quality while maintaining a comparable solution speed.