Skip to main content
Springer Nature Link
Log in

Variable Neighborhood Search for the Orienteering Problem

  • Conference paper
Computer and Information Sciences – ISCIS 2006 (ISCIS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4263))

Included in the following conference series:

  • 1318 Accesses

Abstract

The Orienteering Problem (OP) is a version of TSP with profits in which instead of a cycle, a path is sought. In this paper, we consider three variations of Variable Neighborhood Search (VNS) and present the first algorithm solely based on VNS to solve the OP. The experimental results for the benchmark problems indicate that the algorithm, designed by using Reduced VNS instead of the local search phase of the traditional VNS, is the best amongst other variations of VNS we tried; it is the most robust and produces the best results, in terms of solution quality, within a reasonable amount of time. Moreover, it improves the best known results for several benchmark problems and reproduces the best results for others.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brimberg, J., Urosevic, D., Mladenovic, N.: Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur. J. Oper. Res. (2004)

    Google Scholar 

  3. Chao, I.-M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88(3), 475–489 (1996)

    Article  MATH  Google Scholar 

  4. Feillet, D., Dejax, P., Gendreau, M.: Traveling Salesman Problems with Profits. Transportation Science 39, 188–205 (2005)

    Article  Google Scholar 

  5. Fischetti, M., Gonzalez, J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. Informs J. Comput. 10(2), 133–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Golden, B.L., Assad, A., Dahl, R.: Analysis of a large-scale vehicle routing problem with inventory component. Large Scale Systems 7, 181–190 (1984)

    MATH  Google Scholar 

  7. Golden, B.L., Levy, V.R.: The Orienteering Problem. Naval Res. Logist 34(3), 307–318 (1987)

    Article  MATH  Google Scholar 

  8. Golden, B.L., Wang, Q., Liu, L.: A Multifaced heuristic for the orienteering problem. Naval Res. Logist 35, 359–366 (1988)

    Article  MATH  Google Scholar 

  9. Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search, in Metaheuristics, advances and in local search paradigms for optimization, i.S.V.e. al, pp. 433–458. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  10. Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applicatons. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-Median. Location Sci. 5, 207–226 (1997)

    Article  MATH  Google Scholar 

  12. Hayes, M., Norman, J.M.: Dynamic Programming in Orienteering:Route Choice and the Siting of Controls. J. Oper. Res. Soc. 35(9), 791–796 (1984)

    Article  Google Scholar 

  13. Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629–635 (1992)

    Article  MATH  Google Scholar 

  14. Kataoka, S., Morito, S.: An algorithm for the single constraint maximum collection problem. J. Oper. Res. Soc. 31(4), 515–530 (1988)

    MATH  MathSciNet  Google Scholar 

  15. Keller, C.P.: Algorithms to solve orienteering problem: A Comparision. Eur. J. Oper. Res. 41, 224–231 (1989)

    Article  MATH  Google Scholar 

  16. Laporte, G., Martello, S.: The selective traveling salesman problem. Discrete Applied M 26, 193–207 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  17. Leifer, A.C., Rosenwein, M.B.: Strong Lineer Programming relaxations for orienteering problem. Eur. J. Oper. Res. 73, 517–523 (1994)

    Article  MATH  Google Scholar 

  18. Liang, Y.-C., Kulturel-Konak, S., Smith, A.E.: Meta Heuristic For the Orienteering Problem. In: Proceeding of the 2002 Congress on Evolutionary Computation (CEC 2002), Hawaii (2002)

    Google Scholar 

  19. Ramesh, R., Brown, K.M.: An efficient four-phase heuristic for the generalized orienteering problem. Comput. Oper. Res. 18(2), 151–165 (1991)

    Article  MathSciNet  Google Scholar 

  20. Ramesh, R., Yoon, Y.-S., Karwan, M.H.: An optimal algorithm for the orienteering problem. ORSA J. Comput. 4(42), 155–165 (1992)

    MATH  Google Scholar 

  21. Ribeiro, C.C., Souza, M.C.: Variable Neighborhood Search for the degree-constrained minumum spaning tree problem. Discrete Applied M 118, 43–54 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tasgetiren, F.M., Smith, A.E.: A genetic algorithm for the orienteering problem. In: Congress Evolutionary Comput. San Diego, CA (2000)

    Google Scholar 

  23. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)

    Article  Google Scholar 

  24. Wang, Q., Sun, X., Golden, B.L., Jia, J.: Using artificial neural network to solve orienteering problem. Ann. Oper. Res. 61, 111–120 (1995)

    Article  MATH  Google Scholar 

  25. Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Oper. Res. Quart. 23, 333–344 (1972)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Fatih University, Büyükçekmece, Istanbul, Turkey

    Zülal Sevkli

  2. Department of Computer Engineering, Gebze Institute of Technology, Gebze, Kocaeli, Turkey

    F. Erdoğan Sevilgen

Authors
  1. Zülal Sevkli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Erdoğan Sevilgen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sabanci University, 34956, Istanbul, Turkey

    Albert Levi

  2. Sabancı University, Istanbul, Turkey

    Erkay Savaş  & Selim Balcısoy  & 

  3. Faculty of Engineering and Natural Sciences, Sabancı University, 34956, Tuzla, Istanbul, Turkey

    Hüsnü Yenigün

  4. Faculty of Engineering & Natural Sciences, Sabanci University, Istanbul, Turkey

    Yücel Saygın

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sevkli, Z., Sevilgen, F.E. (2006). Variable Neighborhood Search for the Orienteering Problem. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_16

Download citation

  • DOI: https://doi.org/10.1007/11902140_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47242-1

  • Online ISBN: 978-3-540-47243-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation