Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Operations Research (2009)
- ISSN: 0030364X
- DOI: 10.1287/opre.1090.0713
Available from or.journal.informs.org
or
Available from or.journal.informs.org
Page 1
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
Branch-and-Price-and-Cut
for the
Split Delivery Vehicle Routing Problem
with Time Windows
Guy Desaulniers
E´cole Polytechnique de Montre´al and GERAD
Column Generation 2008
Aussois, France
for the
Split Delivery Vehicle Routing Problem
with Time Windows
Guy Desaulniers
E´cole Polytechnique de Montre´al and GERAD
Column Generation 2008
Aussois, France
Page 2
Introduction
Formulation
Branch-and-price-and-cut method
Computational results
Conclusions
Outline
1 Introduction
Problem definition
Literature review
Main difficulty with branch-and-price for SDVRPTW
2 Formulation
Master problem
Subproblem
3 Branch-and-price-and-cut method
Column generation
Cutting and branching
4 Computational results
5 Conclusions
G. Desaulniers Branch-and-Price-and-Cut for the SDVRPTW
Formulation
Branch-and-price-and-cut method
Computational results
Conclusions
Outline
1 Introduction
Problem definition
Literature review
Main difficulty with branch-and-price for SDVRPTW
2 Formulation
Master problem
Subproblem
3 Branch-and-price-and-cut method
Column generation
Cutting and branching
4 Computational results
5 Conclusions
G. Desaulniers Branch-and-Price-and-Cut for the SDVRPTW
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
14 Readers on Mendeley
by Discipline
14% Mathematics
by Academic Status
57% Ph.D. Student
14% Researcher (at a non-Academic Institution)
7% Post Doc
by Country
21% Portugal
14% Austria
14% Canada