Heuristics for the periodic capacitated arc routing problem - Archive ouverte HAL Access content directly
Journal Articles Journal of Intelligent Manufacturing Year : 2005

Heuristics for the periodic capacitated arc routing problem

(1) , (1) , (1)
1

Abstract

The Capacitated Arc Routing Problem (CARP) involves the routing of vehicles to service a set of arcs in a network. This NP-hard problem is extended to a multiperiod horizon, giving a new tactical problem called the Periodic CARP (PCARP). This problem actually occurs in municipal waste collection. Its objective is to assign arcs to periods and to compute the trips in each period, to minimize an overall cost on the horizon. An integer linear program, two insertion heuristics and a two-phase heuristic are developed. These very first algorithms for the PCARP are evaluated on PCARP instances derived from standard CARP benchmarks from literature: the insertion heuristics are very fast but the two-phase method yields better solution costs.

Dates and versions

hal-02493970 , version 1 (28-02-2020)

Identifiers

Cite

Feng Chu, Christian Prins, Nacima Labadie. Heuristics for the periodic capacitated arc routing problem. Journal of Intelligent Manufacturing, 2005, 16 (2), pp.243-251. ⟨10.1007/s10845-004-5892-8⟩. ⟨hal-02493970⟩

Collections

CNRS UTT LOSI
22 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More