{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T02:31:47Z","timestamp":1771381907831,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,8,6]],"date-time":"2011-08-06T00:00:00Z","timestamp":1312588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10951-011-0246-9","type":"journal-article","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T17:04:11Z","timestamp":1312563851000},"page":"579-600","source":"Crossref","is-referenced-by-count":161,"title":["Adaptive large neighborhood search for service technician routing and scheduling problems"],"prefix":"10.1007","volume":"15","author":[{"given":"Attila A.","family":"Kovacs","sequence":"first","affiliation":[]},{"given":"Sophie N.","family":"Parragh","sequence":"additional","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,6]]},"reference":[{"key":"246_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. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13, 49\u201376.","journal-title":"Journal of Heuristics"},{"key":"246_CR2","series-title":"Operations research\/computer science interfaces","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/978-0-387-77778-8_23","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"N. Bostel","year":"2008","unstructured":"Bostel, N., Dejax, P., Guez, P., & Tricoire, F. (2008). Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In B. Golden, S. Raghavan, & E. A. Wasil (Eds.), Operations research\/computer science interfaces: Vol.\u00a043. The vehicle routing problem: latest advances and new challenges (pp.\u00a0503\u2013525). New York: Springer."},{"key":"246_CR3","unstructured":"Cook, W., & Rich, J. L. (1999). A\u00a0parallel cutting plane algorithm for the vehicle routing problem with time windows. Technical Report, Computational and Applied Mathematics, Rice University, Houston, TX."},{"key":"246_CR4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1080\/03155986.2001.11732443","volume":"39","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau, J.-F., & Laporte, G. (2001). A\u00a0tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR. Information Systems and Operational Research, 39, 292\u2013298.","journal-title":"INFOR. Information Systems and Operational Research"},{"key":"246_CR5","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"J.-F. Cordeau","year":"2004","unstructured":"Cordeau, J.-F., Laporte, G., & Mercier, A. (2004). Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. Journal of the Operational Research Society, 55, 542\u2013546.","journal-title":"Journal of the Operational Research Society"},{"key":"246_CR6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"J.-F. Cordeau","year":"2010","unstructured":"Cordeau, J.-F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13, 393\u2013409.","journal-title":"Journal of Scheduling"},{"key":"246_CR7","unstructured":"C\u00f4t\u00e9, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). Large neighborhood search for the single vehicle pickup and delivery problem with multiple loading stacks. Technical Report CIRRELT-2009-47."},{"key":"246_CR8","first-page":"166","volume-title":"Operations research proceedings 2002 (SOR 2002)","author":"M. Gr\u00f6tschel","year":"2002","unstructured":"Gr\u00f6tschel, M., Krumke, S. O., Rambau, J., & Torres, L. M. (2002). Online-dispatching of automobile service units. In U. Leopold-Wildburger, F. Rendl, & G. W\u00e4scher (Eds.), Operations research proceedings 2002 (SOR 2002) (pp.\u00a0166\u2013173). Berlin: Springer."},{"key":"246_CR9","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/1.9780898718515.ch13","volume-title":"The vehicle routing problem","author":"E. Hadjiconstantinou","year":"2002","unstructured":"Hadjiconstantinou, E., & Roberts, D. (2002). Routing under uncertainty: An application in the scheduling of field service engineers. In P. Toth & D. Vigo (Eds.), SIAM monographs on discrete mathematics and applications. The vehicle routing problem (pp.\u00a0331\u2013352). Philadelphia: SIAM."},{"key":"246_CR10","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M. Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008). Subset-row inequalities applied to the vehicle routing problem with time windows. Operations Research, 56, 497\u2013511.","journal-title":"Operations Research"},{"key":"246_CR11","unstructured":"Kallehauge, B., Larsen, J., & Madsen, O. B. G. (2000). Lagrangean duality and non-differentiable optimization applied on routing with time windows\u2014experimental results. Technical Report Internal report IMM-REP-2000-8, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark."},{"key":"246_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"246_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"N. Kohl","year":"1999","unstructured":"Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., & Soumis, F. (1999). 2-path cuts for the vehicle routing problem with time windows. Transportation Science, 33, 101\u2013116.","journal-title":"Transportation Science"},{"key":"246_CR14","first-page":"48","volume-title":"Proceedings of the American mathematical society","author":"J. B. Kruskal","year":"1956","unstructured":"Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. In Proceedings of the American mathematical society (vol.\u00a07, pp.\u00a048\u201350)."},{"key":"246_CR15","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D. Pisinger","year":"2007","unstructured":"Pisinger, D., & Ropke, S. (2007). A\u00a0general heuristic for vehicle routing problems. Computers & Operations Research, 34, 2403\u20132435.","journal-title":"Computers & Operations Research"},{"key":"246_CR16","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D. Pisinger","year":"2010","unstructured":"Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M.\u00a0Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (2nd ed., pp.\u00a0399\u2013419).","edition":"2"},{"key":"246_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J. Y. Potvin","year":"1993","unstructured":"Potvin, J. Y., & Rousseau, J. M. (1993). A\u00a0parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66, 331\u2013340.","journal-title":"European Journal of Operational Research"},{"key":"246_CR18","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006a). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40, 455\u2013472.","journal-title":"Transportation Science"},{"key":"246_CR19","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S. Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006b). A\u00a0unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171, 750\u2013775.","journal-title":"European Journal of Operational Research"},{"key":"246_CR20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159, 139\u2013171.","journal-title":"Journal of Computational Physics"},{"key":"246_CR21","volume-title":"Proceedings CP-98, fourth international conference on principles and practice of constraint programming","author":"P. Shaw","year":"1998","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings CP-98, fourth international conference on principles and practice of constraint programming."},{"key":"246_CR22","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254\u2013265.","journal-title":"Operations Research"},{"key":"246_CR23","unstructured":"Tricoire, F. (2006). Optimisation des tourn\u00e9es de v\u00e9hicules et de personnels de maintenance: application \u00e1 la distribution et au traitement des eaux. PhD thesis, \u00c9cole Nationale Sup\u00e9rieure des Techniques Industrielles et des Mines de Nantes."},{"key":"246_CR24","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P. Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2009). Iterated local search for the team orienteering problem with time windows. Computers & Operations Research, 36, 3281\u20133290.","journal-title":"Computers & Operations Research"},{"key":"246_CR25","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. (2011). The orienteering problem: a\u00a0survey. European Journal of Operational Research, 209, 1\u201310.","journal-title":"European Journal of Operational Research"},{"key":"246_CR26","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1057\/palgrave.jors.2600746","volume":"50","author":"A. Weintraub","year":"1999","unstructured":"Weintraub, A., Aboud, J., Fernandez, C., Laporte, G., & Ramirez, E. (1999). An emergency vehicle dispatching system for an electric utility in Chile. Journal of the Operational Research Society, 50, 690\u2013696.","journal-title":"Journal of the Operational Research Society"},{"key":"246_CR27","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J. Xu","year":"2001","unstructured":"Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7, 495\u2013509.","journal-title":"Journal of Heuristics"},{"key":"246_CR28","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1016\/j.ijpe.2007.11.011","volume":"113","author":"G. Z\u00e4pfel","year":"2008","unstructured":"Z\u00e4pfel, G., & B\u00f6gl, M. (2008). Multi-period vehicle routing and crew scheduling with outsourcing options. International Journal of Production Economics, 113, 980\u2013996.","journal-title":"International Journal of Production Economics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0246-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0246-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0246-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:46Z","timestamp":1559468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0246-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,6]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["246"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0246-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,6]]}}}