Skip to main content
Springer Nature Link
Log in

Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows

  • Conference paper
Experimental Algorithms (SEA 2013)

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

Included in the following conference series:

Abstract

The Team Orienteering Problem with Time Windows (TOPTW) deals with deriving a number of tours comprising a subset of candidate nodes (each associated with a “profit” value and a visiting time window) so as to maximize the overall “profit”, while respecting a specified time span. TOPTW has been used as a reference model for the Tourist Trip Design Problem (TTDP) in order to derive near-optimal multiple-day tours for tourists visiting a destination featuring several points of interest (POIs), taking into account a multitude of POI attributes. TOPTW is an NP-hard problem and the most efficient known heuristic is based on Iterated Local Search (ILS). However, ILS treats each POI separately; hence it tends to overlook highly profitable areas of POIs situated far from the current location, considering them too time-expensive to visit. We propose two cluster-based extensions to ILS addressing the aforementioned weakness by grouping POIs on disjoint clusters (based on geographical criteria), thereby making visits to such POIs more attractive. Our approaches improve on ILS with respect to solutions quality, while executing at comparable time and reducing the frequency of overly long transfers among POIs.

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. Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics (NRL) 34(3), 307–318 (1987)

    Article  MATH  Google Scholar 

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

  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. Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics 26(2-3), 193–207 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  7. Li, Z., Hu, X.: The team orienteering problem with capacity constraint and time window. In: The Tenth International Symposium on Operations Research and Its Applications (ISORA 2011), pp. 157–163 (August 2011)

    Google Scholar 

  8. Likas, A., Vlassis, N., Verbeek, J.: The global k-means clustering algorithm. Pattern Recognition 36(2), 451–461 (2003)

    Article  Google Scholar 

  9. 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  MathSciNet  MATH  Google Scholar 

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

  11. Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35, 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  12. 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  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. 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, 3281–3290 (2009)

    Article  MATH  Google Scholar 

  15. Vansteenwegen, P., Van Oudheusden, D.: The mobile tourist guide: An or opportunity. Operational Research Insight 20(3), 21–27 (2007)

    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 & Yiannis Tasoulas

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

    Konstantinos Mastakas

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

    Grammati Pantziou

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. Yiannis Tasoulas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Systems Analysis and Computer Science (IASI), National Research Council (CNR), Viale Manzoni 30, 00185, Rome, Italy

    Vincenzo Bonifaci

  2. Department of Computer and Systems Science, Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy

    Camil Demetrescu  & Alberto Marchetti-Spaccamela  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Tasoulas, Y. (2013). Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38527-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38526-1

  • Online ISBN: 978-3-642-38527-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics