Skip to main content
SpringerLink
Log in

Fast Heuristic for Vehicle Routing Problem on Trees

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1275))

  • 519 Accesses

Abstract

In this paper we propose an efficient heuristic for the Vehicle Routing Problem on Trees (TVRP). An initial solution is constructed with a greedy algorithm based on the Depth-First Search (DFS) approach. To optimize initial solutions obtained by our DFS heuristic, Ruin-and-Recreate (RR) method is then applied. For diversification purposes a randomization mechanism is added to the construction of initial solutions and DFS+RR algorithm is executed multiple times until the best found solution stops changing. The results of our approach are compared with the solutions obtained by the exact model of Chandran & Raghavan (2008). The computational experiments show that the suggested heuristic is fast and finds solutions which differ from optimal ones less than by 1% in average.

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 EPUB and 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

References

  1. Basnet, C., Foulds, L.R., Wilson, J.M.: Heuristics for vehicle routing on tree-like networks. J. Oper. Res. Soc. 50, 627–635 (1999)

    Article  Google Scholar 

  2. Chandran, B., Raghavan, S.: Modeling and solving the capacitated vehicle routing problem on trees. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol. 43, pp. 239–261. Springer, Boston (2008). https://doi.org/10.1007/978-0-387-77778-8_11

  3. Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)

    Article  Google Scholar 

  4. Labbe, M., Laporte, G., Mercure, H.: Capacitated vehicle routing on trees. Oper. Res. 39(4), 616–622 (1991)

    Article  Google Scholar 

  5. Mbaraga, P., Langevin, A., Laporte, G.: Two exact algorithms for the vehicle routing problem on trees. Naval Res. Logistics 46, 75–89 (1999)

    Article  MathSciNet  Google Scholar 

  6. Rafael, M., Pardalos, P.M., Resende, M.G.: Handbook of Heuristics. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-07153-4

    Book  MATH  Google Scholar 

  7. Rennie S.: Optimal dispatching and routing of milk tankers for northland dairy board. In: Proceedings of the 30th Annual Conference of the Operational Research Society of New Zealand. ORSNZ, Wellington, New Zealand, pp. 95–102 (1995)

    Google Scholar 

  8. Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139–171 (2000)

    Article  MathSciNet  Google Scholar 

  9. Toth, P., Vigo, D.: The vehicle routing problem. In: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)

    Google Scholar 

  10. Toth, P., Vigo, D.: Vehicle routing: problems, methods, and applications. Second Edition. In: MOS-SIAM Series on Optimization, Philadelphia (2014)

    Google Scholar 

Download references

Funding

The paper is prepared within the framework of the Basic Research Program at the National Research University Higher School of Economics (NRU HSE).

Author information

Authors and Affiliations

  1. Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, 136 Rodionova Street, Niznhy Novgorod, Russia

    Irina Utkina, Olga Bukanova & Mikhail V. Batsyn

Authors
  1. Irina Utkina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga Bukanova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mikhail V. Batsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mikhail V. Batsyn .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Yury Kochetov

  2. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Igor Bykadorov

  3. Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia

    Tatiana Gruzdeva

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Utkina, I., Bukanova, O., Batsyn, M.V. (2020). Fast Heuristic for Vehicle Routing Problem on Trees. In: Kochetov, Y., Bykadorov, I., Gruzdeva, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2020. Communications in Computer and Information Science, vol 1275. Springer, Cham. https://doi.org/10.1007/978-3-030-58657-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58657-7_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58656-0

  • Online ISBN: 978-3-030-58657-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation