New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
From MaRDI portal
Publication:6065909
DOI10.1002/net.22069OpenAlexW3175586709MaRDI QIDQ6065909
Y. K. Agarwal, Prahalad Venkateshan
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22069
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Cites Work
- Branch-cut-and-price 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
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- Reverse logistics: simultaneous design of delivery routes and returns strategies
- The vehicle routing problem. Latest advances and new challenges.
- The vehicle routing problem with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- The Vehicle Routing Problem
- An Exact Method for the Vehicle Routing Problem with Backhauls
- Vehicle Routing
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- The General Pickup and Delivery Problem
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
