Abstract
This paper introduces the synchronized arc and node routing problem, inspired from a real application arising in road marking operations. In this setting, several capacitated vehicles are used to paint lines on the roads and a tank vehicle is used to replenish the painting vehicles. The aim of the problem is to determine the routes and schedules for the painting and replenishment vehicles so that the pavement marking is completed within the least possible time. This must be done in such a way that the routes of the painting and replenishment vehicles are synchronized. An adaptive large neighborhood heuristic is described and evaluated over a large set of artificial instances.
| Original language | English |
|---|---|
| Pages (from-to) | 1708-1715 |
| Number of pages | 8 |
| Journal | Computers and Operations Research |
| Volume | 40 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - Jul 2013 |
Funding
This work was supported by CONACYT under the program of postdoctoral training abroad 2011–2012 and by FQRNT (Fonds Québécois de la recherche sur la nature et les technologies) under the program of fellowships for foreign students, and by NSERC under grants RGPIN41978 and 39682-10 . This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.
Keywords
- Adaptive large neighborhood search
- Arc routing
- Node routing
- Road maintenance
- Synchronized routes
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research