{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:52:29Z","timestamp":1742961149209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030823962"},{"type":"electronic","value":"9783030823979"}],"license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-82397-9_2","type":"book-chapter","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T06:02:31Z","timestamp":1639461751000},"page":"27-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Approaches for the Stochastic Multi-depot Vehicle Routing Problem with Pickup and Delivery"],"prefix":"10.1007","author":[{"given":"Brenner H. O.","family":"Rios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo C.","family":"Xavier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fl\u00e1vio K.","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Amorim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"key":"2_CR1","unstructured":"Addinsoft: Data Analysis and Statistical Solution for Microsoft Excel, Paris, France (2017)"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Assaf, M., Ndiaye, M.: Multi travelling salesman problem formulation. In: 2017 4th International Conference on Industrial Engineering and Applications (ICIEA). IEEE (2017). https:\/\/doi.org\/10.1109\/iea.2017.7939224","DOI":"10.1109\/iea.2017.7939224"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006). https:\/\/doi.org\/10.1016\/j.omega.2004.10.004","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Bertsimas, D.J.: A vehicle routing problem with stochastic demand. Oper. Res. 40(3), 574\u2013585 (1992). https:\/\/doi.org\/10.1287\/opre.40.3.574","DOI":"10.1287\/opre.40.3.574"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Carrabs, F., Cordeau, J.-F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J. Comput. 19(4), 618\u2013632 (2007). https:\/\/doi.org\/10.1287\/ijoc.1060.0202","DOI":"10.1287\/ijoc.1060.0202"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Crevier, B., Cordeau, J.-F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. Europ. J. Oper. Res. 176(2), 756\u2013773 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2005.08.015","DOI":"10.1016\/j.ejor.2005.08.015"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Dridi, I.H., et al.: Optimisation of the multi-depots pick-up and delivery problems with time windows and multi-vehicles using PSO algorithm. Int. J. Prod. Res. 1\u201314 (2019). https:\/\/doi.org\/10.1080\/00207543.2019.1650975","DOI":"10.1080\/00207543.2019.1650975"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Dunn, O.J.: Multiple comparisons among means. J. Amer. Stat. Ass. 56(293), 52\u201364 (1961)","DOI":"10.1080\/01621459.1961.10482090"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Erera, A.L., Savelsbergh, M., Uyar, E.: Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4), 270\u2013283 (2009). https:\/\/doi.org\/10.1002\/net.20338","DOI":"10.1002\/net.20338"},{"issue":"200","key":"2_CR10","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman, M.: The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Amer. Stat. Ass. 32(200), 675\u2013701 (1937)","journal-title":"J. Amer. Stat. Ass."},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Gendreau, M., Laporte, G., S\u00e9guin, R.: A Tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3), 469\u2013477 (1996). https:\/\/doi.org\/10.1287\/opre.44.3.469","DOI":"10.1287\/opre.44.3.469"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Goodson, J.C.: A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands. Europ. J. Oper. Res. 241(2), 361\u2013369 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.09.031","DOI":"10.1016\/j.ejor.2014.09.031"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Search Methodologies, pp. 211\u2013238. Springer US (2005). https:\/\/doi.org\/10.1007\/0-387-28356-0_8","DOI":"10.1007\/0-387-28356-0_8"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Hansen, P., et al.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","DOI":"10.1007\/s13675-016-0075-x"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Kachitvichyanukul, V., Sombuntham, P., Kunnapapdeelert, S.: Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO. Comput. & Ind. Eng. 89, 125\u2013136 (2015). https:\/\/doi.org\/10.1016\/j.cie.2015.04.011","DOI":"10.1016\/j.cie.2015.04.011"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Kara, I., Bektas, T.: Integer linear programming formulations of multiple salesman problems and its variations. Europ. J. Oper. Res. 174(3), 1449\u20131458 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2005.03.008","DOI":"10.1016\/j.ejor.2005.03.008"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Kuo, Y., Wang, C.-C.: A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Syst. Appl. 39(8), 6949\u20136954 (2012). https:\/\/doi.org\/10.1016\/j.eswa.2012.01.024","DOI":"10.1016\/j.eswa.2012.01.024"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Laporte, G., Musmanno, R., Vocaturo, F.: An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Trans. Sci. 44(1), 125\u2013135 (2010). https:\/\/doi.org\/10.1287\/trsc.1090.0290","DOI":"10.1287\/trsc.1090.0290"},{"key":"2_CR19","unstructured":"Lourenc\u0327o, H.R., Martin, O., St \u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 321\u2013353 (2003)"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Mendoza, J.E., Villegas, J.G.: A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7(7), 1503\u20131516 (2012). https:\/\/doi.org\/10.1007\/s11590-012-0555-8","DOI":"10.1007\/s11590-012-0555-8"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. & Oper. Res. 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/s0305-0548(97)00031-2","DOI":"10.1016\/s0305-0548(97)00031-2"},{"key":"2_CR22","unstructured":"Nemenyi, P.: Distribution-free multiple comparisons. Biometrics 18(2), 263 (1962). International Biometric Soc 1441 I ST, NW, Suite 700, Washington, DC 20005-2210"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Oyola, J., Arntzen, H., Woodruff, D.L.: The stochastic vehicle routing problem, a literature review, Part II: solution methods. EURO J. Trans. Log. 6(4), 349\u2013388 (2016). https:\/\/doi.org\/10.1007\/s13676-016-0099-7","DOI":"10.1007\/s13676-016-0099-7"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Pereira, V.N.G., et al. (2018) The Steiner multi cycle problem with applications to a collaborative truckload problem. In: 17th International Symposium on Experimental Algorithms (SEA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.SEA.2018.26","DOI":"10.4230\/LIPICS.SEA.2018.26"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Polacek, M., et al.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10(6), 613\u2013627 (2004). https:\/\/doi.org\/10.1007\/s10732-005-5432-5","DOI":"10.1007\/s10732-005-5432-5"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Pongchairerks, P.: Forward VNS, reverse VNS, and multi-VNS algorithms for job-shop scheduling problem. Modell. Simul. Eng. 2016, 1\u201315 (2016). https:\/\/doi.org\/10.1155\/2016\/5071654","DOI":"10.1155\/2016\/5071654"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Psaraftis, H.N., Wen, M., Kontovas, C.A.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3\u201331 (2015). https:\/\/doi.org\/10.1002\/net.21628","DOI":"10.1002\/net.21628"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Rios, B.H.O., et al.: Stochastic multi-depot vehicle routing problem with pickup and delivery: an ILS approach. In: Proceedings of the 2020 Federated Conference on Computer Science and Information Systems. IEEE (2020). https:\/\/doi.org\/10.15439\/2020f127","DOI":"10.15439\/2020f127"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Rios, B.H.O., Goldbarg, E.F.G., Goldbarg, M.C.: A hybrid metaheuristic for the traveling car renter salesman problem. In: 2017 Brazilian Conference on Intelligent Systems (BRACIS). IEEE (2017). https:\/\/doi.org\/10.1109\/bracis.2017.20","DOI":"10.1109\/bracis.2017.20"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Rios, B.H.O., Goldbarg, E.F.G., Quesquen, G.Y.O.: A hybrid metaheuristic using a corrected formulation for the Traveling Car Renter Salesman Problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE (2017). https:\/\/doi.org\/10.1109\/cec.2017.7969584","DOI":"10.1109\/cec.2017.7969584"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Stodola, P.: Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem. Natural Comput. 19(2), 463\u2013475 (2020). https:\/\/doi.org\/10.1007\/s11047-020-09783-6","DOI":"10.1007\/s11047-020-09783-6"}],"container-title":["Studies in Computational Intelligence","Recent Advances in Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82397-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T06:02:37Z","timestamp":1639461757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82397-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"ISBN":["9783030823962","9783030823979"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82397-9_2","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021,12,15]]},"assertion":[{"value":"15 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Workshop on Computational Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fedcsis.org\/2020\/wco","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}