{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:41:54Z","timestamp":1783352514918,"version":"3.54.6"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T00:00:00Z","timestamp":1649289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T00:00:00Z","timestamp":1649289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["522800 - 17"],"award-info":[{"award-number":["522800 - 17"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10479-022-04658-8","type":"journal-article","created":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T20:02:40Z","timestamp":1649361760000},"page":"371-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Optimization of the technician routing and scheduling problem for a telecommunication industry"],"prefix":"10.1007","volume":"315","author":[{"given":"Ehsan","family":"Pourjavad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4890-4677","authenticated-orcid":false,"given":"Eman","family":"Almehdawe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,7]]},"reference":[{"issue":"4","key":"4658_CR1","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.cie.2012.05.002","volume":"63","author":"D Barrera","year":"2012","unstructured":"Barrera, D., Velasco, N., & Amaya, C.-A. (2012). A network-based approach to the multi-activity combined timetabling and crew scheduling problem: Workforce scheduling for public health policy implementation. Computers & Industrial Engineering, 63(4), 802\u2013812.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"4658_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/inte.33.1.67.12722","volume":"33","author":"F Blakeley","year":"2003","unstructured":"Blakeley, F., Arg\u00fcello, B., Cao, B., Hall, W., & Knolmajer, J. (2003). Optimizing periodic maintenance operations for schindler elevator corporation. Interfaces, 33(1), 67\u201379.","journal-title":"Interfaces"},{"key":"4658_CR3","doi-asserted-by":"crossref","unstructured":"Bostel, N., Dejax, P., Guez, P., & Tricoire, F. (2008). Multiperiod planning and routing on a rolling horizon for field force optimization logistics. In The vehicle routing problem: latest advances and new challenges, pp. 503\u2013525. Springer.","DOI":"10.1007\/978-0-387-77778-8_23"},{"issue":"1","key":"4658_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","volume":"239","author":"JA Castillo-Salazar","year":"2016","unstructured":"Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1), 39\u201367.","journal-title":"Annals of Operations Research"},{"key":"4658_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.omega.2015.07.006","volume":"61","author":"X Chen","year":"2016","unstructured":"Chen, X., Thomas, B. W., & Hewitt, M. (2016). The technician routing problem with experience-based service times. Omega, 61, 49\u201361.","journal-title":"Omega"},{"key":"4658_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.12.026","volume":"82","author":"X Chen","year":"2017","unstructured":"Chen, X., Thomas, B. W., & Hewitt, M. (2017). Multi-period technician scheduling with experience-based service times and stochastic customers. Computers & Operations Research, 82, 1\u201314.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"4658_CR7","doi-asserted-by":"publisher","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(4), 393\u2013409.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"4658_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.ejor.2014.03.006","volume":"238","author":"CE Cort\u00e9s","year":"2014","unstructured":"Cort\u00e9s, C. E., Gendreau, M., Rousseau, L. M., Souyris, S., & Weintraub, A. (2014). Branch-and-price and constraint programming for solving a real-life technician dispatching problem. European Journal of Operational Research, 238(1), 300\u2013312.","journal-title":"European Journal of Operational Research"},{"key":"4658_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cor.2016.05.003","volume":"75","author":"RB Damm","year":"2016","unstructured":"Damm, R. B., Resende, M. G., & Ronconi, D. P. (2016). A biased random key genetic algorithm for the field technician scheduling problem. Computers & Operations Research, 75, 49\u201363.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"4658_CR10","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","volume":"36","author":"A Dohn","year":"2009","unstructured":"Dohn, A., Kolind, E., & Clausen, J. (2009). The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers & Operations Research, 36(4), 1145\u20131157.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"4658_CR11","doi-asserted-by":"publisher","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. (2006). Laps care-an operational system for staff planning of home care. European Journal of Operational Research, 171(3), 962\u2013976.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4658_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ejor.2013.05.021","volume":"231","author":"A Goel","year":"2013","unstructured":"Goel, A., & Meisel, F. (2013). Workforce routing and scheduling for electricity network maintenance with downtime minimization. European Journal of Operational Research, 231(1), 210\u2013228.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4658_CR13","doi-asserted-by":"publisher","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. (2011). A grasp-based approach for technicians and interventions scheduling for telecommunications. Annals of Operations Research, 183(1), 143\u2013161.","journal-title":"Annals of Operations Research"},{"key":"4658_CR14","doi-asserted-by":"crossref","unstructured":"Khalfay, A., Crispin, A., and Crockett, K. (2017). A review of technician and task scheduling problems, datasets and solution approaches. In 2017 Intelligent Systems Conference (IntelliSys), pp. 288\u2013296. IEEE.","DOI":"10.1109\/IntelliSys.2017.8324306"},{"issue":"5","key":"4658_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs, A. A., Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of scheduling, 15(5), 579\u2013600.","journal-title":"Journal of scheduling"},{"issue":"1","key":"4658_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G Laporte","year":"1995","unstructured":"Laporte, G., & Osman, I. H. (1995). Routing problems: A bibliography. Annals of operations research, 61(1), 227\u2013262.","journal-title":"Annals of operations research"},{"issue":"11","key":"4658_CR17","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1057\/palgrave.jors.2601782","volume":"55","author":"A Lim","year":"2004","unstructured":"Lim, A., Rodrigues, B., & Song, L. (2004). Manpower allocation with time windows. Journal of the Operational Research Society, 55(11), 1178\u20131186.","journal-title":"Journal of the Operational Research Society"},{"key":"4658_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ress.2015.09.016","volume":"145","author":"E L\u00f3pez-Santana","year":"2016","unstructured":"L\u00f3pez-Santana, E., Akhavan-Tabatabaei, R., Dieulle, L., Labadie, N., & Medaglia, A. L. (2016). On the combined maintenance and routing optimization problem. Reliability Engineering & System Safety, 145, 199\u2013214.","journal-title":"Reliability Engineering & System Safety"},{"issue":"4","key":"4658_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ecoinf.2006.07.003","volume":"1","author":"AR Mehrabian","year":"2006","unstructured":"Mehrabian, A. R., & Lucas, C. (2006). A novel numerical optimization algorithm inspired from weed colonization. Ecological informatics, 1(4), 355\u2013366.","journal-title":"Ecological informatics"},{"issue":"5","key":"4658_CR20","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1057\/jors.2014.11","volume":"66","author":"M M\u0131s\u0131r","year":"2015","unstructured":"M\u0131s\u0131r, M., Smet, P., & Vanden Berghe, G. (2015). An analysis of generalised heuristics for vehicle routing and personnel rostering problems. Journal of the Operational Research Society, 66(5), 858\u2013870.","journal-title":"Journal of the Operational Research Society"},{"key":"4658_CR21","unstructured":"Mohammadi, M., Razmi, J., & Tavakkoli-Moghaddam, R. (2013). Multi-objective invasive weed optimization for stochastic green hub location routing problem with simultaneous pick-ups and deliveries. Economic Computation & Economic Cybernetics Studies & Research, 47(3)."},{"issue":"3","key":"4658_CR22","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2017.05.035","volume":"263","author":"DC Paraskevopoulos","year":"2017","unstructured":"Paraskevopoulos, D. C., Laporte, G., Repoussis, P. P., & Tarantilis, C. D. (2017). Resource constrained routing and scheduling: Review and research prospects. European Journal of Operational Research, 263(3), 737\u2013754.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"4658_CR23","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","volume":"7","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gueret, C., & Medaglia, A. L. (2013). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters, 7(7), 1525\u20131535.","journal-title":"Optimization Letters"},{"issue":"3","key":"4658_CR24","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.ejor.2011.10.048","volume":"219","author":"MS Rasmussen","year":"2012","unstructured":"Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219(3), 598\u2013610.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"4658_CR25","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1007\/s11590-012-0557-6","volume":"7","author":"S Souyris","year":"2013","unstructured":"Souyris, S., Cort\u00e9s, C. E., Ord\u00f3\u00f1ez, F., & Weintraub, A. (2013). A robust optimization approach to dispatching technicians under stochastic service times. Optimization Letters, 7(7), 1549\u20131568.","journal-title":"Optimization Letters"},{"issue":"5","key":"4658_CR26","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2006.03.004","volume":"43","author":"H Tang","year":"2007","unstructured":"Tang, H., Miller-Hooks, E., & Tomastik, R. (2007). Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Research Part E: Logistics and Transportation Review, 43(5), 591\u2013609.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"5","key":"4658_CR27","doi-asserted-by":"publisher","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(5), 495\u2013509.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"4658_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2016.06.058","volume":"257","author":"E Zamorano","year":"2017","unstructured":"Zamorano, E., & Stolletz, R. (2017). Branch-and-price approaches for the multiperiod technician routing and scheduling problem. European Journal of Operational Research, 257(1), 55\u201368.","journal-title":"European Journal of Operational Research"},{"key":"4658_CR29","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.procs.2016.07.127","volume":"91","author":"Y Zhao","year":"2016","unstructured":"Zhao, Y., Leng, L., Qian, Z., & Wang, W. (2016). A discrete hybrid invasive weed optimization algorithm for the capacitated vehicle routing problem. Procedia Computer Science, 91, 978\u2013987.","journal-title":"Procedia Computer Science"},{"key":"4658_CR30","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou, Y., Luo, Q., Chen, H., He, A., & Wu, J. (2015). A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing, 151, 1227\u20131236.","journal-title":"Neurocomputing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04658-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04658-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04658-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T15:36:20Z","timestamp":1659022580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04658-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,7]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["4658"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04658-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,7]]},"assertion":[{"value":"7 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}