An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes

Authors:
M. Angélica Salazar-Aguilar;André Langevin;Gilbert Laporte
Affiliations:
CIRRELT, HEC Montréal, Canada;CIRRELT and Département de Mathématiques et de Génie Industriel, École Polytechnique de Montréal;CIRRELT and Canada Research Chair in Distribution Management, HEC Montréal
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 3
Cited 1

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing

Computers and Operations Research

Synchronized arc routing for snow plowing operations

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A synchronized arc routing problem (SyARP) for snow plowing operations is introduced. Given a network of streets and a fleet of snow plowing vehicles, the SyARP consists of determining a set of routes such that all streets, some of which have multiple lanes, are plowed by using synchronized vehicles, and the ending time of the longest route is minimized. A mathematical formulation and an adaptive large neighborhood search heuristic are proposed. The performance of the proposed solution procedure is evaluated over a large set of instances. Computational results reveal that the proposed procedure yields good quality feasible solutions.