Skip to main content
SpringerLink
Log in
Book cover

International Conference on Dependability and Complex Systems

DepCoS-RELCOMEX 2015: Theory and Engineering of Complex Systems and Dependability pp 117–129Cite as

Optimization of Couriers’ Routes by Determining Best Route for Distributing Parcels in Urban Traffic

  • Conference paper

  • 1562 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 365))

Abstract

The aim of this paper was to propose an efficient algorithm for determining the best route for couriers’ in urban traffic. The best route is defined as the order in which the parcels should be delivered. The specification of couriers’ work may result in different criteria being considered optimal, including but not limited to: travelled distance, elapsed time, combination of preceding.

For this reason, the optimality criteria is defined and proposed solution is verified against those optimization targets.

The scope of this paper consists of researching modern methods of solving TSP. In addition to that, a simulation environment that allows to conduct experiments was developed. Secondly, a selected portion of methods described in literature was implemented to form a baseline for benchmarking proposed solution. Furthermore, authorial solutions are implemented and the results of running those are compared against baseline results. A best route is considered in terms of parcel delivery order and not finding the shortest path between subsequent delivery addresses. Consequently the routing problem (finding the shortest path) is beyond the scope of this paper.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, E., van Laarhoven, P.: Simulated annealing. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 91–96. John Wiley & Sons Ltd. (1997)

    Google Scholar 

  2. Bellman, R.: Dynamic Programming Treatment of the Travelling Salesman Problem. RAND Corporation, Santa Monica, California (1961)

    Google Scholar 

  3. Christofides, N.: Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. Defense Technical Information Center (1976)

    Google Scholar 

  4. Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorytmy. Wydawnictwo Naukowe PWN SA, Warszawa (2012)

    Google Scholar 

  5. Davendra, D. (ed.): Traveling Salesman Problem, Theory and Applications. InTech (2010), http://www.intechopen.com/books/travelingsalesman-problem-theory-and-applications

  6. Gwiazda, T.D.: Algorytmy Genetyczne kompendium, vol. 1. Wydawnictwo Naukowe PWN SA, Warszawa (2007)

    Google Scholar 

  7. Homaifar, A., Guan, S., Liepins, G.E.: Schema analysis of the traveling salesman problem using genetic algorithms. Complex Systems 6 (1992)

    Google Scholar 

  8. Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. In: Ravi, S., Shukla, S.K. (eds.) Fundamental Problems in Computing, pp. 45–69. Springer, Netherlands (2009)

    Google Scholar 

  9. Sysło, M.M., Deo, N., Kowalik, J.S.: Algorytmy optymalizacji dyskretnej z programami w jezyku Pascal. Wydawnictwo Naukowe PWN SA, Warszawa (1999)

    Google Scholar 

  10. Laporte, G.: A Short History of the Traveling Salesman Problem. Canada Research Chair in Distribution Management and Centre for Research on Transportation (CRT) and GERAD HEC Montreal, Montreal, Canada (2006)

    Google Scholar 

  11. Li, C., Yang, M., Kang, L.: A new approach to solving dynamic traveling salesman problems. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 236–243. Springer, Heidelberg (2006)

    Google Scholar 

  12. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Springer US (1972)

    Google Scholar 

  13. Ore, O.: Note on Hamilton circuits. The American Mathematical Monthly 67(1) (January 1960), http://www.jstor.org/stable/2308928

  14. Universitat Heidelberg. Tsplib, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ (accessed on: December 20, 2014)

  15. Wei, J.-D., Lee, D.T.: A new approach to the traveling salesman problem using genetic algorithms with priority encoding. In: Congress on Evolutionary Computation, CEC 2004, vol. 2, pp. 1457–1464 (June 2004)

    Google Scholar 

  16. Zukhri, Z., Paputungan, I.V.: A hybrid optimization algorithm base on genetic algorithm & ant colony optimization. International Journal of Artificial Intelligence and Applications (IJAIA) 4(5) (September 2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Wroclaw University of Technology, Janiszewskiego 11-17, 50-372, Wroclaw, Poland

    Piotr Chrzczonowicz & Marek Woda

Authors
  1. Piotr Chrzczonowicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marek Woda
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piotr Chrzczonowicz .

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Wojciech Zamojski

  2. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Jacek Mazurkiewicz

  3. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Jarosław Sugier

  4. Department of Computer Engineering, Wrocław University of Technology, Wrocław, Poland

    Tomasz Walkowiak

  5. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Chrzczonowicz, P., Woda, M. (2015). Optimization of Couriers’ Routes by Determining Best Route for Distributing Parcels in Urban Traffic. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Theory and Engineering of Complex Systems and Dependability. DepCoS-RELCOMEX 2015. Advances in Intelligent Systems and Computing, vol 365. Springer, Cham. https://doi.org/10.1007/978-3-319-19216-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19216-1_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19215-4

  • Online ISBN: 978-3-319-19216-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation