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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Benavent A. Corberan J. M. Sanchis (2000) Linear Programming Based Methods for Solving Arc Routing Problems M. Dror (Eds) Arc Routing. Theory, Solutions and applications Kluwer Academic Publishers Boston 231–275
N. Christofides J. E. Beasley (1984) ArticleTitleThe period routing problem Networks 14 237–256
J. F. Cordeau M. Gendreau G. Laporte (1997) ArticleTitleA tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 105–119
T. H. Cormen, C. E. Leiserson, R. L. Rivest, (1990) Introduction to algorithms, MIT Press.
R. Hirabayashi R. Saruwatari N. Nishida (1992) ArticleTitleTour construction algorithm for the Capacitated Arc Routing Problem Asia-Pacific Journal of Operational Research 9 155–175
B. L. Golden J. S. DeArmon E. K. Baker (1983) ArticleTitleComputational experiments with algorithms for a class of routing problems Computers and Operations Research 10 IssueID1 47–59
B. L. Golden R. T. Wong (1981) ArticleTitleCapacitated arc routing problems Networks 11 305–315
A. Hertz G. Laporte M. Mittaz (2000) ArticleTitleA tabu search heuristic for the capacitated arc routing problem Operations Research 48 IssueID1 129–135
P. Lacomme, C. Prins, W. Ramdane-Chérif (2001) A genetic algorithm for the capacitated arc routing problem and its extensions, in Applications of evolutionnary computing, Lecture Notes in Computer Sciences 2037,E. J. W. Boers (eds), Springer,pp. 473–483.
Lacomme P., Prins C. and Ramdane-Chérif W. (2002) Evolutionary algorithms for multiperiod arc routing problems. Proc. of the 9th Int. Conf. on Information Processing and Management of Uncertainty in Knowledge-Based systems (IPMU 2002), ESIAUniversity of Savoie, 845–852
Mingozzi A. and Valletta A. (2002) A lower bound for the Period Vehicle Routing Problem. Oral communication. International Symposium on Combinatorial Optimization (CO’02), Paris, France, 08-10/04/2002.
W. L. Pearn (1988) ArticleTitleNew lower bounds for the capacitated arc routing problem Networks 18 181–191
C. C. R. Tan J. E. Beasley (1984) ArticleTitleA heuristic for the period vehicle routing problem OMEGA International Journal of Management Science 12 IssueID5 497–504
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chu, F., Labadi, N. & Prins, C. Heuristics for the periodic capacitated arc routing problem. J Intell Manuf 16, 243–251 (2005). https://doi.org/10.1007/s10845-004-5892-8
Issue Date:
DOI: https://doi.org/10.1007/s10845-004-5892-8