Vehicle Routing

This chapter describes how the vehicle routing problem lies at the heart of distribution management. It is faced each day by thousands of companies and organizations engaged in the delivery and collection of goods or people. Because conditions vary from one setting to the next, the objectives and constraints encountered in practice are highly variable. Most algorithmic research and software development in this area focus on a limited number of prototype problems. This chapter focuses on some of the most common vehicle routing problem types. The pickup and delivery vehicle routing problem, which has also been extensively studied, is covered in another chapter in the book. Section 2 of this chapter is devoted to the classical vehicle routing problem, defined with a single depot and only capacity and route length constraints. Problems with time windows are surveyed in Section 3 and Section 4 and are devoted to inventory routing problems that combine routing and customer replenishment decisions. Finally, Section 5 covers the field of stochastic vehicle routing in which some of the problem data are random variables.

  • Availability:
  • Corporate Authors:

    Elsevier

    The Boulevard, Langford Lane
    Kidlington, Oxford  United Kingdom  OX5 1GB
  • Authors:
    • Cordeau, Jean-Francois
    • Laporte, Gilbert
    • Savelsbergh, Martin W P
    • Vigo, Daniele
  • Publication Date: 2007

Language

  • English

Media Info

  • Media Type: Print
  • Edition: Volume 14
  • Features: Figures; References;
  • Pagination: pp 367-428
  • Monograph Title: Handbooks in Operations Research and Management Science

Subject/Index Terms

Filing Info

  • Accession Number: 01109131
  • Record Type: Publication
  • ISBN: 97804444513465
  • Files: TRIS
  • Created Date: Aug 22 2008 8:43AM