{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:15Z","timestamp":1740097275767,"version":"3.37.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276793"},{"type":"electronic","value":"9783319276809"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27680-9_12","type":"book-chapter","created":{"date-parts":[[2015,12,14]],"date-time":"2015-12-14T09:27:49Z","timestamp":1450085269000},"page":"191-211","source":"Crossref","is-referenced-by-count":3,"title":["Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem"],"prefix":"10.1007","author":[{"given":"Wasakorn","family":"Laesanklang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo Lankaites","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haneen","family":"Algethami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,15]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","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. Oper. Res. 191(1), 19\u201331 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","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. Comput. Ind. Eng. 53(4), 559\u2013583 (2007)","journal-title":"Comput. Ind. Eng."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/inte.28.3.75","volume":"28","author":"VD Angelis","year":"1998","unstructured":"Angelis, V.D.: Planning home assistance for AIDS patients in the City of Rome, Italy. Interfaces 28, 75\u201383 (1998)","journal-title":"Interfaces"},{"issue":"4","key":"12_CR4","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., Nubia, V., Ciro-Alberto, A.: A network-based approach to the multi-activity combined timetabling and crew scheduling problem: workforce scheduling for public health policy implementation. Comput. Ind. Eng. 63(4), 802\u2013812 (2012)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"issue":"10","key":"12_CR6","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1016\/j.cor.2005.01.015","volume":"33","author":"S Bertels","year":"2006","unstructured":"Bertels, S., Torsten, F.: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33(10), 2866\u20132890 (2006)","journal-title":"Comput. Oper. Res."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Borsani, V., Andrea, M., Giacomo, B., Francesco, S.: A home care scheduling model for human resources. In: 2006 International Conference on Service Systems and Service Management pp. 449\u2013454 (2006)","DOI":"10.1109\/ICSSSM.2006.320504"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Bredstrom, D., Ronnqvist, M.: A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. NHH Department of Finance & Management Science Discussion Paper No. 2007\/7, February 2007","DOI":"10.2139\/ssrn.971726"},{"key":"12_CR9","first-page":"1","volume":"78","author":"J Castillo-Salazar","year":"2014","unstructured":"Castillo-Salazar, J., Landa-Silva, D., Qu, R.: Workforce scheduling and routing problems: literature survey and computational study. Ann. Oper. Res. 78, 1\u201329 (2014)","journal-title":"Ann. Oper. Res."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Castro-Gutierrez, J., Landa-Silva, D., Moreno, P.J.: Nature of real-world multi-objective vehicle routing with evolutionary algorithms. In: 2011 IEEE International Conference onSystems, Man, and Cybernetics (SMC), pp. 257\u2013264 (2011)","DOI":"10.1109\/ICSMC.2011.6083675"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1287\/trsc.35.4.375.10432","volume":"35","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Stojkovic, G., Soumis, F., Desrosiers, J.: Benders decomposition for simultaneous aircraft routing and crew scheduling. Transp. Sci. 35(4), 375\u2013388 (2001)","journal-title":"Transp. Sci."},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. (pre-1986) 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci. (pre-1986)"},{"issue":"4","key":"12_CR13","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., Esben, K., Jens, C.: The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach. Comput. Oper. Res. 36(4), 1145\u20131157 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1287\/inte.1080.0411","volume":"39","author":"P Eveborn","year":"2009","unstructured":"Eveborn, P., Ronnqvist, M., Einarsdottir, H., Eklund, M., Liden, K., Almroth, M.: Operations research improves quality and efficiency in home care. Interfaces 39(1), 18\u201334 (2009)","journal-title":"Interfaces"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","volume":"8","author":"D Feillet","year":"2010","unstructured":"Feillet, D.: A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR 8(4), 407\u2013424 (2010). \n                    http:\/\/dx.doi.org\/10.1007\/s10288-010-0130-z","journal-title":"4OR"},{"key":"12_CR16","unstructured":"Goldberg, D.E.: Genetic Algorithms. Pearson Education (2006). ISBN: 9788177588293"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Hart, E., Sim, K., Urquhart, N.: A real-world employee scheduling and routing application. In: Proceedings of the 2014 Conference Companion on Genetic and Evolutionary Computation Companion, GECCO Comp 2014, pp. 1239\u20131242. ACM, New York (2014)","DOI":"10.1145\/2598394.2605447"},{"key":"12_CR18","first-page":"38","volume":"89","author":"P Husbands","year":"1994","unstructured":"Husbands, P.: Genetic algorithms for scheduling. Intell. Simul. Behav. (AISB) Q. 89, 38\u201345 (1994)","journal-title":"Intell. Simul. Behav. (AISB) Q."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.cie.2007.06.031","volume":"53","author":"G Jeon","year":"2007","unstructured":"Jeon, G., Leep, H.R., Shim, J.Y.: A vehicle routing problem solved by using a hybrid genetic algorithm. Comput. Ind. Eng. 53(4), 680\u2013692 (2007)","journal-title":"Comput. Ind. Eng."},{"key":"12_CR20","unstructured":"Kergosien, Y., Lente, C., Billaut, J.C.: Home health care problem, an extended multiple travelling salesman problem. In: Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), Dublin, Ireland, pp. 85\u201392 (2009)"},{"key":"12_CR21","unstructured":"Landa-Silva, D., Wang, Y., Donovan, P., Kendall, G., Way, S.: Hybrid heuristic for multi-carrier transportation plans. In: The 9th Metaheuristics International Conference (MIC 2011), pp. 221\u2013229 (2011)"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.omega.2014.03.003","volume":"47","author":"R Liu","year":"2014","unstructured":"Liu, R., Xie, X., Garaix, T.: Hybridization of tabu search with feasible and infeasible local searches for periodic home health care logistics. Omega 47, 17\u201332 (2014)","journal-title":"Omega"},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"D Mankowska","year":"2014","unstructured":"Mankowska, D., Meisel, F., Bierwirth, C.: The home health care routing and scheduling problem with interdependent services. Health Care Manage. Sci. 17(1), 15\u201330 (2014)","journal-title":"Health Care Manage. Sci."},{"issue":"6","key":"12_CR24","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1016\/j.cor.2003.11.013","volume":"32","author":"A Mercier","year":"2005","unstructured":"Mercier, A., Cordeau, J.F., Soumis, F.: A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Comput. Oper. Res. 32(6), 1451\u20131476 (2005)","journal-title":"Comput. Oper. Res."},{"key":"12_CR25","first-page":"91","volume":"2004","author":"K Mesghouni","year":"2004","unstructured":"Mesghouni, K., Hammadi, S.: Evolutionary algorithms for job shop scheduling. Int. J. Appl. Math. Comput. Sci. 2004, 91\u2013103 (2004)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"issue":"5","key":"12_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0191-2615(85)90052-9","volume":"19","author":"J Perl","year":"1985","unstructured":"Perl, J., Daskin, M.S.: A warehouse location-routing problem. Transp. Res. Part B Methodol. 19(5), 381\u2013396 (1985)","journal-title":"Transp. Res. Part B Methodol."},{"key":"12_CR27","unstructured":"Pillac, V., Gueret, C., Medaglia, A.: On the dynamic technician routing and scheduling problem. In: Proceedings of the 5th International Workshop on Freight Transportation and Logistics (ODYSSEUS 2012), Mikonos, Greece, p. 194, May 2012"},{"key":"12_CR28","unstructured":"Potvin, J.Y.: Evolutionary algorithms for vehicle routing. Technical report 48, CIRRELT (2007)"},{"key":"12_CR29","series-title":"Wiley Encyclopedia of Operations Research and Management Science","volume-title":"Decomposition Methods for Integer Programming","author":"TK Ralphs","year":"2010","unstructured":"Ralphs, T.K., Galati, M.V.: Decomposition Methods for Integer Programming. Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York (2010)"},{"issue":"3","key":"12_CR30","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.: The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur. J. Oper. Res. 219(3), 598\u2013610 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann, M., Doerner, K., Hartl, R.F.: D-Ants: savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4), 563\u2013591 (2004)","journal-title":"Comput. Oper. Res."},{"key":"12_CR32","first-page":"124","volume":"3","author":"A Trautsamwieser","year":"2011","unstructured":"Trautsamwieser, A., Hirsch, P.: Optimization of daily scheduling for home health care services. J. Appl. Oper. Res. 3, 124\u2013136 (2011)","journal-title":"J. Appl. Oper. Res."},{"issue":"1","key":"12_CR33","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck, F.: On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. 48(1), 111 (2000)","journal-title":"Oper. Res."},{"key":"12_CR34","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"F Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., Wolsey, L.: Reformulation and decomposition of integer programs. In: Junger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 431\u2013502. Springer, Heidelberg (2010)"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27680-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:09:14Z","timestamp":1559329754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27680-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319276793","9783319276809"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27680-9_12","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}