Skip to main content

On the Multi-Depot Vehicle Routing Problem

  • Conference paper
Book cover Operations Research ’91
  • 194 Accesses

Abstract

The multi-depot vehicle routing problem deals with situations in which vehicles based at several depots are required to visit customers so as to fulfill known customers’ requirements. Each vehicle leaves the depot where it is based, eventually returning to that same depot after visiting certain customers. It is asked to design a route for each vehicle so that each customer will be entirely supplied by a single vehicle, and the total cost of the distribution will be minimum.

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

Access this chapter

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. S.M. Baas and J.O. Cerdeira, “Covering Nodes by k Node-Disjoint Trees with Additional Constraints”, Memorandum №693, Faculteit der Toegepaste Wiskunde, Universiteit Twente, 1988.

    Google Scholar 

  2. J.O. Cerdeira, “Cobertura dos Vertices de um Grafo por k Arvores e Ciclos Disjuntos nos Vertices”, Tese de Doutoramento, Faculdade de Ciências da Universidade de Lisboa, 1990.

    Google Scholar 

  3. R.W. Floyd, “Algorithm 97: Shortest Path”, Communications of the ACM, 5, 1962, 345.

    Article  Google Scholar 

  4. M. Held, P. Wolfe and H.P. Crowder, Validation of Subgradient Optimization, Mathematical Programming, 6, 1974, 62–88.

    Article  Google Scholar 

  5. D.S. Johnson and C.H. Papadimitriou, “Performance Guarantees for Heuristics” , in The Traveling Salesman Problem: A Guide Tour of Combinatorial Optimization, Eds.: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, John Wiley & Sons, New York, 1985, 145–180.

    Google Scholar 

  6. C.H. Papadimitriou and K. Stieglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, New York, 1982.

    Google Scholar 

  7. M.M. Syslo, N. Deo and J.S. Kowalik, Discrete Optimization Algorithms with Pascal Programs, Prentice-Hall, Englewood Cliffs, New York, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Physica-Verlag Heidelberg

About this paper

Cite this paper

Cerdeira, J.O. (1992). On the Multi-Depot Vehicle Routing Problem. In: Gritzmann, P., Hettich, R., Horst, R., Sachs, E. (eds) Operations Research ’91. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-48417-9_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-48417-9_42

  • Publisher Name: Physica-Verlag HD

  • Print ISBN: 978-3-7908-0608-3

  • Online ISBN: 978-3-642-48417-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics