Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475776 | Computers & Operations Research | 2013 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte,