A Lower Bound for the Split Delivery Vehicle Routing Problem
- 1 October 2000
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 48 (5), 801-810
- https://doi.org/10.1287/opre.48.5.801.12407
Abstract
In this paper we consider the Split Delivery Vehicle Routing Problem (SDVRP), a relaxation of the known Capacitated Vehicle Routing Problem (CVRP) in which the demand of any client can be serviced by more than one vehicle. We define a feasible solution of this problem, and we show that the convex hull of the associated incidence vectors is a polyhedron (PSDVRP), whose dimension depends on whether a vehicle visiting a client must service, or not, at least one unit of the client demand. From a partial and linear description of PSDVRP and a new family of valid inequalities, we develop a lower bound whose quality is exhibited in the computational results provided, which include the optimal resolution of some known instances—one of them with 50 clients. This instance is, as far as we know, the biggest one solved so far.This publication has 17 references indexed in Scilit:
- Split-delivery routeing heuristics in livestock feed distributionJournal of the Operational Research Society, 1997
- The split delivery vehicle scheduling problem with time windows and grid network distancesComputers & Operations Research, 1995
- Chapter 4 Analysis of vehicle routing and inventory-routing problemsPublished by Elsevier BV ,1995
- Chapter 1 Vehicle routingPublished by Elsevier BV ,1995
- Vehicle routing with split deliveriesDiscrete Applied Mathematics, 1994
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Polyhedral study of the capacitated vehicle routing problemMathematical Programming, 1993
- Routing and scheduling of vehicles and crews: The state of the artComputers & Operations Research, 1983
- Combinatorial optimization and vehicle fleet planning: Perspectives and prospectsNetworks, 1981
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969