Skip to main content
Springer Nature Link
Log in

A survey on algorithmic approaches for solving tourist trip design problems

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The tourist trip design problem (TTDP) refers to a route-planning problem for tourists interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours, i.e., ordered visits to POIs, which respect tourist constraints and POIs attributes. The main objective of the problem discussed is to select POIs that match tourist preferences, thereby maximizing tourist satisfaction, while taking into account a multitude of parameters and constraints (e.g., distances among POIs, visiting time required for each POI, POIs visiting days/hours, entrance fees, weather conditions) and respecting the time available for sightseeing on a daily basis. The aim of this work is to survey models, algorithmic approaches and methodologies concerning tourist trip design problems. Recent approaches are examined, focusing on problem models that best capture a multitude of realistic POIs attributes and user constraints; further, several interesting TTDP variants are investigated. Open issues and promising prospects in tourist trip planning research are also discussed.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Explore related subjects

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

Notes

  1. A problem for which there is a constant \(c\) such that it is NP-hard to find an approximation algorithm with approximation ratio better than \(c\).

  2. Excess of an \(s-t\) path is the difference of the path length from the shortest \(s-t\) path.

  3. Namely, try exhaustive search.

  4. Given an integer \(k\) and a collection of subsets, of a set \(S\), partitioned into groups, pick \(k\) subsets of that collection such that the cardinality of their union is maximized with the restriction that at most one set is picked from each group.

  5. VRP can be described as the problem of designing optimal delivery or collection routes from a depot to a number of nodes subject to certain constraints. The most common constraints are (i) capacity constraints, i.e., a demand is attached to each node and the sum of weights loaded on any route may not exceed the vehicle capacity, (ii) time constraints over individual routes, (iii) time windows, and (iv) precedence relations between pairs of nodes. Most variants of VRP assume that all nodes must be visited and there is no profit collected when visiting a node.

  6. Program Evaluation Review Technique.

