Skip to main content
SpringerLink
Log in

GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The Clustered Prize-collecting Arc Routing Problem is an arc routing problem where each demand edge is associated with a profit which is collected once if the edge is serviced, independently of the number of times it is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced.

This paper presents GRASP and Path Relinking heuristics for the Clustered Prize-collecting Arc Routing Problem. For the constructive phase of the GRASP two different strategies are considered. One of them follows a bottom-up style whereas the other one is a top-down procedure. The best solutions obtained with both strategies are used as elite solutions for the Path Relinking. The results of extensive computational experiments are presented and analyzed.

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

  • Aráoz, J., Fernández, E., Zoltan, C.: The Privatized Rural Postman Problem. Comput. Oper. Res. 33, 3432–3449 (2006)

    Article  MATH  Google Scholar 

  • Aráoz, J., Fernández, E., Meza, O.: Solving the Prize-collecting Rural Postman Problem. Eur. J. Oper. Res. 196(3), 886–896 (2009)

    Article  MATH  Google Scholar 

  • Aráoz, J., Fernández, E., Franquesa, C.: The clustered prize-collecting arc routing problem. Transp. Sci. 43(3), 287–300 (2009)

    Article  Google Scholar 

  • Archetti, C., Feillet, D., Hertz, A., Speranza, M.G.: The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11), 1860–1869 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Assad, A.A., Golden, B.L.: Arc routing methods and applications. In: Network Routing. Handbooks in Operations Research and Management Science, vol. 8, pp. 375–483 (1995)

    Chapter  Google Scholar 

  • Beltrami, E.L., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4, 65–94 (1974)

    Article  MATH  Google Scholar 

  • Benavent, E., Carrotta, A., Corberán, A., Sanchis, J.M., Vigo, D.: Lower bounds and heuristics for the windy rural postman problem. Eur. J. Oper. Res. 176, 855–869 (2007)

    Article  MATH  Google Scholar 

  • Bodin, L.D., Kursh, S.J.: A computer-assisted system for the routing and scheduling of street sweepers. Oper. Res. 26, 525–537 (1978)

    Article  Google Scholar 

  • Christofides, N.: The optimum traversal of a graph. Omega 1, 719–732 (1973)

    Article  Google Scholar 

  • Corberán, A., Martí, R., Sanchís, J.M.: A GRASP heuristic for the mixed Chinese postman problem. Eur. J. Oper. Res. 142(1), 70–80 (2002)

    Article  MATH  Google Scholar 

  • Corberán, A., Fernández, E., Franquesa, C., Sanchís, J.M.: The windy prize-collecting arc-routing problem. Transp. Sci. 45, 317–334 (2011)

    Article  Google Scholar 

  • Delmaire, H., Díaz, J.A., Fernández, E., Ortega, M.: Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. Inf. Syst. Oper. Res. 37, 194–225 (1999)

    Google Scholar 

  • Díaz, J.A., Fernández, E.: Hybrid scatter search and path relinking for the capacitated p-median problem. Eur. J. Oper. Res. 169(2), 570–585 (2006)

    Article  MATH  Google Scholar 

  • Drews, D.: Liberalisation, privatisation and regulation in the German postal services sector. Deliverable 1 for the Project Privatisation of Public Services and the Impact on Quality, Employment and Productivity (PIQUE) CIT5-2006-028478 (2006)

  • Dror, M.: Arc Routing: Theory, Solutions and Applications. Kluwer Academic, Dordrecht (2000)

    Book  MATH  Google Scholar 

  • Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese Postman. Math. Program. 8, 88–124 (1973)

    Article  MathSciNet  Google Scholar 

  • Feillet, D., Dejax, P., Gendreau, M.: The Profitable Arc Tour Problem: solution with a branch-and-price algorithm. Transp. Sci. 39, 539–552 (2005)

    Article  Google Scholar 

  • Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  • Fernández, E., Meza, O., Garfinkel, R., Ortega, M.: On the undirected rural postman problem: tight bounds based on a new formulation. Oper. Res. 51, 281–291 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  • Franquesa, C.: The Clustered Prize-collecting Arc Routing Problem. PhD Thesis, Technical University of Catalonia (2008)

  • Franquesa, C., Aráoz, J., Fernández, E.: A greedy random adaptive search procedure heuristic for the clustered prize-collecting arc routing problem. In: MHILP, Seville, November (2009)

    Google Scholar 

  • Frederickson, G.N.: Approximation algorithms for some postman problems. J. ACM 7, 178–193 (1979)

    MathSciNet  Google Scholar 

  • Glover, F.: Tabu search and adaptive memory programming: Advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer Academic, Dordrecht (1996)

    Google Scholar 

  • Glover, F.: Multi-start and strategic oscillation methods: Principles to exploit adaptive memory. In: Laguna, M., González-Velarde, J.J. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Op, pp. 1–24. Kluwer Academic, Dordrecht (2000)

    Chapter  Google Scholar 

  • Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)

    Book  MATH  Google Scholar 

  • Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Control Cybern. 39, 653–684 (2000)

    Google Scholar 

  • Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 26(2), 147–160 (1950)

    MathSciNet  Google Scholar 

  • Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problem. Networks 6, 273–280 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  • Orloff, C.C.: A fundamental problem in vehicle routing. Networks 4, 35–64 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  • Rechioui, M., Prins, C., Labadi, N.: GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows. In: Applications of Evolutionary Computing. Lecture Notes in Computer Science, vol. 4448, pp. 722–731. Springer, Berlin/Heidelberg (2007)

    Google Scholar 

  • Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: Advances and applications. In: Potvin, J.-Y., Gendreau, M. (eds.) Handbook of Metaheuristics, 2nd edn. Springer, New York (2008)

    Google Scholar 

  • Resende, M.G.C.C., Ribeiro, C.C.: In: Burke, E.K., Kendall, G. (eds.) GRASP. Search Methodologies, 2nd edn. Springer, Berlin (2010)

    Google Scholar 

  • Resende, M.G.C., Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174, 54–68 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Resende, M.G.C., Martí, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37(3), 498–508 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Statistics and Operations Research Department, Technical University of Catalonia, Campus Nord, C5-208, Jordi Girona 1–3, 08034, Barcelona, Spain

    Julián Aráoz, Elena Fernández & Carles Franquesa

Authors
  1. Julián Aráoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elena Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carles Franquesa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elena Fernández.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aráoz, J., Fernández, E. & Franquesa, C. GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem. J Heuristics 19, 343–371 (2013). https://doi.org/10.1007/s10732-011-9183-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-011-9183-1

Keywords

Search

Navigation