{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:41:53Z","timestamp":1775054513269,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10479-017-2409-3","type":"journal-article","created":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T09:14:03Z","timestamp":1486199643000},"page":"481-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["The time-dependent orienteering problem with time windows: a fast ant colony system"],"prefix":"10.1007","volume":"254","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9761-8645","authenticated-orcid":false,"given":"C\u00e9dric","family":"Verbeeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Vansteenwegen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El-Houssaine","family":"Aghezzaf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,4]]},"reference":[{"key":"2409_CR1","doi-asserted-by":"crossref","first-page":"12,439","DOI":"10.1016\/j.eswa.2011.04.025","volume":"38","author":"A Abbaspour","year":"2011","unstructured":"Abbaspour, A., & Samadzadegan, F. (2011). Time-dependent personal tour planning and scheduling in metropolises. Expert Systems with Applications, 38, 12,439\u201312,452.","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"2409_CR2","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1080\/00207721.2011.564321","volume":"43","author":"EH Aghezzaf","year":"2012","unstructured":"Aghezzaf, E. H., Zhong, Y., Raa, B., & Mateo, M. (2012). Analysis of the single-vehicle cyclic inventory routing problem. International Journal of Systems Science, 43(11), 2040\u20132049.","journal-title":"International Journal of Systems Science"},{"issue":"6","key":"2409_CR3","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1016\/j.cor.2010.10.011","volume":"38","author":"S Balseiro","year":"2011","unstructured":"Balseiro, S., Loisea, I., & Ramonet, J. (2011). An ant colony algorithm hybridized with insertion heuristic for the time dependent vehicle routing problem with time windows. Computers and Operations Research, 38(6), 954\u2013966.","journal-title":"Computers and Operations Research"},{"key":"2409_CR4","unstructured":"Be-Mobile (2014) Be-mobile: Floating vehicle data. \n                        http:\/\/www.be-mobile.be"},{"key":"2409_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"I Chao","year":"1996","unstructured":"Chao, I., Golden, B., & Wasil, E. (1996). Theory and methodology a fast and effective heuristic for the orienteering problem. European Journal of Operational Research, 88, 475\u2013489.","journal-title":"European Journal of Operational Research"},{"key":"2409_CR6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.tre.2005.01.003","volume":"42","author":"H Chen","year":"2006","unstructured":"Chen, H., Hsueh, C., & Chang, M. (2006). The real-time time-dependent vehicle routing problem. Transportation Research Part E, 42, 383\u2013408.","journal-title":"Transportation Research Part E"},{"key":"2409_CR7","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1016\/j.ejor.2006.06.047","volume":"185","author":"A Donati","year":"2008","unstructured":"Donati, A., Montemanni, R., Casagrande, N., Rizzoli, A., & Gambardella, L. (2008). Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operational Research, 185, 1174\u20131191.","journal-title":"European Journal of Operational Research"},{"key":"2409_CR8","unstructured":"Evers, L., Glorie, K., van\u00a0der Ster, S., Barros, A., & Monsuur, H. (2012). The orienteering problem under uncertainty stochastic programming and robust optimization compared. Tech. Rep. Econometric Institute Report EI 2012-21, Erasmus University, Econometric Institute, \n                        http:\/\/hdl.handle.net\/1765\/37193"},{"key":"2409_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0020-0190(01)00313-1","volume":"83","author":"F Fomin","year":"2002","unstructured":"Fomin, F., & Lingas, A. (2002). Approximation algorithms for time-dependent orienteering. Information Processing Letters, 83, 57\u201362.","journal-title":"Information Processing Letters"},{"key":"2409_CR10","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/j.cor.2011.03.020","volume":"40","author":"A Garcia","year":"2013","unstructured":"Garcia, A., Vansteenwegen, P., Arbelaitz, O., Souffriau, W., & Linaza, M. (2013). Integrating public transportation in personalised electronic tourist guides. Computers and Operations Research, 40, 758\u2013774.","journal-title":"Computers and Operations Research"},{"key":"2409_CR11","doi-asserted-by":"crossref","unstructured":"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, Lecture Notes in Computer Science, vol 8321, Springer International Publishing, (pp. 152\u2013163).","DOI":"10.1007\/978-3-319-04126-1_13"},{"key":"2409_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.cor.2015.03.016","volume":"62","author":"D Gavalas","year":"2015","unstructured":"Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G., & Vathis, N. (2015). Heuristics for the time dependent team orienteering problem: Application to tourist route planning. Computers and Operations Research, 62, 36\u201350.","journal-title":"Computers and Operations Research"},{"key":"2409_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"B Golden","year":"1987","unstructured":"Golden, B., Levy, L., & Vohra, R. (1987). The orienteering problem. Naval Research Logistics, 34, 307\u2013318.","journal-title":"Naval Research Logistics"},{"key":"2409_CR14","doi-asserted-by":"crossref","unstructured":"Gunawan, A., Lau, H., & Vansteenwegen, P. (2016). Orienteering problem: a survey of recent variants, solution approaches and applications. European Journal of Operational Research (Accepted).","DOI":"10.1016\/j.ejor.2016.04.059"},{"key":"2409_CR15","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","volume":"32","author":"A Haghani","year":"2005","unstructured":"Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers and Operations Research, 32, 2959\u20132986.","journal-title":"Computers and Operations Research"},{"key":"2409_CR16","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.disopt.2007.05.004","volume":"5","author":"H Hashimoto","year":"2008","unstructured":"Hashimoto, H., Yagiurab, M., & Ibaraki, T. (2008). An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization, 5, 434\u2013456.","journal-title":"Discrete Optimization"},{"key":"2409_CR17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua, S., Gendreau, M., & Potvin, J. Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144, 379\u2013396.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2409_CR18","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1057\/jors.1992.88","volume":"43","author":"M Kantor","year":"1992","unstructured":"Kantor, M., & Rosenwein, M. (1992). The orienteering problem with time windows. Journal of Operational Research Society, 43(6), 629\u2013635.","journal-title":"Journal of Operational Research Society"},{"key":"2409_CR19","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke, L., Archetti, C., & Feng, Z. (2008). Ants can solve the team orienteering problem. Computers and Industrial Engineering, 54, 648\u2013665.","journal-title":"Computers and Industrial Engineering"},{"issue":"5","key":"2409_CR20","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1016\/j.cor.2011.05.027","volume":"39","author":"AL Kok","year":"2012","unstructured":"Kok, A. L., Hans, E. W., & Schutten, J. M. J. (2012). Vehicle routing under time-dependent travel times: The impact of congestion avoidance. Computers and Operations Research, 39(5), 910\u2013918.","journal-title":"Computers and Operations Research"},{"key":"2409_CR21","doi-asserted-by":"crossref","unstructured":"Kritzinger, S., Tricoire, F., Doerner, K., & Hartl, R. (2011). Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows. In C. Coello (Ed.), Learning and Intelligent Optimization (Vol. 6683, pp. 61\u201375), Lecture Notes in Computer Science. Berlin: Springer.","DOI":"10.1007\/978-3-642-25566-3_5"},{"key":"2409_CR22","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10288-009-0097-9","volume":"7","author":"C Lecluyse","year":"2009","unstructured":"Lecluyse, C., Van Woensel, T., & Peremans, H. (2009). Vehicle routing with stochastic time-dependent travel times. 4OR: Quarterly journal of Operational Research, 7, 363\u2013377.","journal-title":"4OR: Quarterly journal of Operational Research"},{"key":"2409_CR23","first-page":"1","volume-title":"Advanced research on computer education, simulation and modeling, communications in computer and information science","author":"J Li","year":"2011","unstructured":"Li, J. (2011). Model and algorithm for time-dependent team orienteering problem. In S. Lin & X. Huang (Eds.), Advanced research on computer education, simulation and modeling, communications in computer and information science (Vol. 175, pp. 1\u20137). Berlin: Springer."},{"key":"2409_CR24","doi-asserted-by":"crossref","unstructured":"Li, J., Wu, Q., Li, X., & Zhu, D. (2010). Study on the time-dependent orienteering problem. In: International conference on E-Product E-Service and E-Entertainment (ICEEE), (pp. 1 \u2013 4).","DOI":"10.1109\/ICEEE.2010.5660232"},{"issue":"11","key":"2409_CR25","doi-asserted-by":"crossref","first-page":"2787","DOI":"10.1016\/j.cor.2012.02.010","volume":"39","author":"F Mufalli","year":"2012","unstructured":"Mufalli, F., Batta, R., & Nagi, R. (2012). Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans. Computers and Operations Research, 39(11), 2787\u20132799.","journal-title":"Computers and Operations Research"},{"key":"2409_CR26","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.cor.2004.09.015","volume":"33","author":"J Potvin","year":"2006","unstructured":"Potvin, J., Xu, Y., & Benyahia, I. (2006). Vehicle routing and scheduling with dynamic travel times. Computers and Operations research, 33, 1129\u20131137.","journal-title":"Computers and Operations research"},{"issue":"4","key":"2409_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.5711\/morj.14.4.5","volume":"14","author":"JO Royset","year":"2009","unstructured":"Royset, J. O., & Reber, D. N. (2009). Optimized routing of unmanned aerial systems for the interdiction of improvised explosive devices. Military Operations Research, 14(4), 5\u201319.","journal-title":"Military Operations Research"},{"key":"2409_CR28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde, M., Doerner, K., Hartl, R., & Kiechle, G. (2009). Metaheuristics for the biobjective orienteering problem. Swarm Intelligence, 3, 179\u2013201.","journal-title":"Swarm Intelligence"},{"key":"2409_CR29","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.orl.2008.07.007","volume":"37","author":"D Soler","year":"2009","unstructured":"Soler, D., Albiach, J., & Martinez, E. (2009). A way to optimally solve a time-dependent vehicle routing problem with time windows. Operations Research Letters, 37, 37\u201342.","journal-title":"Operations Research Letters"},{"key":"2409_CR30","unstructured":"S\u00f6rensen, K., Sevaux, M., & Schittekat, P. (2008). Adaptive and multilevel metaheuristics, Lecture Notes in Economics and Mathematical Systems, vol 136, Springer, London, chap Multiple neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods, (pp. 239\u2013253)."},{"key":"2409_CR31","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1080\/08839510802379626","volume":"22","author":"W Souffriau","year":"2008","unstructured":"Souffriau, W., Vansteenwegen, P., Vertommen, J., Vanden Berghe, G., & Van Oudheusden, D. (2008). A personalised tourist trip design algorithm for mobile tourist guides. Applied Artificial Intelligence, 22, 964\u2013985.","journal-title":"Applied Artificial Intelligence"},{"issue":"9","key":"2409_CR32","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T. (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society, 35(9), 797\u2013809.","journal-title":"Journal of the Operational Research Society"},{"key":"2409_CR33","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.ejor.2007.03.012","volume":"186","author":"T Woensel Van","year":"2008","unstructured":"Van Woensel, T., Kerbache, L., Peremans, H., & Vandaele, N. (2008). Vehicle routing with dynamic travel times: A queueing approach. European Journal of Operational Research, 186, 990\u20131007.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2409_CR34","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1057\/ori.2007.17","volume":"20","author":"P Vansteenwegen","year":"2007","unstructured":"Vansteenwegen, P., & Van Oudheusden, D. (2007). The mobile tourist guide: An OR opportunity. OR Insights, 20(3), 21\u201327.","journal-title":"OR Insights"},{"key":"2409_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., & Van Oudheusden, D. (2011a). The orienteering problem: A survey. European Journal of Operational Research, 209, 1\u201310.","journal-title":"European Journal of Operational Research"},{"key":"2409_CR36","doi-asserted-by":"crossref","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","volume":"38","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2011b). The city trip planner: A tourist expert system. Expert Systems with Applications, 38, 6540\u20136546.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"2409_CR37","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ejor.2013.11.038","volume":"236","author":"C Verbeeck","year":"2014","unstructured":"Verbeeck, C., S\u00f6rensen, K., Aghezzaf, E. H., & Vansteenwegen, P. (2014). A fast solution method for the time-dependent orienteering problem. European Journal of Operational Research, 236(2), 419\u2013432.","journal-title":"European Journal of Operational Research"},{"key":"2409_CR38","unstructured":"Wang, X., Golden, B. L., & Wasil, E. A. (2008). The vehicle routing problem: latest advances and new challenges, Springer US, Boston, MA, chap Using a Genetic Algorithm to Solve the Generalized Orienteering Problem (pp. 263\u2013274)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2409-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2409-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2409-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T02:31:59Z","timestamp":1498098719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2409-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,4]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["2409"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2409-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,4]]}}}