{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T06:49:45Z","timestamp":1768805385058,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T00:00:00Z","timestamp":1319673600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10732-011-9191-1","type":"journal-article","created":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T12:48:18Z","timestamp":1319633298000},"page":"375-400","source":"Crossref","is-referenced-by-count":12,"title":["Real-time management of vehicle breakdowns in urban freight distribution"],"prefix":"10.1007","volume":"18","author":[{"given":"I.","family":"Minis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mamasis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Zeimpekis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,27]]},"reference":[{"issue":"1","key":"9191_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C. Archetti","year":"2007","unstructured":"Archetti, C., Hertz, A., Speranza, M.: Metaheuristics for the team orienteering problem. J. Heuristics 13(1), 49\u201376 (2007)","journal-title":"J. Heuristics"},{"issue":"6","key":"9191_CR2","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1057\/palgrave.jors.2602603","volume":"60","author":"C. Archetti","year":"2009","unstructured":"Archetti, C., Feillet, D., Hertz, A., Speranza, M.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6), 831\u2013842 (2009)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9191_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","volume":"5","author":"S. Boussier","year":"2007","unstructured":"Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR 5(3), 211\u2013230 (2007)","journal-title":"4OR"},{"key":"9191_CR4","volume-title":"Proceedings of Route 2000 Workshop","author":"O. Br\u00e4ysy","year":"2000","unstructured":"Br\u00e4ysy, O., Berger, J., Barkaoui, M.: A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. In: Proceedings of Route 2000 Workshop, Skodsborg, Denmark (2000)"},{"issue":"11","key":"9191_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"S. Butt","year":"1994","unstructured":"Butt, S., Cavalier, T.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21(11), 101\u2013123 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9191_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"S. Butt","year":"1999","unstructured":"Butt, S., Ryan, D.: An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput. Oper. Res. 26(4), 427\u2013441 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9191_CR7","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I. Chao","year":"1996","unstructured":"Chao, I., Golden, B., Wasil, E.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996a)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9191_CR8","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.: A\u00a0fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res., 88(3), 475\u2013489 (1996b)","journal-title":"Eur. J. Oper. Res."},{"key":"9191_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-1-4615-4567-5_5","volume-title":"Computing Tools for Modeling, Optimization and Simulation","author":"A. Fink","year":"2000","unstructured":"Fink, A., Schneidereit, G., Vo\u00df, S.: Solving general ring network design problems by meta-heuristics. In: Laguna, M., Gonzalez Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation, pp.\u00a091\u2013113. Kluwer Academic, Boston (2000)"},{"issue":"3","key":"9191_CR10","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.: The orienteering problem. Nav. Res. Logist. 34(3), 307\u2013318 (1987)","journal-title":"Nav. Res. Logist."},{"issue":"3","key":"9191_CR11","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.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3), 648\u2013665 (2008)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9191_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s12469-010-0017-6","volume":"1","author":"K. Kepaptsoglou","year":"2010","unstructured":"Kepaptsoglou, K., Karlaftis, M.G.: The bus bridging problem in metro operations: conceptual framework, models and algorithms. Public Transp. 1(4), 275\u2013297 (2010)","journal-title":"Public Transp."},{"issue":"3","key":"9191_CR13","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2007.12.037","volume":"194","author":"J.-Q. Li","year":"2009","unstructured":"Li, J.-Q., Mirchandani, P.B., Borenstein, D.: Real-time vehicle rerouting problems with time windows. Eur. J. Oper. Res. 194(3), 711\u2013727 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9191_CR14","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solution of the travelling salesman problem. Bell Syst. Tech. J. 44(1), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"9191_CR15","author":"Q. Mu","year":"2010","unstructured":"Mu, Q., Fu, Z., Lysgaard, J., Eglese, R.: Disruption management of the vehicle routing problem with vehicle breakdown. J.\u00a0Oper. Res. Soc. (2010). doi: 10.1057\/jors.2010.19","journal-title":"J.\u00a0Oper. Res. Soc."},{"issue":"1","key":"9191_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H.N. Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: status and prospects. Ann. Oper. Res. 61(1), 143\u2013164 (1995)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9191_CR17","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0377-2217(95)00016-J","volume":"83","author":"C. Rego","year":"1995","unstructured":"Rego, C., Roucairol, C.: Using tabu search for solving a dynamic multi-terminal truck dispatching problem. Eur. J. Oper. Res. 83(2), 411\u2013429 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9191_CR18","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M.W.P. Savelsbergh","year":"1998","unstructured":"Savelsbergh, M.W.P., Sol, M.: Drive: dynamic routing of independent vehicles. Oper. Res. 46(4), 474\u2013490 (1998)","journal-title":"Oper. Res."},{"key":"9191_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/net.3230160205","volume":"16","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Networks 16, 161\u2013167 (1987)","journal-title":"Networks"},{"issue":"11","key":"9191_CR20","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W. Souffriau","year":"2010","unstructured":"Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., Van Oudheusden, D.: A\u00a0path relinking approach for the team orienteering problem. Comput. Oper. Res. 37(11), 1853\u20131859 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9191_CR21","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H. Tang","year":"2005","unstructured":"Tang, H., Miller-Hooks, E.: A\u00a0tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379\u20131407 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9191_CR22","first-page":"1","volume":"4","author":"M. Tasgetiren","year":"2001","unstructured":"Tasgetiren, M.: A\u00a0genetic algorithm with an adaptive penalty function for the orienteering problem. J. Econ. Soc. Res., 4(2), 1\u201326 (2001)","journal-title":"J. Econ. Soc. Res."},{"issue":"9","key":"9191_CR23","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T. Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"9191_CR24","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1016\/j.ejor.2007.03.017","volume":"187","author":"P. Tsirimpas","year":"2008","unstructured":"Tsirimpas, P., Tatarakis, A., Minis, I., Kyriakidis, E.G.: Single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 187(2), 483\u2013495 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9191_CR25","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"P. Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: A\u00a0guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118\u2013127 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9191-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9191-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9191-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:32Z","timestamp":1559242472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9191-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,27]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9191"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9191-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,27]]}}}