Solving vehicle routing problems with time windows with constraint programming based column generation

Solving vehicle routing problems with time windows with constraint programming based column generation

0.00 Avg rating0 Votes
Article ID: iaor2005537
Country: Netherlands
Volume: 130
Issue: 1
Start Page Number: 199
End Page Number: 216
Publication Date: Aug 2004
Journal: Annals of Operations Research
Authors: , , ,
Keywords: constraint programming
Abstract:

Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming to solve column generation subproblems. In the past, this framework has been used to solve scheduling problems where the associated graph is naturally acyclic and has done so very efficiently. This paper attempts to solve problems whose graph is cyclic by nature, such as routing problems, by solving the elementary shortest path problem with constraint programming. We also introduce new redundant constraints which can be useful in the general framework. The experimental results are comparable to those of the similar method in the literature but the proposed method yields a much more flexible approach.

Reviews

Required fields are marked *. Your email address will not be published.