Skip to main content
SpringerLink
Log in

An Efficient Metaheuristic for the Time-Dependent Team Orienteering Problem with Time Windows

  • Conference paper
  • First Online:
Computer Information Systems and Industrial Management (CISIM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12133))

  • 670 Accesses

Abstract

The Time-Dependent Team Orienteering Problem with Time Windows (TDTOPTW) is a combinatorial optimization problem defined on graphs. The goal is to find most profitable set of paths in time-dependent graphs, where travel times (weights) between vertices varies with time. Its real life applications include tourist trip planning in transport networks. The paper presents an evolutionary algorithm with local search operators solving the problem. The algorithm was tested on public transport network of Athens and clearly outperformed other published methods achieving results close to optimal in short execution times.

The research was carried out as part of the research work number WZ/WI/1/19 at the Bialystok University of Technology, financed from a subsidy provided by the Minister of Science and Higher Education.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Campbell, A.M., Gendreau, M., Barrett, W.T.: The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186(1), 61–81 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  2. Campos, V., Marti, R., Sanchez-Oro, J., Duarte, A.: Grasp with path relinking for the orienteering problem. J. Oper. Res. Soc. 156, 1–14 (2013)

    Google Scholar 

  3. Caserta, M., Voss, S.: A hybrid algorithm for the DNA sequencing problem. Discrete Appl. Math. 163(1), 87–99 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chao, I., Golden, B., Wasil, E.: Theory and methodology - a fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88, 475–489 (1996)

    Article  MATH  Google Scholar 

  5. Divsalar, A., Sorensen, K., Vansteenwegen, P., Cattrysse, D.: A memetic algorithm for the orienteering problem with hotel selection. Eur. J. Oper. Res. 237(1), 29–49 (2014)

    Article  MATH  Google Scholar 

  6. Garcia, A., Vansteenwegen, P., Arbelaitz, O., Souffriau, W., Linaza, M.T.: Integrating public transportation in personalised electronic tourist guides. Comput. Oper. Res. 40(3), 758–774 (2013)

    Article  Google Scholar 

  7. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Vathis, N.: Heuristics for the time dependent team orienteering problem: application to tourist route planning. Comput. Oper. Res. 62, 36–50 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106, 539–545 (1998)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  10. Gunawan, A., Yuan, Z., Lau, H.C.: A Mathematical Model and Metaheuristics for Time Dependent Orienteering Problem. Angewandte Mathematik und Optimierung Schriftenreihe AMOS 14 (2014)

    Google Scholar 

  11. Hutter, F., Hoos, H.H., Leyton-Brown, K., Stutzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267–306 (2009)

    Article  MATH  Google Scholar 

  12. Li, J.: Model and algorithm for Time-Dependent Team Orienteering Problem. Commun. Comput. Inf. Sci. 175, 1–7 (2011)

    Google Scholar 

  13. Mahfoud, S.W.: Crowding and preselection revisited. In: Proceedings of the 2nd International Conference on Parallel Problem Solving from Nature (PPSN II), Brussels, Belgium, pp. 27–36. Elsevier, Amsterdam (1992)

    Google Scholar 

  14. Ostrowski, K.: Parameters tuning of evolutionary algorithm for the orienteering problem. Adv. Comput. Sci. Res. 12, 53–78 (2015)

    Google Scholar 

  15. Ostrowski, K., Karbowska-Chilinska, J., Koszelew, J., Zabielski, P.: Evolution-inspired local improvement algorithm solving orienteering problem. Ann. Oper. Res. 253(1), 519–543 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ostrowski, K.: Evolutionary algorithm for the Time-Dependent Orienteering Problem. Lect. Notes Comput. Sci. 10244, 50–62 (2017)

    Article  Google Scholar 

  17. Ostrowski, K.: An effective metaheuristic for tourist trip planning in public transport networks. Appl. Comput. Sci. 12(2) (2018)

    Google Scholar 

  18. Schilde, M., Doerner, K., Hartl, R., Kiechle, G.: Metaheuristics for the biobjective orienteering problem. Swarm Intell. 3, 179–201 (2009)

    Article  Google Scholar 

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

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

    Article  MATH  Google Scholar 

  21. Verbeeck, C., Sorensen, K., Aghezzaf, E.H., Vansteenwegena, P.: A fast solution method for the time-dependent orienteering problem. Eur. J. Oper. Res. 236(2), 419–432 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  22. Yu, Q., Fang, K., Zhu, N., Ma, S.: A matheuristic approach to the orienteering problem with service time dependent profits. Eur. J. Oper. Res. 273(2), 488–503 (2019)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Telecommunication, Bialystok University of Technology, ul. Wiejska 45A, 15-001, Bialystok, Poland

    Krzysztof Ostrowski

Authors
  1. Krzysztof Ostrowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krzysztof Ostrowski .

Editor information

Editors and Affiliations

  1. Bialystok University of Technology, Bialystok, Poland

    Khalid Saeed

  2. VSB - Technical University of Ostrava, Ostrava, Czech Republic

    Jiří Dvorský

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ostrowski, K. (2020). An Efficient Metaheuristic for the Time-Dependent Team Orienteering Problem with Time Windows. In: Saeed, K., Dvorský, J. (eds) Computer Information Systems and Industrial Management. CISIM 2020. Lecture Notes in Computer Science(), vol 12133. Springer, Cham. https://doi.org/10.1007/978-3-030-47679-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-47679-3_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-47678-6

  • Online ISBN: 978-3-030-47679-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation