Skip to main content
Springer Nature Link
Log in

Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows

  • Conference paper
Applied Algorithms (ICAA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8321))

Included in the following conference series:

  • 1435 Accesses

Abstract

The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model several real life problems. Among them, the route planning problem for tourists interested in visiting multiple points of interest (POIs) using public transport. The main objective of this problem is to select POIs that match tourist preferences, while taking into account a multitude of parameters and constraints and respecting the time available for sightseeing in a daily basis. TDTOPTW is NP-hard while almost the whole body of the related literature addresses the non time dependent version of the problem. The only TDTOPTW heuristic proposed so far is based on the assumption of periodic service schedules. Herein, we propose two efficient cluster-based heuristics for the TDTOPTW which yield high quality solutions, take into account time dependency in calculating travel times between POIs and make no assumption on periodic service schedules. The validation scenario for our prototyped algorithms included the metropolitan transit network and real POI sets compiled from Athens (Greece).

This work was supported by the EU FP7/2007-2013 (DG CONNECT.H5-Smart Cities and Sustainability), under grant agreement no. 288094 (project eCOMPASS).

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
$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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Garcia, A., Vansteenwegen, P., Arbelaitz, O., Souffriau, W., Linaza, M.T.: Integrating public transportation in personalised electronic tourist guides. Computers & Operations Research 40(3), 758–774 (2013)

    Article  Google Scholar 

  2. Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: A survey. European Journal of Operational Research 209(1), 1–10 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  3. Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics 26(2-3), 193–207 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gambardella, L., Montemanni, R., Weyland, D.: Coupling ant colony systems with strong local searches. European Journal of Operational Research 220(3), 831–843 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  5. Labadi, N., Melechovský, J., Wolfler Calvo, R.: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. Journal of Heuristics 17, 729–753 (2011)

    Article  Google Scholar 

  6. Labadi, N., Mansini, R., Melechovský, J., Wolfler Calvo, R.: The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research 220(1), 15–27 (2012)

    Article  MathSciNet  Google Scholar 

  7. Lin, S.W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. European Journal of Operational Research 217(1), 94–107 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Montemanni, R., Gambardella, L.M.: An ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences 34(4), 287–306 (2009)

    Google Scholar 

  9. Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research 37(2), 351–367 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  10. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research 36, 3281–3290 (2009)

    Article  MATH  Google Scholar 

  11. Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Tasoulas, Y.: Cluster-based heuristics for the team orienteering problem with time windows. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 390–401. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Fomin, F.V., Lingas, A.: Approximation algorithms for time-dependent orienteering. Information Processing Letters 83(2), 57–62 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Spieksma, F.C.R.: On the approximability of an interval scheduling problem. Journal of Scheduling 2, 215–227 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  14. Abbaspour, R.A., Samadzadegan, F.: Time-dependent personal tour planning and scheduling in metropolises. Expert Systems and Applications 38, 12439–12452 (2011)

    Article  Google Scholar 

  15. Gavalas, D., et al.: Appendix, http://www2.aegean.gr/dgavalas/public/tdtoptw_instances/icaa_appendix.pdf

  16. Dibbelt, J., Pajor, T., Wagner, D.: User-constrained multi-modal route planning. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX 2012), pp. 118–129 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Cultural Technology and Communication, University of the Aegean, Mytilene, Greece

    Damianos Gavalas

  2. Department of Informatics, University of Piraeus, Piraeus, Greece

    Charalampos Konstantopoulos

  3. Department of Mathematics, University of Athens, Athens, Greece

    Konstantinos Mastakas

  4. Department of Informatics, Technological Educational Institution of Athens, Athens, Greece

    Grammati Pantziou

  5. School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece

    Nikolaos Vathis

  6. Computer Technology Institute and Press “Diophantus” (CTI), Patras, Greece

    Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati Pantziou & Nikolaos Vathis

Authors
  1. Damianos Gavalas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Charalampos Konstantopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Konstantinos Mastakas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Grammati Pantziou
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Nikolaos Vathis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Engineering, Heritage Institute of Technology, Chowbaga Road, Anandapur, 700107, Kolkata, India

    Prosenjit Gupta

  2. Department of Computer Engineering and Informatics, University of Patras, 26500, Patras, Greece

    Christos Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Vathis, N. (2014). Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows. In: Gupta, P., Zaroliagis, C. (eds) Applied Algorithms. ICAA 2014. Lecture Notes in Computer Science, vol 8321. Springer, Cham. https://doi.org/10.1007/978-3-319-04126-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04126-1_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04125-4

  • Online ISBN: 978-3-319-04126-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics