Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
From MaRDI portal
Publication:376001
DOI10.1007/s11590-012-0570-9zbMath1280.90014OpenAlexW2119310377MaRDI QIDQ376001
Eduardo Uchoa, Artur Alves Pessoa, Anand Subramanian, Luiz Satoru Ochi
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0570-9
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (15)
Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption ⋮ The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ A review of vehicle routing with simultaneous pickup and delivery ⋮ A branch-and-price algorithm for a routing problem with inbound and outbound requests ⋮ New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ A stochastic reverse logistics production routing model with environmental considerations ⋮ A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery ⋮ Exact algorithms for the traveling salesman problem with draft limits ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs ⋮ A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
Uses Software
Cites Work
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- 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
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
