Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Authors:
José-Manuel Belenguer;Enrique Benavent;Nacima Labadi;Christian Prins;Mohamed Reghioui
Affiliations:
Departamento d'Estadística i Investigació Operativa, Universitat de València, 46100 Burjassot (València), Spain;Departamento d'Estadística i Investigació Operativa, Universitat de València, 46100 Burjassot (València), Spain;ICD-LOSI (FRE CNRS 2848), Université de Technologie de Troyes, 10010 Troyes, France;ICD-LOSI (FRE CNRS 2848), Université de Technologie de Troyes, 10010 Troyes, France;ENSA de Tétouan, Mhannech II, BP 2121 Tétouan, Morocco
Venue:
Transportation Science
Year:
2010

Citing 17
Cited 4

Variable neighborhood search

Computers and Operations Research
The Capacitated Arc Routing Problem: Valid Inequalities and Facets

Computational Optimization and Applications
A cutting plane algorithm for the capacitated arc routing problem

Computers and Operations Research
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
A Lower Bound for the Split Delivery Vehicle Routing Problem

Operations Research
Complexity and Reducibility of the Skip Delivery Problem

Transportation Science
Exact methods based on node-routing formulations for undirected arc-routing problems

Networks
MA|PM: memetic algorithms with population management

Computers and Operations Research
Solving capacitated arc routing problems using a transformation to the CVRP

Computers and Operations Research
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

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

Transportation Science
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

Networks
A deterministic tabu search algorithm for the capacitated arc routing problem

Computers and Operations Research
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Transportation Science
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
Evolutionary local search for the super-peer selection problem and the p-hub median problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
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

GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots

Engineering Applications of Artificial Intelligence
An effective hybrid evolutionary local search for orienteering and team orienteering problems with time windows

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
An ILS-Based metaheuristic for the stacker crane problem

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
The double layer optimization problem to express logistics systems and its heuristic algorithm

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes lower and upper bounds for the split-delivery capacitated arc-routing problem (SDCARP), a variant of the capacitated arc-routing problem in which an edge can be serviced by several vehicles. Recent papers on related problems in node routing have shown that this policy can bring significant savings. It is also more realistic in applications such as urban refuse collection, where a vehicle can become full in the middle of a street segment. This work presents the first lower bound for the SDCARP, computed with a cutting plane algorithm and an evolutionary local search reinforced by a multistart procedure and a variable neighborhood descent. Tests on 126 instances show that the new metaheuristic outperforms on average a published memetic algorithm; achieves small deviations to the lower bound; and finds 44 optima, including 10 new ones.