Vehicle Routing Problem with Time Windows

Brian Kallehauge (), Jesper Larsen (), Oli B.G. Madsen () and Marius M. Solomon ()
Additional contact information
Brian Kallehauge: Technical University of Denmark
Jesper Larsen: Technical University of Denmark
Oli B.G. Madsen: Technical University of Denmark
Marius M. Solomon: Northeastern University

Chapter Chapter 3 in Column Generation, 2005, pp 67-98 from Springer

Abstract: Abstract In this chapter we discuss the Vehicle Routing Problem with Time Windows in terms of its mathematical modeling, its structure and decomposition alternatives. We then present the master problem and the subproblem for the column generation approach, respectively. Next, we illustrate a branch-and-bound framework and address acceleration strategies used to increase the efficiency of branch-and-price methods. Then, we describe generalizations of the problem and report computational results for the classic Solomon test sets. Finally, we present our conclusions and discuss some open problems.

Keywords: Time Window; Column Generation; Master Problem; Vehicle Rout Problem; Short Path Problem (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (31)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25486-9_3

Ordering information: This item can be ordered from
http://www.springer.com/9780387254869

DOI: 10.1007/0-387-25486-2_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().