A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries

DOI10.1016/j.orl.2019.11.005OpenAlexW2991383021WikidataQ126641451 ScholiaQ126641451MaRDI QIDQ2294528

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

zbMATH Keywords

reverse logisticsbranch-and-cutVRP with simultaneous pickup and delivery

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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 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
• The Vehicle Routing Problem
• An Exact Method for the Vehicle Routing Problem with Backhauls
• Vehicle Routing
• An Exact Algorithm for the Vehicle Routing Problem with Backhauls
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up