Advertisement

Using a Genetic Algorithm to Solve the Generalized Orienteering Problem

Chapter
Part of the Operations Research/Computer Science Interfaces book series (ORCS, volume 43)

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.

Key words

Generalized orienteering orienteering problem genetic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.CrossRefGoogle Scholar
  2. 2.
    K.A. De Jong.An Analysis of the Behavior of a Class of Genetic Adaptive Systems.Doctoral dissertation, University of Michigan, Ann Arbor, 1975.Google Scholar
  3. 3.
    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.CrossRefGoogle Scholar
  4. 4.
    G. Laporte and I. Rodríguez-Martín.Locating a Cycle in a Transportation or a Telecommunications Network.Networks, 50:92–108, 2007.CrossRefGoogle Scholar
  5. 5.
    Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs.Springer, Berlin, 1996.Google Scholar
  6. 6.
    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.CrossRefGoogle Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of MarylandCollege Park
  2. 2.Department of Decision and Information TechnologiesUniversity of MarylandMD 20742
  3. 3.Kogod School of BusinessAmerican UniversityWashington

Personalised recommendations