The capacitated arc routing problem with refill points

Authors:
Alberto Amaya;André Langevin;Martin TréPanier
Affiliations:
CRT, GERAD, and Department of Mathematics and Industrial Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montréal, Qué., Canada H3C 3A7;CRT, GERAD, and Department of Mathematics and Industrial Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montréal, Qué., Canada H3C 3A7;CRT, GERAD, and Department of Mathematics and Industrial Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montréal, Qué., Canada H3C 3A7
Venue:
Operations Research Letters
Year:
2007

Citing 2
Cited 6

The Capacitated Arc Routing Problem: Valid Inequalities and Facets

Computational Optimization and Applications
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research

Lower bounds for the mixed capacitated arc routing problem

Computers and Operations Research
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
The periodic capacitated arc routing problem with irregular services

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

Computers and Operations Research
The double layer optimization problem to express logistics systems and its heuristic algorithm

Expert Systems with Applications: An International Journal
Location-arc routing problem: Heuristic approaches and test instances

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article introduces the capacitated arc routing problem with refill points (CARP-RP). The vehicle servicing arcs must be refilled on the spot by using a second vehicle. The problem consists on simultaneously determining the vehicles routes that minimize the total cost. An integer linear programming model is proposed and tested.