The synchronized arc and node routing problem: Application to road marking

Authors:
M. AngéLica Salazar-Aguilar;André Langevin;Gilbert Laporte
Affiliations:
CIRRELT and Canada Research Chair in Distribution Management, HEC Montréal, Canada;CIRRELT and Département de mathématiques et de génie industriel, ícole Polytechnique de Montréal, Canada;CIRRELT and Canada Research Chair in Distribution Management, HEC Montréal, Canada
Venue:
Computers and Operations Research
Year:
2013

Citing 10
Cited 0

The Arc Routing and Scheduling Problem with Transshipment

Transportation Science
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A reactive GRASP for a commercial territory design problem with multiple balancing requirements

Computers and Operations Research
A comparison of five heuristics for the multiple depot vehicle scheduling problem

Journal of Scheduling
An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Transportation Science
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Synchronized arc routing for snow plowing operations

Computers and Operations Research
The inventory-routing problem with transshipment

Computers and Operations Research
The capacitated arc routing problem with refill points

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

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.