{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:27:19Z","timestamp":1726079239251},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030449315"},{"type":"electronic","value":"9783030449322"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-44932-2_4","type":"book-chapter","created":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:04:39Z","timestamp":1586235879000},"page":"53-66","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Heuristic Algorithm for the Dial-a-Ride Problem"],"prefix":"10.1007","author":[{"given":"Andr\u00e9 Luyde S.","family":"Souza","sequence":"first","affiliation":[]},{"given":"Jonatas B. C.","family":"Chagas","sequence":"additional","affiliation":[]},{"given":"Puca H. V.","family":"Penna","sequence":"additional","affiliation":[]},{"given":"Marcone J. F.","family":"Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30, 231\u2013236 (2004)","journal-title":"Parallel Comput."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry, A., Laporte, G., Melo, T., Nickel, S.: Dynamic transportation of patients in hospitals. OR Spectr. 32, 77\u2013107 (2010). \nhttps:\/\/doi.org\/10.1007\/s00291-008-0135-6","journal-title":"OR Spectr."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.trb.2014.05.007","volume":"67","author":"K Braekers","year":"2014","unstructured":"Braekers, K., Caris, A., Janssens, G.K.: Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transp. Res. Part B Methodol. 67, 166\u2013186 (2014)","journal-title":"Transp. Res. Part B Methodol."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B Methodol. 37, 579\u2013594 (2003)","journal-title":"Transp. Res. Part B Methodol."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573\u2013586 (2006)","journal-title":"Oper. Res."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153, 29\u201346 (2007). \nhttps:\/\/doi.org\/10.1007\/s10479-007-0170-8","journal-title":"Ann. Oper. Res."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/141868.141871","volume":"20","author":"JJ Dongarra","year":"2014","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. ACM SIGARCH Comput. Arch. News 20, 22\u201344 (2014)","journal-title":"ACM SIGARCH Comput. Arch. News"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1287\/inte.1080.0379","volume":"39","author":"T Hanne","year":"2018","unstructured":"Hanne, T., Melo, T., Nickel, S., Melo, T., Nickel, S.: Bringing robustness to patient flow management through optimized patient transportation in hospitals. Interfaces 39, 241\u2013255 (2018)","journal-title":"Interfaces"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"449467","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho, S.C., Szeto, W.Y., Kuo, Y.H., Leung, J.M.Y., Petering, M., Tou, T.W.H.: A survey of dial-a-ride problems: literature review and recent developments. Transp. Res. Part B Methodol. 111, 395\u2013421 (2018)","journal-title":"Transp. Res. Part B Methodol."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20B","author":"J-J Jaw","year":"1986","unstructured":"Jaw, J.-J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M.: A heuristic algorithm for the multi- vehicle advance request dial-a-ride problem with time windows. Transp. Res. 20B, 243\u2013257 (1986)","journal-title":"Transp. Res."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"RM Jorgensen","year":"2007","unstructured":"Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58, 1321\u20131331 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1038\/nature06516","volume":"451","author":"W Lutz","year":"2008","unstructured":"Lutz, W., Sanderson, W., Scherbov, S.: The coming acceleration of global population ageing. Nature 451, 716\u2013719 (2008)","journal-title":"Nature"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OBG Madsen","year":"1995","unstructured":"Madsen, O.B.G., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60, 193\u2013208 (1995). \nhttps:\/\/doi.org\/10.1007\/BF02031946","journal-title":"Ann. Oper. Res."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.12.008","volume":"81","author":"MA Masmoudi","year":"2017","unstructured":"Masmoudi, M.A., Braekers, K., Masmoudi, M., Dammak, A.: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Comput. Oper. Res. 81, 1\u201313 (2017)","journal-title":"Comput. Oper. Res."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MITS.2009.934641","volume":"3","author":"GR Mauri","year":"2009","unstructured":"Mauri, G.R., Antonio, L., Lorena, N.: Customers\u2019 satisfaction in a dial-a-ride problem. IEEE Intell. Transp. Syst. Mag. 3, 6\u201314 (2009)","journal-title":"IEEE Intell. Transp. Syst. Mag."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37, 1129\u20131138 (2010)","journal-title":"Comput. Oper. Res."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.trc.2010.06.002","volume":"19","author":"SN Parragh","year":"2011","unstructured":"Parragh, S.N.: Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transp. Res. Part C Emerg. Technol. 19, 912\u2013930 (2011)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.cor.2012.08.004","volume":"40","author":"SN Parragh","year":"2013","unstructured":"Parragh, S.N., Schmid, V.: Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 40, 490\u2013497 (2013)","journal-title":"Comput. Oper. Res."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"12","author":"M Schilde","year":"2011","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Comput. Oper. Res. 12, 1719\u20131730 (2011)","journal-title":"Comput. Oper. Res."},{"key":"4_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematic and Applications, Philadelphia (2002)"}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44932-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:24:03Z","timestamp":1586237043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44932-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030449315","9783030449322"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44932-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"3 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/icvns2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}