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

DOI10.1016/j.orl.2011.06.012zbMath1235.90040OpenAlexW2119949770MaRDI QIDQ408394

Eduardo Uchoa, Artur Alves Pessoa, Anand Subramanian, Luiz Satoru Ochi

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.06.012

zbMATH Keywords

vehicle routingbranch-and-cutsimultaneous pickup and delivery

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)

Related Items (13)

Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Multiobjective vehicle routing problem with fixed delivery and optional collections ⋮ Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery ⋮ A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery ⋮ The paired many-to-many pickup and delivery problem: an application

Uses Software

• CVRPSP

Cites Work

• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
• Local search for the undirected capacitated arc routing problem with profits
• An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up

This page was built for publication: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery