Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery

Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery

0.00 Avg rating0 Votes
Article ID: iaor20119264
Volume: 39
Issue: 5
Start Page Number: 338
End Page Number: 341
Publication Date: Sep 2011
Journal: Operations Research Letters
Authors: , , ,
Keywords: branch-and-cut
Abstract:

We propose a branch‐and‐cut approach over a formulation with only the edge variables. Additional route feasibility constraints are applied in a lazy fashion. We present improved lower bounds and several new optimal solutions.

Reviews

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