A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs

Authors:
Mariam Tagmouti;Michel Gendreau;Jean-Yves Potvin
Affiliations:
Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succ. Centre-Ville, Montréal, Québec, Canada H3C 3J7 and Centre interuni ...;Département de mathématiques et de génie industriel, ícole Polytechnique de Montréal, C.P. 6079, succ. Centre-Ville, Montréal, Québec, Canada H3C 3A7 and Centre ...;Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, succ. Centre-Ville, Montréal, Québec, Canada H3C 3J7 and Centre interuni ...
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 8
Cited 2

Augment-insert algorithms for the capacitated arc routing problem

Computers and Operations Research
Routing winter gritting vehicles

CO89 Selected papers of the conference on Combinatorial Optimization
Variable neighborhood search

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
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints

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

Computers and Operations Research
A parallel insert method for the capacitated arc routing problem

Operations Research Letters

Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
The time-dependent prize-collecting arc routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a variable neighborhood descent heuristic for solving a capacitated arc routing problem with time-dependent service costs. The problem is motivated by winter gritting applications where the timing of each intervention is crucial. The variable neighborhood descent is based on neighborhood structures that manipulate arcs or sequences of arcs. Computational results are reported on problems derived from classical capacitated arc routing problem instances. A comparison is also provided with an alternative approach where the arc routing problem is solved after being transformed into an equivalent node routing problem.