A Lower Bound for the Split Delivery Vehicle Routing Problem

Authors:
J. M. Belenguer;M. C. Martinez;E. Mota
Affiliations:
-;-;-
Venue:
Operations Research
Year:
2000

Citing 0
Cited 16

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems

Transportation Science
On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints

Computers and Industrial Engineering
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
A scatter search algorithm for solving vehicle routing problem with loading cost

Expert Systems with Applications: An International Journal
A new metaheuristic for the vehicle routing problem with split demands

EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
An effective memetic algorithm with population management for the split delivery vehicle routing problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A tabu search with vocabulary building approach for the vehicle routing problem with split demands

International Journal of Metaheuristics
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Transportation Science
An adaptive memory algorithm for the split delivery vehicle routing problem

Journal of Heuristics
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

Transportation Science
Routing with early ordering for just-in-time manufacturing systems

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A column generation approach for the split delivery vehicle routing problem

Operations Research Letters
Improved lower bounds for the Split Delivery Vehicle Routing Problem

Operations Research Letters
Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries

Computers and Industrial Engineering
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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 ofPSDVRP 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.