An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Authors:
Gilbert Laporte;Roberto Musmanno;Francesca Vocaturo
Affiliations:
HEC Montréal, Monteal, Quebec H3T 2A7, Canada;Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, 87036 Arcavacata di Rende (CS), Italy;Dipartimento di Economia e Statistica, Università della Calabria, 87036 Arcavacata di Rende (CS), Italy
Venue:
Transportation Science
Year:
2010

Citing 16
Cited 9

A priori optimization

Operations Research
A vehicle routing problem with stochastic demand

Operations Research
New optimization heuristics

Journal of Computational Physics
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 Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

Transportation Science
A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem

HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 3 - Volume 3
Exact methods based on node-routing formulations for undirected arc-routing problems

Networks
New lower bound for the capacitated arc routing problem

Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A deterministic tabu search algorithm for the capacitated arc routing problem

Computers and Operations Research
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities

Journal of Heuristics
Exploiting sparsity in pricing routines for the capacitated arc routing problem

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

Computers and Operations Research

The capacitated vehicle routing problem with stochastic demands and time windows

Computers and Operations Research
Synchronized arc routing for snow plowing operations

Computers and Operations Research
The inventory-routing problem with transshipment

Computers and Operations Research
Solving vehicle routing problems using an enhanced clarke-wright algorithm: a case study

ICCL'12 Proceedings of the Third international conference on Computational Logistics
SIM-RandSHARP: a hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands

Proceedings of the Winter Simulation Conference
The synchronized arc and node routing problem: Application to road marking

Computers and Operations Research
The consultation timetabling problem at Danish high schools

Journal of Heuristics
An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Transportation Science
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

The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of the well-known capacitated arc-routing problem (CARP) in which demands are stochastic. This leads to the possibility of route failures whenever the realized demand exceeds the vehicle capacity. This paper presents the CARPSD in the context of garbage collection. It describes an adaptive large-scale neighbourhood search heuristic for the problem. Computational results show the superiority of this algorithm over an alternative solution approach.