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

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

doi:10.1007/978-3-642-21527-8_46

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 or section in a book/report/conference proceeding › Chapter in a published conference proceeding

5 Citations (SciVal)

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 language	English
Title of host publication	Network Optimization - 5th International Conference, INOC 2011, Proceedings
Pages	406-411
Number of pages	6
DOIs	https://doi.org/10.1007/978-3-642-21527-8_46
Publication status	Published - 2011
Event	5th International Conference on Network Optimization, INOC 2011 - Hamburg, Germany Duration: 13 Jun 2011 → 16 Jun 2011

Publication series

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

Conference

Conference	5th International Conference on Network Optimization, INOC 2011
Country/Territory	Germany
City	Hamburg
Period	13/06/11 → 16/06/11

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-21527-8_46

Cite this

Salazar-Aguilar, M. A., Langevin, A., & Laporte, G. (2011). An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes. In Network Optimization - 5th International Conference, INOC 2011, Proceedings (pp. 406-411). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6701 LNCS). https://doi.org/10.1007/978-3-642-21527-8_46

An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes. / Salazar-Aguilar, M. Angélica; Langevin, André; Laporte, Gilbert.
Network Optimization - 5th International Conference, INOC 2011, Proceedings. 2011. p. 406-411 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6701 LNCS).

Research output: Chapter or section in a book/report/conference proceeding › Chapter in a published conference proceeding

Salazar-Aguilar, MA, Langevin, A & Laporte, G 2011, An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes. in Network Optimization - 5th International Conference, INOC 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6701 LNCS, pp. 406-411, 5th International Conference on Network Optimization, INOC 2011, Hamburg, Germany, 13/06/11. https://doi.org/10.1007/978-3-642-21527-8_46

Salazar-Aguilar MA, Langevin A, Laporte G. An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes. In Network Optimization - 5th International Conference, INOC 2011, Proceedings. 2011. p. 406-411. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-21527-8_46

Salazar-Aguilar, M. Angélica ; Langevin, André ; Laporte, Gilbert. / An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes. Network Optimization - 5th International Conference, INOC 2011, Proceedings. 2011. pp. 406-411 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2d1b8acaa1ea4afda5df847e83b6d698,

title = "An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes",

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.",

author = "Salazar-Aguilar, {M. Ang{\'e}lica} and Andr{\'e} Langevin and Gilbert Laporte",

year = "2011",

doi = "10.1007/978-3-642-21527-8_46",

language = "English",

isbn = "9783642215261",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "406--411",

booktitle = "Network Optimization - 5th International Conference, INOC 2011, Proceedings",

note = "5th International Conference on Network Optimization, INOC 2011 ; Conference date: 13-06-2011 Through 16-06-2011",

}

TY - GEN

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

AU - Salazar-Aguilar, M. Angélica

AU - Langevin, André

AU - Laporte, Gilbert

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80052989929&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-21527-8_46

DO - 10.1007/978-3-642-21527-8_46

M3 - Chapter in a published conference proceeding

AN - SCOPUS:80052989929

SN - 9783642215261

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 406

EP - 411

BT - Network Optimization - 5th International Conference, INOC 2011, Proceedings

T2 - 5th International Conference on Network Optimization, INOC 2011

Y2 - 13 June 2011 through 16 June 2011

ER -

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this