SpringerLink
Log in

Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows

  • Conference paper
  • First Online:
Artificial Evolution (EA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8752))

Abstract

The Team Orienteering Problem (TOP) is a variant of the vehicle routing problem. Given a set of vertices, each one associated with a score, the goal of TOP is to maximize the sum of the scores collected by a fixed number of vehicles within a certain prescribed time limit. More particularly, the Team Orienteering Problem with Time Windows (TOPTW) imposes the period of time of customer availability as a constraint to assimilate the real world situations. In this paper, we present a memetic algorithm for TOPTW based on the application of split strategy to evaluate an individual. The effectiveness of the proposed MA is shown by many experiments conducted on benchmark problem instances available in the literature. The computational results indicate that the proposed algorithm competes with the heuristic approaches present in the literature and improves best known solutions in \(101\) instances.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.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

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 39.58
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 51.36
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR 8(1), 49–70 (2010)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  4. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105–119 (1997)

    Article  MATH  Google Scholar 

  5. Dang, D.-C., Guibadj, R.N., Moukrim, A.: A PSO-based memetic algorithm for the team orienteering problem. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part II. LNCS, vol. 6625, pp. 471–480. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Dang, D.C., Guibadj, R.N., Moukrim, A.: An effective pso-inspired algorithm for the team orienteering problem. Eur. J. Oper. Res. 229(2), 332–344 (2013)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629–635 (1992)

    Article  MATH  Google Scholar 

  9. Labadie, N., Mansini, R., Melechovský, J., Calvo, R.W.: The team orienteering problem with time windows: An lp-based granular variable neighborhood search. Eur. J. Oper. Res. 220(1), 15–27 (2012)

    Article  MATH  Google Scholar 

  10. Labadie, N., Melechovský, J., Calvo, R.W.: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J. Heuristics 17(6), 729–753 (2011)

    Article  MATH  Google Scholar 

  11. Lin, S.W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 217(1), 94–107 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  12. Montemanni, R., Gambardella, L.: Ant colony system for team orienteering problems with time windows. Found. Comput. Decis. Sci. 34(4), 287–306 (2009)

    Google Scholar 

  13. Moscato, P.: Memetic algorithms: a short introduction. In: New Ideas in Optimization, pp. 219–234. McGraw-Hill Ltd., Maidenhead (1999)

    Google Scholar 

  14. Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part i: Tabu search. INFORMS J. Comput. 8(2), 158–164 (1996)

    Article  MATH  Google Scholar 

  15. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Prins, C., Labadie, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 47(2), 507–535 (2009)

    Article  MATH  Google Scholar 

  17. Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36(4), 1191–1203 (2009)

    Article  MATH  Google Scholar 

  18. Sadykov, R., Vanderbeck, F.: Bin packing with conflicts: a generic branch-and-price algorithm (2012). (preprint accepted for publication in INFORMS Journal on Computing)

    Google Scholar 

  19. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  20. 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 

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

    Article  Google Scholar 

  22. Tarjan, R.E.: Graph theory and gaussian elimination. Technical report, Stanford University (1975)

    Google Scholar 

  23. Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37, 351–367 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  25. Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)

    Article  MATH  Google Scholar 

  26. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12), 3281–3290 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Heudiasyc, UMR 7253 CNRS, Université de Technologie de Compiègne, 60205, Compiègne, France

    Rym Nesrine Guibadj & Aziz Moukrim

Authors
  1. Rym Nesrine Guibadj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aziz Moukrim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rym Nesrine Guibadj .

Editor information

Editors and Affiliations

  1. INRIA Bordeaux sud-ouest, Equipe CQFD, Institut de Mathématiques de Bordeaux, Université de Bordeaux, Bordeaux, France

    Pierrick Legrand

  2. Université de Bordeaux, Bordeaux, France

    Marc-Michel Corsini

  3. Université d'Angers, Angers Cedex 01, France

    **-Kao Hao

  4. Laboratoire d’Informatique de l’Université de Tours, Ecole Polytechnique de l’Université de Tours, Tours, France

    Nicolas Monmarché

  5. INRA, UMR, Thirverval-Grignon, France

    Evelyne Lutton

  6. Equipe TAO, INRIA Futurs, LRI, University of Paris Sud, Orsay cedex, France

    Marc Schoenauer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Guibadj, R.N., Moukrim, A. (2014). Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows. In: Legrand, P., Corsini, MM., Hao, JK., Monmarché, N., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2013. Lecture Notes in Computer Science(), vol 8752. Springer, Cham. https://doi.org/10.1007/978-3-319-11683-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11683-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11682-2

  • Online ISBN: 978-3-319-11683-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation