{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T01:44:36Z","timestamp":1775612676858,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,10,7]],"date-time":"2012-10-07T00:00:00Z","timestamp":1349568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0567-4","type":"journal-article","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T06:14:17Z","timestamp":1349504057000},"page":"1525-1535","source":"Crossref","is-referenced-by-count":102,"title":["A parallel matheuristic for the technician routing and scheduling problem"],"prefix":"10.1007","volume":"7","author":[{"given":"V.","family":"Pillac","sequence":"first","affiliation":[]},{"given":"C.","family":"Gu\u00e9ret","sequence":"additional","affiliation":[]},{"given":"A. L.","family":"Medaglia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,7]]},"reference":[{"issue":"4","key":"567_CR1","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.cie.2007.06.002","volume":"53","author":"C Akjiratikarl","year":"2007","unstructured":"Akjiratikarl, C., Yenradee, P., Drake, P.R.: PSO-based algorithm for home care worker scheduling in the UK. Compu. Ind. Eng. 53(4), 559\u2013583 (2007)","journal-title":"Compu. Ind. Eng."},{"issue":"10","key":"567_CR2","doi-asserted-by":"crossref","first-page":"2866","DOI":"10.1016\/j.cor.2005.01.015","volume":"33","author":"S Bertels","year":"2006","unstructured":"Bertels, S., Fahle, T.: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Operat. Res. 33(10), 2866\u20132890 (2006)","journal-title":"Comput. Operat. Res."},{"issue":"1","key":"567_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstr\u00f6m","year":"2008","unstructured":"Bredstr\u00f6m, D., R\u00f6nnqvist, M.: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Operat. Res. 191(1), 19\u201331 (2008)","journal-title":"Eur. J. Operat. Res."},{"issue":"4","key":"567_CR4","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"JF Cordeau","year":"2010","unstructured":"Cordeau, J.F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4), 393\u2013409 (2010)","journal-title":"J. Sched."},{"issue":"3","key":"567_CR5","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.ejor.2005.01.011","volume":"171","author":"P Eveborn","year":"2006","unstructured":"Eveborn, P., Flisberg, P., R\u00f6nnqvist, M.: LAPS CARE\u2014an operational system for staff planning of home care. Eur. J. Operat. Res. 171(3), 962\u2013976 (2006)","journal-title":"Eur. J. Operat. Res."},{"key":"567_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10479-009-0545-0","volume":"183","author":"H Hashimoto","year":"2011","unstructured":"Hashimoto, H., Boussier, S., Vasquez, M., Wilbaut, C.: A GRASP-based approach for technicians and interventions scheduling for telecommunications. Ann. Operat. Res. 183, 143\u2013161 (2011)","journal-title":"Ann. Operat. Res."},{"key":"567_CR7","doi-asserted-by":"crossref","unstructured":"Kovacs, A., Parragh, S., Doerner, K., Hartl, R.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. :1\u201322 (2011). doi: 10.1007\/s10951-011-0246-9","DOI":"10.1007\/s10951-011-0246-9"},{"key":"567_CR8","unstructured":"Parragh, S.N.: Solving a real-world service technician routing and scheduling problem. In Proceedings of the Seventh Triennial Symposium on Transportation Analysis (TRISTAN VII) (2010)"},{"key":"567_CR9","unstructured":"Pillac, V., Gu\u00e9ret, C., Medaglia, A.L.: A parallel matheuristic for the technician routing and scheduling problem: supplementary material (online) (2011). http:\/\/hdl.handle.net\/1992\/1145"},{"issue":"8","key":"567_CR10","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.: A general heuristic for vehicle routing problems. Comput. Operat. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Operat. Res."},{"issue":"3","key":"567_CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"JY Potvin","year":"1993","unstructured":"Potvin, J.Y., Rousseau, J.M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Operat. Res. 66(3), 331\u2013340 (1993)","journal-title":"Eur. J. Operat. Res."},{"issue":"6","key":"567_CR12","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins, C.: Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng. Appl. Artif. Intell. 22(6), 916\u2013928 (2009)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"567_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"M Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.: The vehicle routing problem with time windows: minimizing route duration. INFORMS J. Comput. 4(2), 146\u2013154 (1992)","journal-title":"INFORMS J. Comput."},{"key":"567_CR14","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and Practice of Constraint Programming\u2014CP98. Lecture Notes in Computer Science vol. 1520, pp. 417\u2013431 (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"key":"567_CR15","unstructured":"Solomon, M.M.: Algorithms for the vehicle-routing and scheduling problems with time window constraints. Operat. Res. 35(2), 254\u2013265 (1987)"},{"key":"567_CR16","unstructured":"Tang, H., Miller-Hooks, E., Tomastik, R.: Scheduling technicians for planned maintenance of geographically distributed equipment. Transp. Res. Part E: Log. Transp. Rev. 43(5), 591\u2013609 (2007)"},{"issue":"3","key":"567_CR17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"Tsang, E., Voudouris, C.: Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Operat. Res. Lett. 20(3), 119\u2013127 (1997)","journal-title":"Operat. Res. Lett."},{"key":"567_CR18","unstructured":"Vidal, T., Crainic, T., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Comput. Operat. Res. 40(1), 475\u2013489 (2013)"},{"key":"567_CR19","doi-asserted-by":"crossref","unstructured":"Villegas, J.G.: Vehicle routing problems with trailers. 4OR: Q. J. Operat. Res. (2012). doi: 10.1007\/s10288-011-0186-4","DOI":"10.1007\/s10288-011-0186-4"},{"issue":"5","key":"567_CR20","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J Xu","year":"2001","unstructured":"Xu, J., Chiu, S.: Effective heuristic procedures for a field technician scheduling problem. J. Heurist. 7(5), 495\u2013509 (2001)","journal-title":"J. Heurist."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0567-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0567-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0567-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T12:53:37Z","timestamp":1562244817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0567-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,7]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["567"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0567-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,7]]}}}