{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:25Z","timestamp":1759667785293,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T00:00:00Z","timestamp":1509580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["CB-2013\/220811"],"award-info":[{"award-number":["CB-2013\/220811"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004685","name":"Universidad Aut\u00f3noma de Nuevo Le\u00f3n","doi-asserted-by":"publisher","award":["PAICTY IT480-15"],"award-info":[{"award-number":["PAICTY IT480-15"]}],"id":[{"id":"10.13039\/501100004685","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10100-017-0501-z","type":"journal-article","created":{"date-parts":[[2017,11,2]],"date-time":"2017-11-02T04:52:03Z","timestamp":1509598323000},"page":"199-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The sales force sizing problem with multi-period workload assignments, and service time windows"],"prefix":"10.1007","volume":"27","author":[{"given":"M. Ang\u00e9lica","family":"Salazar-Aguilar","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Boyer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7272-3759","authenticated-orcid":false,"given":"Romeo Sanchez","family":"Nigenda","sequence":"additional","affiliation":[]},{"given":"Iris A.","family":"Mart\u00ednez-Salazar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"issue":"1","key":"501_CR1","first-page":"81","volume":"6","author":"JE Amador-Fontalvo","year":"2014","unstructured":"Amador-Fontalvo JE, Paternina-Arboleda CD, Montoya-Torres JR (2014) Solving the heterogeneous vehicle routing problem with time windows and multiple products via a bacterial meta-heuristic. Int J Adv Oper Manag 6(1):81\u2013100","journal-title":"Int J Adv Oper Manag"},{"key":"501_CR2","doi-asserted-by":"crossref","unstructured":"Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, Boston, pp 3\u201327","DOI":"10.1007\/978-0-387-77778-8_1"},{"issue":"4","key":"501_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10100-007-0036-9","volume":"15","author":"PP Belfiore","year":"2007","unstructured":"Belfiore PP, F\u00e1vero LPL (2007) Scatter search for the fleet size and mix vehicle routing problem with time windows. CEJOR 15(4):351\u2013368","journal-title":"CEJOR"},{"key":"501_CR4","doi-asserted-by":"crossref","unstructured":"Borsani V, Matta A, Beschi G, Sommaruga F (2006) A home care scheduling model for human resources. In: 2006 international conference on service systems and service management, vol 1, pp 449\u2013454","DOI":"10.1109\/ICSSSM.2006.320504"},{"issue":"1","key":"501_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39(1):104\u2013118","journal-title":"Transp Sci"},{"issue":"1","key":"501_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1):119\u2013139","journal-title":"Transp Sci"},{"issue":"2","key":"501_CR7","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2014","unstructured":"Caceres-Cruz J, Arias P, Guimarans D, Riera D, Juan AA (2014) Rich vehicle routing problem: survey. ACM Comput Surv 47(2):32:1\u201332:28","journal-title":"ACM Comput Surv"},{"key":"501_CR8","doi-asserted-by":"crossref","unstructured":"Cappanera P, Gouveia L, Scutell\u00e0 MG (2011) The skill vehicle routing problem. In: Proceedings of the network optimization: 5th international conference, INOC 2011, Hamburg, Germany, June 13\u201316, 2011. Springer, Berlin, pp 354\u2013364","DOI":"10.1007\/978-3-642-21527-8_40"},{"issue":"1","key":"501_CR9","first-page":"29","volume":"2","author":"P Cappanera","year":"2012","unstructured":"Cappanera P, Gouveia L, Scutell\u00e0 MG (2012) Models and valid inequalities to asymmetric skill-based routing problems. EURO J Transp Logist 2(1):29\u201355","journal-title":"EURO J Transp Logist"},{"key":"501_CR10","doi-asserted-by":"crossref","unstructured":"Cappanera P, Scutell\u00e0 MG Visintin F (2014) Home care services delivery: equity versus efficiency in optimization models. In: Proceedings of the international conference on health care systems engineering. Springer International Publishing, pp 1\u201313","DOI":"10.1007\/978-3-319-01848-5_1"},{"issue":"3","key":"501_CR11","first-page":"319","volume":"37","author":"IM Chao","year":"1999","unstructured":"Chao IM, Golden B, Wasil E (1999) A computational study of a new heuristic for the site-dependent vehicle routing problem. Inf Syst Oper Res 37(3):319\u2013336","journal-title":"Inf Syst Oper Res"},{"issue":"3","key":"501_CR12","first-page":"292","volume":"39","author":"JF Cordeau","year":"2001","unstructured":"Cordeau JF, Laporte G (2001) A tabu search algorithm for the site dependent vehicle routing problem with time windows. Inf Syst Oper Res 39(3):292\u2013298","journal-title":"Inf Syst Oper Res"},{"issue":"1","key":"501_CR13","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80\u201391","journal-title":"Manag Sci"},{"issue":"4","key":"501_CR14","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/trsc.1070.0190","volume":"41","author":"M Dell\u2019Amico","year":"2007","unstructured":"Dell\u2019Amico M, Monaci M, Pagani C, Vigo D (2007) Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transp Sci 41(4):516\u2013526","journal-title":"Transp Sci"},{"issue":"11","key":"501_CR15","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1057\/palgrave.jors.2601422","volume":"53","author":"W Dullaert","year":"2002","unstructured":"Dullaert W, Janssens GK, Srensen K, Vernimmen B (2002) New heuristics for the fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 53(11):1232\u20131238","journal-title":"J Oper Res Soc"},{"key":"501_CR16","doi-asserted-by":"crossref","unstructured":"Francis PM, Smilowitz KR, Tzur M (2008) The period vehicle routing problem and its extensions. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, Boston, pp 73\u2013102","DOI":"10.1007\/978-0-387-77778-8_4"},{"issue":"4","key":"501_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01720070","volume":"6","author":"F Gheysens","year":"1984","unstructured":"Gheysens F, Golden B, Assad A (1984) A comparison of techniques for solving the fleet size and mix vehicle routing problem. Oper Res Spektrum 6(4):207\u2013216","journal-title":"Oper Res Spektrum"},{"key":"501_CR18","doi-asserted-by":"crossref","unstructured":"Goel A, Gruhn V (2006) Solving a dynamic real-life vehicle routing problem. In: Operations research proceedings 2005: selected papers of the annual international conference of the German Operations Research Society (GOR). Springer, Berlin, pp 367\u2013372","DOI":"10.1007\/3-540-32539-5_58"},{"issue":"3","key":"501_CR19","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.ejor.2006.12.065","volume":"191","author":"A Goel","year":"2008","unstructured":"Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3):650\u2013660","journal-title":"Eur J Oper Res"},{"issue":"1","key":"501_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden B, Assad A, Levy L, Gheysens F (1984) The fleet size and mix vehicle routing problem. Comput Oper Res 11(1):49\u201366","journal-title":"Comput Oper Res"},{"key":"501_CR21","doi-asserted-by":"crossref","unstructured":"Hasle G, Kloster O (2007) Industrial vehicle routing. In: Hasle G, Lie K-A, Quak E (eds) Geometric modelling, numerical simulation, and optimization: applied mathematics at SINTEF. Springer, Berlin, pp 397\u2013435","DOI":"10.1007\/978-3-540-68783-2_12"},{"key":"501_CR22","unstructured":"Hertel L, Gautam N (2004) A mathematical programming model for scheduling pharmaceutical sales representatives. In: Proceeding of the industrial engineering research conference"},{"issue":"12","key":"501_CR23","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1016\/j.cor.2010.03.015","volume":"37","author":"A Hoff","year":"2010","unstructured":"Hoff A, Andersson H, Christiansen M, Hasle G, Lkketangen A (2010) Industrial aspects and literature survey: fleet composition and routing. Comput Oper Res 37(12):2041\u20132061","journal-title":"Comput Oper Res"},{"key":"501_CR24","doi-asserted-by":"crossref","unstructured":"Kallehauge B, Larsen J, Madsen OB, Solomon MM (2005) Vehicle routing problem with time windows. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. Springer, Boston, pp 67\u201398","DOI":"10.1007\/0-387-25486-2_3"},{"issue":"1","key":"501_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241(1):1\u201314","journal-title":"Eur J Oper Res"},{"issue":"4","key":"501_CR26","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"issue":"7","key":"501_CR27","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"FH Liu","year":"1999","unstructured":"Liu FH, Shen SY (1999) The fleet size and mix vehicle routing problem with time windows. J Oper Res Soc 50(7):721\u2013732","journal-title":"J Oper Res Soc"},{"key":"501_CR28","unstructured":"Paraskevopoulos DC, Laporte G, Repoussis PP, Tarantilis CD (2016) Resource constrained routing and scheduling: review and research prospects. Tech. Rep. CIRRELT-2016-03, CIRRELT"},{"key":"501_CR29","unstructured":"Pellegrini P (2005) Application of two nearest neighbor approaches to a rich vehicle routing problem. Tech. Rep. TR\/IRIDIA\/2005-15, Universit\u00e9 Libre de Bruxelles"},{"key":"501_CR30","doi-asserted-by":"crossref","unstructured":"Pellegrini P, Favaretto D, Moretti E (2007) Multiple ant colony optimization for a rich vehicle routing problem: a case study. Knowledge-based intelligent information and engineering systems: 11th international conference, KES 2007, XVII Italian workshop on neural networks, Vietri sul Mare, Italy, September 12\u201314, 2007. Proceedings, part II, Springer, Heidelberg, pp 627\u2013634","DOI":"10.1007\/978-3-540-74827-4_79"},{"issue":"1","key":"501_CR31","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00291-015-0399-6","volume":"38","author":"S Schwarze","year":"2015","unstructured":"Schwarze S (2015) Pricing strategies for the site-dependent vehicle routing problem. OR Spectr 38(1):137\u2013173","journal-title":"OR Spectr"},{"issue":"8","key":"501_CR32","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1007\/s11590-012-0524-2","volume":"7","author":"S Schwarze","year":"2013","unstructured":"Schwarze S, Vo\u00df S (2013) Improved load balancing and resource utilization for the skill vehicle routing problem. Optim Lett 7(8):1805\u20131823. \n                              https:\/\/doi.org\/10.1007\/s11590-012-0524-2","journal-title":"Optim Lett"},{"key":"501_CR33","doi-asserted-by":"crossref","unstructured":"Schwarze S, Vo\u00df S (2015). A Bicriteria skill vehicle routing problem with time windows and an application to pushback operations at airports. In: Logistics management: products, actors, technology\u2014proceedings of the german academic association for business research, Bremen, 2013. Springer International Publishing, pp 289\u2013300","DOI":"10.1007\/978-3-319-13177-1_23"},{"issue":"2","key":"501_CR34","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F Tricoire","year":"2010","unstructured":"Tricoire F, Romauch M, Doerner KF, Hartl RF (2010) Heuristics for the multi-period orienteering problem with multiple time windows. Comput Oper Res 37(2):351\u2013367","journal-title":"Comput Oper Res"},{"issue":"2","key":"501_CR35","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10100-011-0231-6","volume":"21","author":"F Tricoire","year":"2013","unstructured":"Tricoire F, Bostel N, Dejax P, Guez P (2013) Exact and hybrid methods for the multiperiod field service routing problem. CEJOR 21(2):359\u2013377","journal-title":"CEJOR"},{"issue":"3","key":"501_CR36","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Bergh Van den","year":"2013","unstructured":"Van den Bergh J, Beli\u00ebn J, Bruecker PD, Demeulemeester E, Boeck LD (2013) Personnel scheduling: a literature review. Eur J Oper Res 226(3):367\u2013385","journal-title":"Eur J Oper Res"},{"issue":"3","key":"501_CR37","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673","journal-title":"Eur J Oper Res"},{"issue":"4","key":"501_CR38","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/net.20470","volume":"58","author":"M Wen","year":"2011","unstructured":"Wen M, Krapper E, Larsen J, Stidsen TK (2011) A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem. Networks 58(4):311\u2013322","journal-title":"Networks"},{"key":"501_CR39","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2016.02.011","volume":"73","author":"S Yal\u00e7inda\u011f","year":"2016","unstructured":"Yal\u00e7inda\u011f S, Cappanera P, Scutell\u00e0 MG, \u015eahin E, Matta A (2016) Pattern-based decompositions for human resource planning in home health care services. Comput Oper Res 73:12\u201326","journal-title":"Comput Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-017-0501-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0501-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0501-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T07:53:20Z","timestamp":1547106800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-017-0501-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,2]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["501"],"URL":"https:\/\/doi.org\/10.1007\/s10100-017-0501-z","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2017,11,2]]}}}