{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:43:54Z","timestamp":1773737034801,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-020-01698-6","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T10:03:13Z","timestamp":1610100193000},"page":"355-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2084-6703","authenticated-orcid":false,"given":"Andr\u00e9 L. S.","family":"Souza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8430-1932","authenticated-orcid":false,"given":"Marcella","family":"Bernardo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5414-1405","authenticated-orcid":false,"given":"Puca H. V.","family":"Penna","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5109-9627","authenticated-orcid":false,"given":"J\u00fcrgen","family":"Pannek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7141-357X","authenticated-orcid":false,"given":"Marcone J. F.","family":"Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"issue":"1","key":"1698_CR1","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 Spectrum 32(1), 77\u2013107 (2010)","journal-title":"OR Spectrum"},{"key":"1698_CR2","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Pannek, J.: Robust solution approach for the dynamic and stochastic vehicle routing problem. J. Adv. Transp. 1\u201311 (2018)","DOI":"10.1155\/2018\/9848104"},{"issue":"3","key":"1698_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transp. Sci. 38(3), 369\u2013378 (2004)","journal-title":"Transp. Sci."},{"issue":"3","key":"1698_CR4","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(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"issue":"1","key":"1698_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/itor.12671","volume":"27","author":"JC de Freitas","year":"2020","unstructured":"de Freitas, J.C., Penna, P.H.V.: A variable neighborhood search for flying sidekick traveling salesman problem. Int. Trans. Oper. Res. 27(1), 267\u2013290 (2020). https:\/\/doi.org\/10.1111\/itor.12671","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"1698_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1287\/inte.1080.0379","volume":"39","author":"T Hanne","year":"2009","unstructured":"Hanne, T., Melo, T., Nickel, S.: Bringing robustness to patient through optimized patient transports in hospitals. Interfaces 39(3), 241\u2013255 (2009)","journal-title":"Interfaces"},{"key":"1698_CR7","first-page":"1097","volume":"24","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.A.: Variable neighborhood search. Int. Ser. Oper. Res. Manag. Sci. 24, 1097\u20131100 (1997)","journal-title":"Int. Ser. Oper. Res. Manag. Sci."},{"issue":"3","key":"1698_CR8","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"key":"1698_CR9","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":"1698_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.compchemeng.2019.04.015","volume":"126","author":"P Karakostas","year":"2019","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing. Comput. Chem. Eng. 126, 263\u2013279 (2019). https:\/\/doi.org\/10.1016\/j.compchemeng.2019.04.015","journal-title":"Comput. Chem. Eng."},{"key":"1698_CR11","doi-asserted-by":"publisher","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Adaptive GVNS heuristics for solving the pollution location inventory routing problem. Lecture Notes in Computer Science pp. 157\u2013170 (2020). https:\/\/doi.org\/10.1007\/978-3-030-38629-0","DOI":"10.1007\/978-3-030-38629-0"},{"issue":"1","key":"1698_CR12","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(1), 193\u2013208 (1995)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1698_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2019","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S., Vidal, T., Prins, C.: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 273(1), 5\u201374 (2019). https:\/\/doi.org\/10.1007\/s10479-017-2642-9","journal-title":"Ann. Oper. Res."},{"issue":"12","key":"1698_CR14","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","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. 38(12), 1719\u20131730 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1698_CR15","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.ejor.2010.05.031","volume":"207","author":"MJF Souza","year":"2010","unstructured":"Souza, M.J.F., Coelho, I.M., Ribas, S., Santos, H.G., Merschmann, L.H.C.: A hybrid heuristic algorithm for the open-pit-mining operational planning problem. Eur. J. Oper. Res. 207(2), 1041\u20131051 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"1698_CR16","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01698-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01698-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01698-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:41:11Z","timestamp":1641814871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01698-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1698"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01698-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,8]]},"assertion":[{"value":"31 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}