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

M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationNetwork Optimization - 5th International Conference, INOC 2011, Proceedings
Pages406-411
Number of pages6
DOIs
Publication statusPublished - 2011
Event5th International Conference on Network Optimization, INOC 2011 - Hamburg, Germany
Duration: 13 Jun 201116 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6701 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Network Optimization, INOC 2011
CountryGermany
CityHamburg
Period13/06/1116/06/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes'. Together they form a unique fingerprint.

Cite this