A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
From MaRDI portal
Publication:2294528
DOI10.1016/J.ORL.2019.11.005OpenAlexW2991383021WikidataQ126641451 ScholiaQ126641451MaRDI QIDQ2294528FDOQ2294528
Authors: Y. K. Agarwal, Prahalad Venkateshan 
Publication date: 11 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2019.11.005
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Title not available (Why is that?)
- The vehicle routing problem
- The vehicle routing problem with backhauls
- Reverse logistics: simultaneous design of delivery routes and returns strategies
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- An exact method for the vehicle routing problem with backhauls
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Vehicle Routing
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Title not available (Why is that?)
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Cited In (2)
Uses Software
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)