References

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

    Article  Google Scholar 

  • Aksen, D., Aras, N.: Customer selection and profit maximization in vehicle routing problems. In: Operations Research Proceedings 2005, vol. 2005, 37–42 (2006)

  • Aráoz, J., Fernández, E., Meza, O.: Solving the prize-collecting rural postman problem. Eur. J. Oper. Res. 196(3), 886–896 (2009)

    Article  MATH  Google Scholar 

  • Aráoz, J., Fernández, E., Zoltan, C.: Privatized rural postman problems. Comput. Oper. Res. 33(12), 3432–3449 (2006)

    Article  MATH  Google Scholar 

  • Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Dis. Appl. Math. 161(45), 547–557 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  • Archetti, C., Corberan, A., Plana, I., Sanchis, J.M., Speranza M.G.: The team orienteering arc routing problem. Technical report, Department Quantitative Methods, University of Brescia (2012)

  • Archetti, C., Corberan, A., Plana, I., Sanchis, J.M., Speranza M.G.: A matheuristic for the team orienteering arc routing problem. Working paper, Department of Economics and Management, University of Brescia (2013)

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

    Article  MATH  Google Scholar 

  • Archetti, C., Feillet, D., Hertz, A., Speranza, M.G.: The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11), 1860–1869 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  • Archetti, C., Speranza, M.G.: Arc routing problems with profits. Working paper, Department of Economics and Management, University of Brescia (2013)

  • Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1), 1–18 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Arkin, E. M., Mitchell, J. S. B., Narasimhan., G.: Resource-constrained geometric network optimization. In: Proceedings of the 14th Annual Symposium on Computational Geometry, SCG ’98, 307–316 (1998)

  • Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  • Arora, S., Karakostas, G.: A \(2 + \epsilon \) approximation algorithm for the \(k\)-mst problem. Math. Program. 107, 491–504 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Asadpour, A., Goemans, M.X., Madry, A., Gharan, S.O., Saberi, A.: An \(\text{ O }(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’10, 379–389 (2010)

  • Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28(1), 254–262 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  • Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621–636 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  • Bansal, N., Blum, A., Chawla, S., Meyerson, A.: (2004) Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC ’04, 166–174 (2014)

  • Bérubé, J.-F., Gendreau, M., Potvin, J.-Y.: An exact epsilon-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur. J. Oper. Res. 194(1), 39–50 (2009)

    Article  MATH  Google Scholar 

  • Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413–420 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  • Blum, A., Chawla, S., Karger, D. R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward tsp. In: Proceedings of the 44th Annual IEEE Symposium on the Foundations of Computer, Science, 46–55 (2003)

  • Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward tsp. SIAM J. Comput. 37(2), 653–670 (2007)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Campbell, A., Gendreau, M., Thomas, B.: The orienteering problem with stochastic travel and service times. Ann. Oper. Res. 186, 61–81 (2011)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Chekuri, C., Korula, N., Pál, M.: Improved algorithms for orienteering and related problems. In: Proceedings of the 19th Annual ACM-SIAM symposium on Discrete Algorithms, SODA ’08, 661–670 (2008)

  • Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications, pp. 72–83. In: Proceedings of Approximation (2004) Randomization and Combinatorial Optimization, Algorithms and Techniques (2004)

  • Chekuri, C., Pal, M.: A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th Annual IEEE Symposium on the Foundations of Computer, Science, 245–253 (2005)

  • Chen, K., Har-Peled, S.: The orienteering problem in the plane revisited. In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG ’06, 247–254 (2006)

  • Chen, L., Sun, H.-Y., Wang, S.: A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem. Info. Sci. 199, 31–42 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  • Cheverst, K., Mitchell, K., Davies, N.: The role of adaptive hypermedia in a context-aware tourist guide. Commun. ACM 45(5), 47–51 (2002)

    Article  Google Scholar 

  • De Choudhury, M., Feldman, M., Amer-Yahia, S., Golbandi, N., Lempel, R., Yu, C.: Automatic construction of travel itineraries using social breadcrumbs. In: Proceedings of the 21st ACM Conference on Hypertext and Hypermedia, HT ’10, 35–44 (2010)

  • Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145–164 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  • City trip planner, http://www.citytripplanner.com/. Accessed Mar 2014

  • 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 

  • Cordeau, J.-F., Maischberger, M.: A parallel iterated tabu search heuristic for vehicle routing problems. Comput. Oper. Res. 39, 2033–2050 (2012)

    Article  Google Scholar 

  • Crainic, T.G.: Parallel solution methods for vehicle routing problems. In: Golden, B. (ed.) The Vehicle Routing Problem, pp. 497–542. Springer, Berlin (2008)

    Google Scholar 

  • Crainic, T.G., Toulouse, M.: Parallel meta-heuristics. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 497–542. International Series in Operations Research & Management Science, New York (2010)

    Chapter  Google Scholar 

  • 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 

  • Deitch, R., Ladany, S.P.: A heuristic improvement process algorithm for the touring problem. SCIMA 23(2–3), 61–73 (1994)

    MATH  Google Scholar 

  • Deitch, R., Ladany, S.P.: The one-period bus touring problem: solved by an effective heuristic for the orienteering tour problem and improvement algorithm. Eur. J. Oper. Res. 127(1), 69–77 (2000)

    Article  MATH  Google Scholar 

  • Dell’Amico, M., Maffioli, F., Värbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2(3), 297–308 (1995)

    Article  MATH  Google Scholar 

  • Divsalar, A., Vansteenwegen, P., Cattrysse, D.: A memetic algorithm for the orienteering problem with intermediate facilities. In: Proceedings of the 27th Annual Conference of the Belgian Operations Research Society (ORBEL’13) (2013)

  • Divsalar, A., Vansteenwegen, P., Cattrysse, D.: A variable neighborhood search method for the orienteering problem with hotel selection. Int. J. Prod. Eco. 145(1), 150–160 (2013)

    Article  Google Scholar 

  • Doerner, K., Gutjahr, W., Hartl, R., Strauss, C., Stummer, C.: Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann. Oper. Res. 131, 79–99 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Ekici, A., Retharekar, A.: Multiple agents maximum collection problem with time dependent rewards. Comput. Ind. Eng. 64(4), 1009–1018 (2013)

    Article  Google Scholar 

  • Erdogan, G., Laporte, G.: The orienteering problem with variable profits. Networks 61(2), 104–116 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  • Feillet, D., Dejax, P., Gendreau, M.: The profitable arc tour problem: solution with a branch-and-price algorithm. Transport. Sci. 39(4), 539–552 (2005)

    Article  Google Scholar 

  • Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transport. Sci. 39(2), 188–205 (2005)

    Article  Google Scholar 

  • Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  • Fischetti, M., González, J.J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. Informs J. Comput. 10(2), 133–148 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  • Fomin, F.V., Lingas, A.: Approximation algorithms for time-dependent orienteering. Inform. Process. Lett. 83(2), 57–62 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Frederickson, G., Wittman, B.: Approximation algorithms for the traveling repairman and speeding deliveryman problems. Algorithmica 62, 1198–1221 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  • Garcia, A., Arbelaitz, O., Linaza, M., Vansteenwegen, P., Souffriau, W.: Personalized tourist route generation. In: Daniel F., Facca, F., (eds) Current Trends in Web Engineering. Lecture Notes in Computer Science, vol. 6385, pp. 486–497 (2010)

  • Garcia, A., Linaza, M., Arbelaitz, O., Vansteenwegen, P.: Intelligent routing system for a personalised electronic tourist guide. In: Hpken, W., Gretzel, U., Law, R., (eds) Information and Communication Technologies in Tourism 2009, 185–197 (2009)

  • Garcia, A., Linaza, M.T., Arbelaitz, O.: Evaluation of intelligent routes for personalised electronic tourist guides. In: Proceedings of the 19th International Conference on Information and Communication Technologies in Travel and Tourism, 284–295 (2012)

  • 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 

  • Gavalas, D., Kenteris, M., Konstantopoulos, C., Pantziou, G.: Web application for recommending personalised mobile tourist routes. IET Softw. 6(4), 313–322 (2012)

    Article  Google Scholar 

  • Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Tasoulas, Y.: Cluster-based heuristics for the team orienteering problem with time windows. In: Proceedings of 12th International Symposium on Experimental Algorithms (SEA’13), 390–401 (2013)

  • Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., Vathis, N.: Efficient heuristics for the time dependent team orienteering problem with time windows. Technical report, Computer Technology Institute & press “DIOPHANTUS”, TR\_2013.07.15 (http://www2.aegean.gr/dgavalas/public/TR_2013.07.15.pdf) (2013)

  • Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263–273 (1998)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296–317 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  • Golden, B., Wang, Q., Liu, L.: A multifaceted heuristic for the orienteering problem. Nav. Res. Log. 35(3), 359–366 (1988)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: (2012) Approximation algorithms for stochastic orienteering. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’12, 1522–1538 (2012)

  • Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search. In: Voss S., et al., editor, Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, Operations Research/Computer Science Interfaces Series, pages 433–458. Kluwer Academic Publishers (1999)

  • Hu, Q., Lim, A.: An iterative three-component heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 232(2), 276–286 (2014)

    Article  MathSciNet  Google Scholar 

  • Ilhan, T., Iravani, S.M.R., Daskin, M.S.: The orienteering problem with stochastic profits. IIE Trans. 40(4), 406–421 (2008)

    Article  Google Scholar 

  • Jozefowiez, N., Glover, F., Laguna, M.: Multi-objective meta-heuristics for the traveling salesman problem with profits. J. Math. Model. Algorithms 7, 177–195 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  • 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 

  • Kataoka, S., Morito, S.: An algorithm for single constraint maximum collection problem. J. Oper. Res. Soc. Jpn. 31(4), 515–530 (1988)

    MATH  MathSciNet  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 

  • Keller, C.P., Goodchild, M.F.: The multiobjective vending problem: a generalization of the travelling salesman problem. Environ. Plan. B 15, 447–460 (1988)

    Article  Google Scholar 

  • Kenteris, M., Gavalas, D., Economou, D.: An innovative mobile electronic tourist guide application. Pers. Ubiquit. Comput. 13, 103–118 (2009)

    Article  Google Scholar 

  • Kenteris, M., Gavalas, D., Economou, D.: Electronic mobile guides: a survey. Pers. Ubiquit. Comput. 15, 97–111 (2011)

    Article  Google Scholar 

  • Korula, N.J.: Approximation algorithms for network design and orienteering. PhD thesis, University of Illinois at Urbana-Champaign (2010)

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

    Article  Google Scholar 

  • Labadi, N., Melechovský, J., Calvo, R.: An effective hybrid evolutionary local search for orienteering and team orienteering problems with time windows. In Robert S., Carlos C,, Joanna K., and Gnter R., (eds.) Parallel Problem Solving from Nature PPSN XI, Lecture Notes in Computer Science, vol. 6239, pp. 219–228 (2010)

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

    Article  Google Scholar 

  • Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1), 161–172 (1984)

    Article  MATH  Google Scholar 

  • Laporte, G., Martello, S.: The selective travelling salesman problem. Dis. Appl. Math. 26(2–3), 193–207 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  • Li, C.-L., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Oper. Res. 40(4), 790–799 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Li, J.: Model and algorithm for time-dependent team orienteering problem. In: Lin, S., Huang, X. (eds.) Advanced Research on Computer Education. Simulation and Modeling, Communications in Computer and Information Science, pp. 1–7. Springer, Berlin Heidelberg (2011)

    Google Scholar 

  • Li, J., Wu, Q., Li, X., Zhu, D.: Study on the time-dependent orienteering problem. In: Proceedings of the 2010 International Conference on E-Product E-Service and E-Entertainment (ICEEE’2010), 1–4 (2010)

  • Li, Z., Hu, X.: The team orienteering problem with capacity constraint and time window. The 10th International Symposium on Operations Research and its Applications (ISORA 2011), 157–163 (2011)

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

  • Luo, Z., Cheang, B., Lim, A., Zhu, W.: An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem. Eur. J. Oper. Res. 229(3), 673–682 (2013)

    Article  Google Scholar 

  • Maervoet, J., Brackman, P., Verbeeck, K., De Causmaecker, P.,Vanden Berghe, G.: Tour suggestion for outdoor activities. In: Proceedings of the 12th International Symposium on Web and Wireless Geographical Information Systems (W2GIS’13). Lecture Notes in Computer Science, vol. 7820, 54–63 (2013)

  • Malaka, R., Zipf, A.: Deep map - challenging it research in the framework of a tourist information system. In: Proceedings of the International Conference on Information and Communication Technologies in Tourism (ENTER 2000), 15–27 (2000)

  • Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric tsp, k-mst, and related problems. SIAM J. Comput. 28(4), 1298–1309 (1999)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  • mtrip travel guides, http://www.mtrip.com/. Accessed Mar 2014

  • Muthuswamy, S., Lam, S.: Discrete particle swarm optimization for the team orienteering problem. Memetic Comput. 3, 287–303 (2011)

    Article  Google Scholar 

  • Nagarajan, V., Ravi, R.: The directed orienteering problem. Algorithmica 60, 1017–1030 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  • Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209–214 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  • Pang, K.-W.: An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints. Expert Syst. Appl. 38, 11939–11946 (2011)

    Article  Google Scholar 

  • Ramesh, R., Brown, K.M.: An efficient four-phase heuristic for the generalized orienteering problem. Comput. Oper. Res. 18(2), 151–165 (1991)

    Article  MathSciNet  Google Scholar 

  • Ramesh, R., Yoon, Y.-S., Karwan, M.H.: An optimal algorithm for the orienteering tour problem. ORSA J. Comput. 4(2), 155–165 (1992)

    Article  MATH  Google Scholar 

  • Reinelt, G.: Tsplib—a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)

    Article  MATH  Google Scholar 

  • Righini, G., Salani, M.: New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3), 155–170 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  • 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 

  • Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  • Silberholz, J., Golden, B.: The effective application of a new approach to the generalized orienteering problem. J. Heuristics 16, 393–415 (2010)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Souffriau, W., Vansteenwegen, P.: Tourist trip planning functionalities: State of the art and future. In: Proceedings of the 10th International Conference on Current Trends in Web, Engineering (ICWE’10), 474–485 (2010)

  • Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: A greedy randomised adaptive search procedure for the team orienteering problem. In: EU/MEeting 2008 on metaheuristics for logistics and vehicle routing (2008)

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

  • Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: The planning of cycle trips in the province of east flanders. Omega 39(2), 209–213 (2011)

    Article  Google Scholar 

  • Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: The multiconstraint team orienteering problem with multiple time windows. Trans. Sci. 47(1), 53–63 (2013)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Subramanian, A., Drummonda, L.M.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37, 1899–1911 (2010)

    Article  MATH  Google Scholar 

  • Sylejmani, K., Dorn, J., Musliu, N.: A tabu search approach for multi constrained team orienteering problem and its application in touristic trip planning. In: Proceedings of the 12th International Conference on Hybrid Intelligent Systems (HIS’2012), 300–305 (2012)

  • 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 

  • Tang, L., Wang, X.: Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. Int. J. Adv. Manuf. Technol. 29, 1246–1258 (2006)

    Article  Google Scholar 

  • 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(2), 351–367 (2010)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  • Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22, 263–282 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Vansteenwegen, P.: Planning in Tourism and Public Transportation - Attraction Selection by Means of a Personalised Electronic Tourist Guide and Train Transfer Scheduling. PhD thesis, Katholieke Universiteit Leuven (2008)

  • Vansteenwegen, P., Souffriau, W., Sörensen, K.: The travelling salesperson problem with hotel selection. JORS 63(2), 207–217 (2012)

    Article  Google Scholar 

  • 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 

  • 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 

  • 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 

  • Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: The city trip planner: an expert system for tourists. Expert Syst. Appl. 38(6), 6540–6546 (2011)

    Article  Google Scholar 

  • Vansteenwegen, P., Van Oudheusden, D.: The mobile tourist guide: an or opportunity. Oper. Res. Insight 20(3), 21–27 (2007)

    Google Scholar 

  • Vansteenwegen, P., Souffriau, W., Berghe Vanden, G., Oudheusden Van, D.,: Metaheuristics for tourist trip planning. Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems, vol. 624, pp. 15–31. Springer, Berlin Heidelberg (2009)

  • Voudouris, C., Tsang, E.: Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res. 113(2), 469–499 (1999)

    Article  MATH  Google Scholar 

  • Wang, Q., Sun, X., Golden, B.L., Jia, J.: Using artificial neural networks to solve the orienteering problem. Ann. Oper. Res. 61, 111–120 (1995)

    Article  MATH  Google Scholar 

  • Wang, X., Golden, B.L., Wasil, E.A.: Using a genetic algorithm to solve the generalized orienteering problem. The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series, vol. 43, pp. 263–274. Springer, US (2008)

  • Yu, C.C., Chang, H.P.: Personalized location-based recommendation services for tour planning in mobile tourism applications. In: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (EC-Web 2009), volume 5692, 38–49 (2009)

  • Zachariadis, E.E., Kiranoudis, C.T.: Local search for the undirected capacitated arc routing problem with profits. Eur. J. Oper. Res. 210(2), 358–367 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  • Zenker, B., Ludwig, B.: Rose: assisting pedestrians to find preferred events and comfortable public transport connections. In: Proceedings of the 6th International Conference on Mobile Technology, Application, Systems, Mobility ’09, 16:1–16:5 (2009)

Download references

Acknowledgments

We sincerely thank the anonymous referees for their constructive comments which considerably contributed to improving the presentation and structure of our article. This work has been supported by the EU FP7/2007-2013 (DG CONNECT.H5-Smart Cities and Sustainability), under Grant agreement no. 288094 (project eCOMPASS).

Author information

Authors and Affiliations

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

    Damianos Gavalas

  2. Computer Technology Institute and Press ‘Diophantus’ (CTI), Patras, Greece

    Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas & Grammati Pantziou

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

    Charalampos Konstantopoulos

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

    Konstantinos Mastakas

  5. 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 inPubMed Google Scholar

  2. Charalampos Konstantopoulos
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Konstantinos Mastakas
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Grammati Pantziou
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Damianos Gavalas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gavalas, D., Konstantopoulos, C., Mastakas, K. et al. A survey on algorithmic approaches for solving tourist trip design problems. J Heuristics 20, 291–328 (2014). https://doi.org/10.1007/s10732-014-9242-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-014-9242-5

Keywords