Skip to Main content Skip to Navigation
Journal articles

The Periodic Capacitated Arc Routing Problem linear programming model, metaheuristic and lower bounds

Abstract : The Periodic Capacitated Arc Routing Problem (PCARP) generalizes the well known NP-hard Capacitated Arc Routing Problem (CARP) by extending the single period to multi-period horizon. The Capacitated Arc Routing Problem (CARP) is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, called tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips in each period, to minimize the total cost on the whole horizon. This new problem arises in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and preliminary lower bounds based on graph transformation are proposed. A meta-heuristic approach-Scatter Search (SS) is developed for the PCARP and evaluated on a large variety of instances.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02521826
Contributor : Daniel Gavrysiak <>
Submitted on : Friday, March 27, 2020 - 4:12:42 PM
Last modification on : Tuesday, June 2, 2020 - 9:22:02 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Feng Chu, Nacima Labadie, Christian Prins. The Periodic Capacitated Arc Routing Problem linear programming model, metaheuristic and lower bounds. Journal of Systems Science and Systems Engineering, Springer Verlag (Germany), 2004, 13 (4), pp.423-435. ⟨10.1007/s11518-006-0174-y⟩. ⟨hal-02521826⟩

Share

Metrics

Record views

223