Skip to main content
SpringerLink
Log in

A Genetic Algorithm with Multiple Mutation which Solves Orienteering Problem in Large Networks

  • Conference paper
Computational Collective Intelligence. Technologies and Applications (ICCCI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8083))

Included in the following conference series:

Abstract

In this paper we present a genetic algorithm (GA) which solves the Orienteering Problem (OP). In the article, performance of the algorithm is analysed as a function of mutations number. In addition, GA results were compared with known local search methods: greedy randomized adaptive search procedure (GRASP) and guided local search method (GLS). The computer tests were conducted on large network of 908 cities in Poland. As a result, the GA performance was considerably better then local search methods in terms of both: results quality and execution time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Souffriau, W., Vansteenwegen, P.: Tourist Trip Planning Functionalities: State–of–the–Art and Future. In: Daniel, F., Facca, F.M. (eds.) ICWE 2010. LNCS, vol. 6385, pp. 474–485. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: The City Trip Planner: An expert system for tourists, vol. 38. Elsevier (2011)

    Google Scholar 

  3. Koszelew, J.: Logistics for globetrotters - innovative software component for etourism. Logistics 6, 54–56 (2010)

    Google Scholar 

  4. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers O.R. 36, 3281–3290 (2009)

    Article  MATH  Google Scholar 

  5. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: A guided local search metaheuristic for the team orienteering problem. European Journal of Operational Research 196, 118–127 (2009)

    Article  MATH  Google Scholar 

  6. Garcia, A., Arbelaitz, O., Vansteenwegen, P., Souffriau, W., Linaza, M.T.: Hybrid approach for the public transportation time dependent orienteering problem with time windows. In: Corchado, E., Graña Romay, M., Manhaes Savio, A. (eds.) HAIS 2010, Part II. LNCS, vol. 6077, pp. 151–158. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Golden, B., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics 34 (1987)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)

    Google Scholar 

  9. Chao, I.M., Golden, B.L., Wasil, E.A.: A Fast and effective heuristic for the orienteering. European Journal of Operational Research 88, 475–489 (1996)

    Article  MATH  Google Scholar 

  10. Campos, V., Marti, R.: Grasp with Path Relinking for the Orienteering Problem. Technical Raport, 1-16 (2011)

    Google Scholar 

  11. Tasgetiren, M.F., Smith, A.E.: A genetic algorithm for the orienteering problem. In: Proceedings of the 2000 Congress on Evolutionary Computation San Diego, vol. 2, pp. 1190–1195 (2000)

    Google Scholar 

  12. Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379–1407 (2005)

    Article  Google Scholar 

  13. Fischetti, M., Salazar, J.J., Toth, P.: Solving the Orienteering Problem through Branch-and-Cut. INFORMS Journal on Computing 10, 133–148 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tsiligirides, T.: Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9), 797–809 (1984)

    Google Scholar 

  15. Network of 908 polish cities, http://jolantakoszelew.pl/attachments/File/Poland_908_cities.txt

  16. Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263–273 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ramesh, R., Yoon, Y., Karwan, M.H.: An optimal algorithm for the orienteering tour problem. INFORMS Journal on Computing 4(2), 155–165 (1992)

    Article  MATH  Google Scholar 

  18. Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: A path relinking approach for the team orienteering problem. Computers & Operational Research 37, 1853–1859 (2010)

    Article  MATH  Google Scholar 

  19. Karbowska-Chilinska, J., Koszelew, J., Ostrowski, K., Zabielski, P.: Genetic algorithm solving Orienteering Problem in large networks. Frontiers in Artificial Intelligence and Applications 243 (2012)

    Google Scholar 

  20. Karbowska-Chilińska, J., Zabielski, P.: A genetic algorithm vs. Local search methods for solving the orienteering problem in large networks. In: Graña, M., Toro, C., Howlett, R.J., Jain, L.C. (eds.) KES 2012. LNCS, vol. 7828, pp. 11–20. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  21. Zhu, C., Hu, J.Q., Wang, F., Xu, Y., Cao, R.: On the tour planning problem. Annals of Operations Research 192, 67–86 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Bialystok University of Technology, Poland

    Jolanta Koszelew & Krzysztof Ostrowski

Authors
  1. Jolanta Koszelew
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Ostrowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer and Information Technology Department, University of Craiova, Bvd. Decebal 107, 200440, Craiova, Romania

    Costin Bǎdicǎ

  2. Institute of Informatics, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Ngoc Thanh Nguyen

  3. Computer and Information Technology Department, University of Craiova, Bvd. Decebal 107, 200440, Craiova, Romania

    Marius Brezovan

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koszelew, J., Ostrowski, K. (2013). A Genetic Algorithm with Multiple Mutation which Solves Orienteering Problem in Large Networks. In: Bǎdicǎ, C., Nguyen, N.T., Brezovan, M. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2013. Lecture Notes in Computer Science(), vol 8083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40495-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40495-5_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40494-8

  • Online ISBN: 978-3-642-40495-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation