{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:49Z","timestamp":1740099529671,"version":"3.37.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030311391"},{"type":"electronic","value":"9783030311407"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31140-7_17","type":"book-chapter","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T19:26:53Z","timestamp":1568921213000},"page":"265-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Greedy Heuristic for the Vehicle Routing Problem with Time Windows, Synchronization Constraints and Heterogeneous Fleet"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7516-1130","authenticated-orcid":false,"given":"Lu\u00edsa Brand\u00e3o","family":"Cavalcanti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7258-0396","authenticated-orcid":false,"given":"Andr\u00e9 Bergsten","family":"Mendes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10100-018-0520-4","volume":"26","author":"SN Parragh","year":"2018","unstructured":"Parragh, S.N., Doerner, K.F.: Solving routing problems with pairwise synchronization constraints. Cent. Eur. J. Oper. Res. 26, 443\u2013464 (2018). \n                      https:\/\/doi.org\/10.1007\/s10100-018-0520-4","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"17_CR2","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, 19\u201331 (2008). \n                      https:\/\/doi.org\/10.1016\/j.ejor.2007.07.033","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl, M.: Synchronization in vehicle routing\u2013a survey of VRPs with multiple synchronization constraints. Transp. Sci. 46, 297\u2013316 (2012). \n                      https:\/\/doi.org\/10.1287\/trsc.1110.0400","journal-title":"Transp. Sci."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s11590-015-0878-3","volume":"10","author":"S Afifi","year":"2016","unstructured":"Afifi, S., Dang, D.C., Moukrim, A.: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optim. Lett. 10, 511\u2013525 (2016). \n                      https:\/\/doi.org\/10.1007\/s11590-015-0878-3","journal-title":"Optim. Lett."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-44973-4_27","volume-title":"Learning and Intelligent Optimization","author":"S Afifi","year":"2013","unstructured":"Afifi, S., Dang, D.-C., Moukrim, A.: A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 259\u2013265. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-44973-4_27"},{"key":"17_CR6","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.: Laps Care-an operational system for staff planning of home care. Eur. J. Oper. Res. 171, 962\u2013976 (2006). \n                      https:\/\/doi.org\/10.1016\/j.ejor.2005.01.011","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"DS Mankowska","year":"2014","unstructured":"Mankowska, D.S., Meisel, F., Bierwirth, C.: The home health care routing and scheduling problem with interdependent services. Health Care Manag. Sci. 17, 15\u201330 (2014). \n                      https:\/\/doi.org\/10.1007\/s10729-013-9243-1","journal-title":"Health Care Manag. Sci."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.eswa.2016.09.002","volume":"66","author":"SR Ait Haddadene","year":"2016","unstructured":"Ait Haddadene, S.R., Labadie, N., Prodhon, C.: A GRASP\u2009\u00d7\u2009ILS for the vehicle routing problem with time windows, synchronization and precedence constraints. Expert Syst. Appl. 66, 274\u2013294 (2016). \n                      https:\/\/doi.org\/10.1016\/j.eswa.2016.09.002","journal-title":"Expert Syst. Appl."},{"key":"17_CR9","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.: The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach. Comput. Oper. Res. 36, 1145\u20131157 (2009). \n                      https:\/\/doi.org\/10.1016\/j.cor.2007.12.011","journal-title":"Comput. Oper. Res."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2017.11.011","volume":"92","author":"H Hojabri","year":"2018","unstructured":"Hojabri, H., Gendreau, M., Potvin, J.Y., Rousseau, L.M.: Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints. Comput. Oper. Res. 92, 87\u201397 (2018). \n                      https:\/\/doi.org\/10.1016\/j.cor.2017.11.011","journal-title":"Comput. Oper. Res."},{"key":"17_CR11","unstructured":"Mendes, A.B.: Scheduling offshore support fleet under the requirement of multiple vessels per task. PhD, University of Sao Paulo (2007). (in Portuguese). \n                      http:\/\/www.teses.usp.br\/teses\/disponiveis\/3\/3135\/tde-14012008-171216\/en.php"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.ejor.2009.07.012","volume":"203","author":"A Shyshou","year":"2010","unstructured":"Shyshou, A., Gribkovskaia, I., Barcel\u00f3, J.: A simulation study of the fleet sizing problem arising in offshore anchor handling operations. Eur. J. Oper. Res. 203, 230\u2013240 (2010). \n                      https:\/\/doi.org\/10.1016\/j.ejor.2009.07.012","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1057\/jors.2015.62","volume":"67","author":"MP Seixas","year":"2016","unstructured":"Seixas, M.P., et al.: A heuristic approach to stowing general cargo into platform supply vessels. J. Oper. Res. Soc. 67, 148\u2013158 (2016). \n                      https:\/\/doi.org\/10.1057\/jors.2015.62","journal-title":"J. Oper. Res. Soc."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.cor.2018.08.002","volume":"101","author":"R Liu","year":"2019","unstructured":"Liu, R., Tao, Y., Xie, X.: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. Comput. Oper. Res. 101, 250\u2013262 (2019). \n                      https:\/\/doi.org\/10.1016\/j.cor.2018.08.002","journal-title":"Comput. Oper. Res."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127","author":"C Artigues","year":"2000","unstructured":"Artigues, C., Roubellat, F.: A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. Eur. J. Oper. Res. 127, 297\u2013316 (2000). \n                      https:\/\/doi.org\/10.1016\/S0377-2217(99)00496-8","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.ejor.2013.02.042","volume":"230","author":"EB Edis","year":"2013","unstructured":"Edis, E.B., Oguz, C., Ozkarahan, I.: Parallel machine scheduling with additional resources: Notation, classification, models and solution methods. Eur. J. Oper. Res. 230, 449\u2013463 (2013). \n                      https:\/\/doi.org\/10.1016\/j.ejor.2013.02.042","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, New York (2012). \n                      https:\/\/doi.org\/10.1007\/978-1-4614-2361-4"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31140-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T19:28:55Z","timestamp":1568921335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31140-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030311391","9783030311407"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31140-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barranquilla","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iccl2019.co\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}