Summary
In this chapter, we use genetic algorithms (GAs) to solve the generalized orienteering problem (GOP). In the orienteering problem (OP), we are given a transportation network in which a start point and an end point are specified, and other points have associated scores. Given a fixed amount of time, the goal is to determine a path from start to end through a subset of the other locations in order to maximize the total path score. In the GOP, each point has a score with respect to a number of attributes (e.g., natural beauty, historical significance, cultural and educational attractions, and business opportunities) and the overall objective function is nonlinear. The GOP is more difficult than the OP, which is itself NP-hard. An effective heuristic using artificial neural networks (ANNs), however, has been designed to solve the GOP. In this chapter, we show that a straightforward GA can yield comparable results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
I-M. Chao, B.L. Golden, and E.A. Wasil.A Fast and Effective Heuristic for the Orienteering Problem.European Journal of Operational Research, 88:475–489, 1996.
K.A. De Jong.An Analysis of the Behavior of a Class of Genetic Adaptive Systems.Doctoral dissertation, University of Michigan, Ann Arbor, 1975.
M. Gendreau, G. Laporte, and F. Semet.A Tabu Search Heuristic for the Undirected Selective Traveling Salesman Problem.European Journal of Operational Research, 106:539–545, 1998.
G. Laporte and I. Rodríguez-Martín.Locating a Cycle in a Transportation or a Telecommunications Network.Networks, 50:92–108, 2007.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs.Springer, Berlin, 1996.
Q. Wang, X. Sun, B.L. Golden, and J. Jia. Using Artificial Neural Networks to Solve the Orienteering Problem.Annals of Operations Research, 61:111–120, 1995.
Q. Wang, X. Sun, and B.L. Golden.Using Artificial Neural Networks to Solve Generalized Orienteering Problems.inIntelligent Engineering Systems Through Artificial Neural Networks: Volume 6 (C. Dagli, M. Akay, C. Chen, B. Fernández, and J. Ghosh, eds.). ASME Press, New York, 1063-1068, 1996.
D. Whitley, T. Starkweather, and D. Fuquay.Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator.inProceedings of the Third International Conference on Genetic Algorithms and their Applications.(J.D. Shaeffer, ed.). Morgan Kaufmann Publishers, Palo Alto, CA, 133-140, 1989.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Wang, X., Golden, B.L., Wasil, E.A. (2008). Using a Genetic Algorithm to Solve the Generalized Orienteering Problem. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-77778-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77777-1
Online ISBN: 978-0-387-77778-8
eBook Packages: Business and EconomicsBusiness and Management (R0)