A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
From MaRDI portal
Publication:2294528
Recommendations
- New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- scientific article; zbMATH DE number 4047425
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- A new vehicle routing problem and its two stage algorithm
Cites work
- scientific article; zbMATH DE number 1816805 (Why is no real title available?)
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- 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
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- An exact method for the vehicle routing problem with backhauls
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- 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
- The vehicle routing problem with backhauls
- Vehicle Routing
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
Cited in
(2)
This page was built for publication: A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294528)