New lower bounds for the vehicle routing problem with simultaneous pickup and delivery

Authors:
Anand Subramanian;Eduardo Uchoa;Luiz Satoru Ochi
Affiliations:
Instituto de Computação, Universidade Federal Fluminense, Niterói-RJ, Brazil;Departamento de Engenharia de Produção, Universidade Federal Fluminense, Niterói-RJ, Brazil;Instituto de Computação, Universidade Federal Fluminense, Niterói-RJ, Brazil
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 6
Cited 0

Models, relaxations and exact approaches for the capacitated vehicle routing problem

Discrete Applied Mathematics
A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

Operations Research
A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

Transportation Science
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are based on the one developed by Baldacci, Hadjiconstantinou and Mingozzi for the Capacitated Vehicle Routing Problem. These new formulations are theoretically compared with the one-commodity flow formulation proposed by Dell’Amico, Righini and Salani. The three formulations were tested within a branch-and-cut scheme and their practical performance was measured in well-known benchmark problems. The undirected two-commodity flow formulation obtained consistently better results. Several optimal solutions to open problems with up to 100 customers and new improved lower bounds for instances with up to 200 customers were found.