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 | |
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 |
Funding
This work was supported by CONACYT under the program of postdoctoral training abroad 2009-2010 and the SMM-FSK 2010.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science