Skip to main content

Advertisement

Springer Nature Link
Log in

Real-time management of vehicle breakdowns in urban freight distribution

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper considers a problem in which an unexpected event immobilises a vehicle of a distribution fleet permanently, and the remaining vehicles are rerouted to serve some of the clients of the failed vehicle. We model this case as a variation of the Team Orienteering Problem (TOP), constraining all vehicle routes to an upper time, or distance, limit, and taking into account the limited capacity of the fleet vehicles. The problem requires an effective solution in almost real time. We propose a new heuristic to provide efficient solutions within this strict computational time constraint. To test the quality of the heuristic, we have developed and validated a Genetic Algorithm (GA) that obtains high quality (but computationally expensive) solutions. The solutions of the heuristic compare favorably to those obtained by the GA. The latter has also been tested successfully in a real-time fleet management system.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Archetti, C., Hertz, A., Speranza, M.: Metaheuristics for the team orienteering problem. J. Heuristics 13(1), 49–76 (2007)

    Article  Google Scholar 

  • Archetti, C., Feillet, D., Hertz, A., Speranza, M.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6), 831–842 (2009)

    Article  MATH  Google Scholar 

  • Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR 5(3), 211–230 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Bräysy, O., Berger, J., Barkaoui, M.: A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. In: Proceedings of Route 2000 Workshop, Skodsborg, Denmark (2000)

    Google Scholar 

  • Butt, S., Cavalier, T.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21(11), 101–123 (1994)

    Article  MATH  Google Scholar 

  • Butt, S., Ryan, D.: An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput. Oper. Res. 26(4), 427–441 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  • Chao, I., Golden, B., Wasil, E.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464–474 (1996a)

    Article  MATH  Google Scholar 

  • Chao, I., Golden, B., Wasil, E.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res., 88(3), 475–489 (1996b)

    Article  MATH  Google Scholar 

  • Fink, A., Schneidereit, G., Voß, S.: Solving general ring network design problems by meta-heuristics. In: Laguna, M., Gonzalez Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation, pp. 91–113. Kluwer Academic, Boston (2000)

    Chapter  Google Scholar 

  • Golden, B., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logist. 34(3), 307–318 (1987)

    Article  MATH  Google Scholar 

  • Ke, L., Archetti, C., Feng, Z.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3), 648–665 (2008)

    Article  Google Scholar 

  • Kepaptsoglou, K., Karlaftis, M.G.: The bus bridging problem in metro operations: conceptual framework, models and algorithms. Public Transp. 1(4), 275–297 (2010)

    Article  Google Scholar 

  • Li, J.-Q., Mirchandani, P.B., Borenstein, D.: Real-time vehicle rerouting problems with time windows. Eur. J. Oper. Res. 194(3), 711–727 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  • Lin, S.: Computer solution of the travelling salesman problem. Bell Syst. Tech. J. 44(1), 2245–2269 (1965)

    MATH  Google Scholar 

  • Mu, Q., Fu, Z., Lysgaard, J., Eglese, R.: Disruption management of the vehicle routing problem with vehicle breakdown. J. Oper. Res. Soc. (2010). doi:10.1057/jors.2010.19

    Google Scholar 

  • Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143–164 (1995)

    Article  MATH  Google Scholar 

  • Rego, C., Roucairol, C.: Using tabu search for solving a dynamic multi-terminal truck dispatching problem. Eur. J. Oper. Res. 83(2), 411–429 (1995)

    Article  MATH  Google Scholar 

  • Savelsbergh, M.W.P., Sol, M.: Drive: dynamic routing of independent vehicles. Oper. Res. 46(4), 474–490 (1998)

    Article  MATH  Google Scholar 

  • Solomon, M.M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Networks 16, 161–167 (1987)

    Article  Google Scholar 

  • Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: A path relinking approach for the team orienteering problem. Comput. Oper. Res. 37(11), 1853–1859 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Tang, H., Miller-Hooks, E.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379–1407 (2005)

    Article  Google Scholar 

  • Tasgetiren, M.: A genetic algorithm with an adaptive penalty function for the orienteering problem. J. Econ. Soc. Res., 4(2), 1–26 (2001)

    Google Scholar 

  • Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797–809 (1984)

    Google Scholar 

  • Tsirimpas, P., Tatarakis, A., Minis, I., Kyriakidis, E.G.: Single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 187(2), 483–495 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  • Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118–127 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Financial & Management Engineering, University of the Aegean, Kountouriotou 41, 82100, Chios, Greece

    I. Minis, K. Mamasis & V. Zeimpekis

Authors
  1. I. Minis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Mamasis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Zeimpekis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Minis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minis, I., Mamasis, K. & Zeimpekis, V. Real-time management of vehicle breakdowns in urban freight distribution. J Heuristics 18, 375–400 (2012). https://doi.org/10.1007/s10732-011-9191-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords