Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- 30 September 2011
- journal article
- research article
- Published by Elsevier BV in Operations Research Letters
- Vol. 39 (5), 338-341
- https://doi.org/10.1016/j.orl.2011.06.012
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveriesExpert Systems with Applications, 2011
- A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and DeliveryComputers & Operations Research, 2010
- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and DeliveryLecture Notes in Computer Science, 2010
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickupComputers & Operations Research, 2009
- A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and CollectionTransportation Science, 2006
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery serviceComputers & Operations Research, 2006
- A new branch-and-cut algorithm for the capacitated vehicle routing problemMathematical Programming, 2004
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-upOR Spectrum, 2001
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhaulingJournal of the Operational Research Society, 1999