{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T01:06:32Z","timestamp":1763082392060,"version":"3.45.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11590-025-02225-1","type":"journal-article","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:16:45Z","timestamp":1753273005000},"page":"1737-1758","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Policies for multi-trip route planning in time-sensitive environments"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6861-8064","authenticated-orcid":false,"given":"Bahar","family":"\u00c7avdar","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Geunes","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Nie","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,23]]},"reference":[{"key":"2225_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"key":"2225_CR2","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1023\/A:1018943910798","volume":"86","author":"C Basnet","year":"1999","unstructured":"Basnet, C., Foulds, L.R., Wilson, J.M.: An exact algorithm for a milk tanker scheduling and sequencing problem. Ann. Oper. Res. 86, 559\u2013568 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"2225_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Math. Proc. Camb. Philos. Soc. 55(4), 299\u2013327 (1959)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"issue":"3","key":"2225_CR4","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00291-011-0256-1","volume":"33","author":"DR Bish","year":"2011","unstructured":"Bish, D.R.: Planning for a bus-based evacuation. OR Spectrum 33(3), 629\u2013654 (2011)","journal-title":"OR Spectrum"},{"key":"2225_CR5","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"2225_CR6","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/inte.1090.0475","volume":"40","author":"M Caramia","year":"2010","unstructured":"Caramia, M., Guerriero, F.: A milk collection problem with incompatibility constraints. Interfaces 40(2), 130\u2013143 (2010)","journal-title":"Interfaces"},{"issue":"1","key":"2225_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3390\/agriculture8010005","volume":"8","author":"M Caria","year":"2018","unstructured":"Caria, M., Todde, G., Pazzona, A.: Modelling the collection and delivery of sheep milk: a tool to optimise the logistics costs of cheese factories. Agriculture 8(1), 5 (2018)","journal-title":"Agriculture"},{"issue":"3","key":"2225_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10288-016-0306-2","volume":"14","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza, D., Absi, N., Feillet, D.: Vehicle routing problems with multiple trips. 4OR 14(3), 223\u2013259 (2016)","journal-title":"4OR"},{"issue":"2","key":"2225_CR9","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.ejor.2014.12.020","volume":"243","author":"B \u00c7avdar","year":"2015","unstructured":"\u00c7avdar, B., Sokol, J.: A distribution-free TSP tour length estimation model for random graphs. Eur. J. Oper. Res. 243(2), 588\u2013598 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"2225_CR10","doi-asserted-by":"publisher","first-page":"108054","DOI":"10.1016\/j.cie.2022.108054","volume":"169","author":"K Corona-Guti\u00e9rrez","year":"2022","unstructured":"Corona-Guti\u00e9rrez, K., Nucamendi-Guill\u00e9n, S., Lalla-Ruiz, E.: Vehicle routing with cumulative objectives: a state of the art and analysis. Comput. Ind. Eng. 169, 108054 (2022)","journal-title":"Comput. Ind. Eng."},{"key":"2225_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.12.012","volume":"70","author":"G Dikas","year":"2016","unstructured":"Dikas, G., Minis, I.: Solving the bus evacuation problem and its variants. Comput. Oper. Res. 70, 75\u201386 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"2225_CR12","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472\u20131483 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"2225_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ejor.2018.12.009","volume":"279","author":"A Esposito Amideo","year":"2019","unstructured":"Esposito Amideo, A., Scaparra, M.P., Kotiadis, K.: Optimising shelter location and evacuation routing operations: the critical issues. Eur. J. Oper. Res. 279(2), 279\u2013295 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2225_CR14","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/s00291-014-0365-8","volume":"36","author":"M Goerigk","year":"2014","unstructured":"Goerigk, M., Gr\u00fcn, B.: A robust bus evacuation model with delayed scenario information. OR Spectrum 36(4), 923\u2013948 (2014)","journal-title":"OR Spectrum"},{"issue":"12","key":"2225_CR15","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.cor.2013.07.006","volume":"40","author":"M Goerigk","year":"2013","unstructured":"Goerigk, M., Gr\u00fcn, B., He\u00dfler, P.: Branch and bound algorithms for the bus evacuation problem. Comput. Oper. Res. 40(12), 3010\u20133020 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2225_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10479-013-1515-0","volume":"230","author":"S Jin","year":"2015","unstructured":"Jin, S., Jeong, S., Kim, J., Kim, K.: A logistics model for the transport of disaster victims with various injuries and survival probabilities. Ann. Oper. Res. 230(1), 17\u201333 (2015)","journal-title":"Ann. Oper. Res."},{"key":"2225_CR17","doi-asserted-by":"crossref","unstructured":"Lakshay, Bolia, N.B.: Operating strategies of buses for mass evacuation. Saf. Sci. 111, 167\u2013178 (2019)","DOI":"10.1016\/j.ssci.2018.07.007"},{"issue":"4","key":"2225_CR18","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009)","journal-title":"Transp. Sci."},{"issue":"4","key":"2225_CR19","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326\u2013329 (1960)","journal-title":"J. ACM"},{"key":"2225_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.compag.2017.01.015","volume":"134","author":"G Paredes-Belmar","year":"2017","unstructured":"Paredes-Belmar, G., L\u00fcer-Villagra, A., Marianov, V., Cort\u00e9s, C.E., Bronfman, A.: The milk collection problem with blending and collection points. Comput. Electron. Agric. 134, 109\u2013123 (2017)","journal-title":"Comput. Electron. Agric."},{"key":"2225_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tre.2016.07.006","volume":"94","author":"G Paredes-Belmar","year":"2016","unstructured":"Paredes-Belmar, G., Marianov, V., Bronfman, A., Obreque, C., L\u00fcer-Villagra, A.: A milk collection problem with blending. Transp. Res. Part E: Logist. Transp. Rev. 94, 26\u201343 (2016)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"3","key":"2225_CR22","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1016\/j.ejor.2022.03.050","volume":"303","author":"G Paredes-Belmar","year":"2022","unstructured":"Paredes-Belmar, G., Montero, E., L\u00fcer-Villagra, A., Marianov, V., Araya-Sassi, C.: Vehicle routing for milk collection with gradual blending: a case arising in Chile. Eur. J. Oper. Res. 303(3), 1403\u20131416 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"2225_CR23","doi-asserted-by":"publisher","first-page":"5113","DOI":"10.1007\/s11694-021-01076-5","volume":"15","author":"O Polat","year":"2021","unstructured":"Polat, O., Ak\u00e7ok, S.G., Akbay, M.A., Topalo\u011flu, D., Arslan, S., Kalayci, C.B.: Classification of raw cow milk using information fusion framework. J. Food Meas. Charact. 15, 5113\u20135130 (2021)","journal-title":"J. Food Meas. Charact."},{"key":"2225_CR24","doi-asserted-by":"publisher","first-page":"105759","DOI":"10.1016\/j.cor.2022.105759","volume":"142","author":"O Polat","year":"2022","unstructured":"Polat, O., Kalayci, C.B., Topalo\u011flu, D.: Modelling and solving the milk collection problem with realistic constraints. Comput. Oper. Res. 142, 105759 (2022)","journal-title":"Comput. Oper. Res."},{"key":"2225_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.seps.2016.10.009","volume":"59","author":"R Swamy","year":"2017","unstructured":"Swamy, R., Kang, J.E., Batta, R., Chung, Y.: Hurricane evacuation planning using public transportation. Socioecon. Plan. Sci. 59, 43\u201355 (2017)","journal-title":"Socioecon. Plan. Sci."},{"issue":"2","key":"2225_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"286","author":"T Vidal","year":"2020","unstructured":"Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401\u2013416 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"2225_CR27","doi-asserted-by":"crossref","unstructured":"Vinel, A., Silva, D.F.: Probability distribution of the length of the shortest tour between a few random points: a simulation study. In: Rabe, M., Juan, A.A., Mustafee, N., Skoogh, A., Sanjay, J., Johansson B. (eds.) Proceedings of the 2018 Winter Simulation Conference, pp. 3156\u20133167. Institute of Electrical and Electronics Engineers, Piscataway (2018)","DOI":"10.1109\/WSC.2018.8632175"},{"key":"2225_CR28","first-page":"285","volume":"137","author":"X Zhao","year":"2020","unstructured":"Zhao, X., Ji, K., Xu, P., Qian, W.-W., Ren, G., Shan, X.-N.: A round-trip bus evacuation model with scheduling and routing planning. Transp. Res. Part A: Policy Pract. 137, 285\u2013300 (2020)","journal-title":"Transp. Res. Part A: Policy Pract."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-025-02225-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-025-02225-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T01:02:41Z","timestamp":1763082161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-025-02225-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,23]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2225"],"URL":"https:\/\/doi.org\/10.1007\/s11590-025-02225-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2025,7,23]]},"assertion":[{"value":"12 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}