Skip to main content
SpringerLink
Log in

A Memetic Algorithm for a Tour Planning in the Selective Travelling Salesman Problem on a Road Network

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2011)

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

Included in the following conference series:

Abstract

The selective travelling salesman problem (STSP) appears in various applications. The paper presents a new version of this problem called the selective travelling salesman problem on a road network (R-STSP). While in the classical STSP a graph is complete and each vertex can be visited at most once, in R-STSP these two constraints are not obligatory which makes the problem more real-life and applicable. To solve the problem, the memetic algorithm (MA) is proposed. After implementing the MA, computer experiments were conducted on the real transport network in Poland. The comparative study of the MA with the genetic algorithm (GA) shows that the MA outperforms the GA.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Liu, S., Pinto, J.M., Papageorgiou, L.G.: A TSP-based MILP Model for Medium-Term Planning of Single-Stage Continuous Multiproduct Plants. Industrial & Engineering Chemistry Research 47(20), 7733–7743 (2008)

    Article  Google Scholar 

  4. Voelkel, T., Weber, G.: Routecheckr: personalized multicriteria routing for mobility impaired pedestrians. In: Proceedings of the 10th International ACM SIGACCESS Conference on Computers and Accessibility, pp. 185–192 (2008)

    Google Scholar 

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

    Article  Google Scholar 

  6. Rasmussen, R.: TSP in spreadsheets – A fast and flexible tool. Omega 39, 51–63 (2011)

    Article  Google Scholar 

  7. Fleischmann, B.: A new class of cutting planes for the symmetric travelling salesman problem. Mathematical Programming 40, 225–246 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sharma, O., Mioc, D., Anton, F., Dharmaraj, G.: Traveling salesperson approximation algorithm for real road networks. In: ISPRS WG II/1,2,7, VII/6 International Symposium on Spatio-temporal Modeling, Spatial Reasoning, Spatial Analysis, Data Mining & Data Fusion (STM 2005), Beijing, China (2005)

    Google Scholar 

  9. Koszelew, J., Piwonska, A.: Tunning Parameters of Evolutionary Algorithm in Travelling Salesman Problem with Profits and Returns. Archives of Transport System Telematics 39(1), 17–22 (2010)

    Google Scholar 

  10. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  11. Ludwig, B., Zenker, B., Schrader, J.: Recommendation of Personalized Routes with Public Transport Connections. In: Intelligent Interactive Assistance and Mobile Multimedia Computing. Communications in Computer and Information Science, vol. 53, Part 3, pp. 97–107 (2009)

    Google Scholar 

  12. Miller, J., Sun-il, K., Menard, T.: Intelligent Transportation Systems Traveling Salesman Problem (ITS-TSP) - A Specialized TSP with Dynamic Edge Weights and Intermediate Cities. In: 13th IEEE Intelligent Transportation Systems Conference, Madeira Island, Portugal, pp. 992–997 (2010)

    Google Scholar 

  13. Ascheuer, N., Fischetti, M., Grötschel, M.: Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-Cut. Mathematical Programming 90(3), 475–506 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technical University of Bialystok, Wiejska 45A, 15-351, Bialystok, Poland

    Anna Piwońska & Jolanta Koszelew

Authors
  1. Anna Piwońska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jolanta Koszelew
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electronics and Information Technology, Institute of Computer Science, Warsaw University of Technology,, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Marzena Kryszkiewicz

  2. Faculty of Electronics and Information Technology, Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Henryk Rybinski

  3. University of Warsaw, 02-097, Warsaw, Poland

    Andrzej Skowron

  4. Faculty of Electronics and Information Technology, Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19,, 00-665, Warsaw, Poland

    Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Piwońska, A., Koszelew, J. (2011). A Memetic Algorithm for a Tour Planning in the Selective Travelling Salesman Problem on a Road Network. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2011. Lecture Notes in Computer Science(), vol 6804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21916-0_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21916-0_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21915-3

  • Online ISBN: 978-3-642-21916-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation