Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Systems Science and Systems Engineering Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Amberg, A., Voß S., “A hierarchical relaxations lower bound for the capacitated arc routing problem”, IEEE-DTIST02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Piscataway, pp1–10, 2002.

  2. Assad, A., Pearn W.L., Golden B.L., “The capacitated Chinese postman problem: lower bounds and solvable cases”, American Journal of Mathematical and Management Science, Vol. 7, pp63–88, 1987.

    MathSciNet  Google Scholar 

  3. Belenguer, J. M., Benavent E., “The capacitated are routing problem: valid inequalities and facets”, Computational Optimization and Applications, Vol. 10, pp165–187, 1998.

    Article  MathSciNet  Google Scholar 

  4. Belenguer, J. M., Benavent E., “A cutting plane algorithm for the capacitated arc routing problem”, Computers and Operations Research, Vol. 30, No. 5, pp705–728, 2003.

    Article  MathSciNet  Google Scholar 

  5. Benavent, E., Campos V., Corberan A., “The capacitated arc routing problem: lower bounds”, Networks, Vol. 22, pp669–690, 1992.

    MathSciNet  Google Scholar 

  6. Benavent, E., Corberan A., Sanchis J.M., “Linear programming based methods for solving arc routing problems”, Arc Routing. Theory, Solutions and Applications, Kluwer Academic Publishers, pp231–275, 2000.

  7. Christofides, N., Beasley J. E., “The period routing problem”, Networks, Vol. 14, pp237–256, 1994.

    Google Scholar 

  8. Chu, F., Labadi N., Prins C., “Heuristics for the periodic capacitated arc routing problem”, To appear in Journal of Intelligent Manufacturing (JIM), 2004.

  9. Chu, F., Labadi N., Prins C., “A scatter search for the periodic capacitated arc routing problem”, To appear in European Journal of Operation Research (EJOR), 2004.

  10. Eglese, R. W., “Routing winter gritting vehicles”, Discrete Applied Mathematics, Vol. 48, No. 3, pp231–244, 1994.

    Article  MATH  Google Scholar 

  11. Eglese, R. W., Li L. Y. O., “A tabu search based heuristic for arc routing with a capacitated constraint and time deadline”, Metaheuristics: Theory and Applications, Kluwer, pp633–650, 1996.

  12. Glover, F., “Heuristics for Integer programming using surrogate constraints”, Decision Sciences, Vol. 8, pp156–166, 1977.

    Google Scholar 

  13. Golden, B. L., Wong R. T., “Capacitated arc routing problems”, Networks, Vol. 11, pp305–315,1981.

    MathSciNet  Google Scholar 

  14. Golden, B. L., “Computational experiments with algorithms for a class of routing problems”, Computers and Operation Research, Vol. 10, No. 1, pp47–59, 1983.

    Article  MathSciNet  Google Scholar 

  15. Hertz, A., Laporte G., Mittaz M., “A tabu search heuristic for the capacitated arc routing problem”, Operations Research, Vol. 48, No. 1, pp129–135, 2000.

    Article  MathSciNet  Google Scholar 

  16. Hirabayashi, R., Saruwatari Y., Nishida N., “Tour construction algorithm for the capacitated arc routing problem”, Asia-Pacific Journal of Operational Research, Vol. 9, pp155–175, 1992.

    MathSciNet  Google Scholar 

  17. Kiuchi, M., Shinano Y. Hirabayashi R., Saruwatari Y., “An exact algorithm for the capacitated arc routing problem using parallel branch and bound method”, Abstracts of the Spring National Conference of the Oper. Res. Soc. of Japan, Japon, pp28–29, 1995.

  18. Lacomme, P., Prins, C., Ramdane-Chérif, W., “A genetic algorithm for the capacitated arc routing problem and its extensions”, Applications of Evolutionary Computing, LNCS 2037, Springer, pp473–483, 2001.

  19. Li, L. Y. O. “Vehicle routing for winter gritting”, PhD, dissertation, Lancaster University, United Kingdom, 1992.

    Google Scholar 

  20. Pearn, W. L., “New lower bounds for the capacitated arc routing problem”, Networks, Vol. 18, No. 3, pp181–191, 1988.

    MATH  MathSciNet  Google Scholar 

  21. Ulusoy, G., “The fleet size and mixed problem for capacitated arc routing problem”, European Journal of Operational Research, Vol. 22, No. 3, pp. 329–337, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  22. Zaw, W., “Contributions to routing problems”, PhD. Thesis, Universität Augsburg, Germany, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FRE CNRS 2732 ISTIT-OSI, University of Technology of Troyes, 12 rue Marie Curie, BP2060, 10010, Troyes, France

    Feng Chu, Nacima Labadi & Christian Prins

Authors
  1. Feng Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nacima Labadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Prins
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Feng CHU received the B.S. degree in electrical engineering from Hefei University of Technology, China, in 1986 and the Ph.D. degree in computer science from University of Metz and INRIA, France, in 1995. She is currently an associate professor at the University of Technology of Troyes, France. She is mainly interested in modeling, analysis and optimization of production and logistics systems.

Nacima Labadi is an associate professor in University of Technology of Troyes, in France. She received her Ph.D. degree in Optimisation and Systems Safety from The same university, in 2003. Her principal research interests focus on combinatorial optimisation, mainly in vehicle routing problems.

Christian Prins is a professor of operations research and industrial engineering at the University of Technology of Troyes(UTT), France. He holds a Ph.D. degree in computer science from university Pierre and Marie Curie, in Paris. His research interests are in logistics, scheduling and software engineering aspects in combinatorial Optimization.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chu, F., Labadi, N. & Prins, C. The Periodic Capacitated Arc Routing Problem linear programming model, metaheuristic and lower bounds. J. Syst. Sci. Syst. Eng. 13, 423–435 (2004). https://doi.org/10.1007/s11518-006-0174-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11518-006-0174-y

Keywords

Search

Navigation