{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:46:46Z","timestamp":1743054406683,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366246"},{"type":"electronic","value":"9783031366253"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36625-3_30","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"374-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Repetitive Grouping Max-Min Ant System for\u00a0Multi-Depot Vehicle Routing Problem with\u00a0Time Window"],"prefix":"10.1007","author":[{"given":"Wanfeng","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ruochen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Mengyi","family":"Niu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"issue":"13\u201314","key":"30_CR1","doi-asserted-by":"publisher","first-page":"6536","DOI":"10.1016\/j.apm.2016.01.059","volume":"40","author":"H Bae","year":"2016","unstructured":"Bae, H., Moon, I.: Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Appl. Math. Model. 40(13\u201314), 6536\u20136549 (2016)","journal-title":"Appl. Math. Model."},{"issue":"5","key":"30_CR2","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transport. Res. Part C: Emerg. Technol. 19(5), 723\u2013740 (2011)","journal-title":"Transport. Res. Part C: Emerg. Technol."},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","volume":"284","author":"J Brand\u00e3o","year":"2020","unstructured":"Brand\u00e3o, J.: A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur. J. Oper. Res. 284(2), 559\u2013571 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"30_CR4","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Society 52(8), 928\u2013936 (2001)","journal-title":"J. Oper. Res. Society"},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"JF Cordeau","year":"2004","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J. Oper. Res. Society 55(5), 542\u2013546 (2004)","journal-title":"J. Oper. Res. Society"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/S0377-2217(97)00363-9","volume":"111","author":"G Desaulniers","year":"1998","unstructured":"Desaulniers, G., Lavigne, J., Soumis, F.: Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. 111(3), 479\u2013494 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst., Man, Cybern., Part B (Cybernetics) 26(1), 29\u201341 (1996)","DOI":"10.1109\/3477.484436"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.cor.2017.02.022","volume":"84","author":"G Erdo\u011fan","year":"2017","unstructured":"Erdo\u011fan, G.: An open source spreadsheet solver for vehicle routing problems. Comput. Oper. Res. 84, 62\u201372 (2017)","journal-title":"Comput. Oper. Res."},{"key":"30_CR10","first-page":"256","volume":"25","author":"H Fan","year":"2019","unstructured":"Fan, H., Yang, X., Li, D., Li, Y., Liu, P., Wu, J.: Half-open multi-depot vehicle routing problem based on joint distribution mode of fresh food. Comput. Integ. Manufact. Syst 25, 256\u2013266 (2019)","journal-title":"Comput. Integ. Manufact. Syst"},{"issue":"9","key":"30_CR11","doi-asserted-by":"publisher","first-page":"168781401666529","DOI":"10.1177\/1687814016665297","volume":"8","author":"J Gao","year":"2016","unstructured":"Gao, J., Gu, F., Hu, P., Xie, Y., Yao, B.: Automobile chain maintenance parts delivery problem using an improved ant colony algorithm. Adv. Mech. Eng. 8(9), 1687814016665297 (2016)","journal-title":"Adv. Mech. Eng."},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B., Solomon, M.M.: Vehicle routing problem with time windows. In: Column generation, pp. 67\u201398. Springer (2005). https:\/\/doi.org\/10.1007\/0-387-25486-2_3","DOI":"10.1007\/0-387-25486-2_3"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2015.06.082","volume":"248","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., Laporte, G.: The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm. Eur. J. Oper. Res. 248(1), 33\u201351 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10878-014-9767-4","volume":"31","author":"J Li","year":"2016","unstructured":"Li, J., Li, Y., Pardalos, P.M.: Multi-depot vehicle routing problem with time windows under shared depot resources. J. Comb. Optim. 31, 515\u2013532 (2016)","journal-title":"J. Comb. Optim."},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","volume":"70","author":"S Mancini","year":"2016","unstructured":"Mancini, S.: A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic. Transp. Res. Part C: Emerg. Technol. 70, 100\u2013112 (2016)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Martins, L.d.C., Bayliss, C., Juan, A.A., Panadero, J., Marmol, M.: A savings-based heuristic for solving the omnichannel vehicle routing problem with pick-up and delivery. Transport. Res. Proc. 47, 83\u201390 (2020)","DOI":"10.1016\/j.trpro.2020.03.082"},{"issue":"2","key":"30_CR17","first-page":"94","volume":"15","author":"W Nan","year":"2012","unstructured":"Nan, W., Shiqi, L., Junfeng, W.: Vehicle routing with time windows in material delivery for automobile general assembly line. Ind. Eng. J. 15(2), 94 (2012)","journal-title":"Ind. Eng. J."},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Niu, M., Liu, R., Wang, H.: A max-min ant system based on decomposition for the multi-depot cumulative capacitated vehicle routing problem. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 620\u2013627. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504891"},{"issue":"2","key":"30_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10852-011-9171-3","volume":"11","author":"S Noori","year":"2012","unstructured":"Noori, S., Ghannadpour, S.F.: High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows. J. Math. Modell. Algorithms 11(2), 159\u2013179 (2012)","journal-title":"J. Math. Modell. Algorithms"},{"issue":"6","key":"30_CR20","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10(6), 613\u2013627 (2004)","journal-title":"J. Heuristics"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.cor.2014.07.004","volume":"53","author":"A Rahimi-Vahed","year":"2015","unstructured":"Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., Rei, W.: Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput. Oper. Res. 53, 9\u201323 (2015)","journal-title":"Comput. Oper. Res."},{"key":"30_CR22","unstructured":"Thangiah, S.R., Osman, I.H., Sun, T.: Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Computer Science Department, Slippery Rock University, Technical Report SRU CpSc-TR-94-27 69 (1994)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM (2002)","DOI":"10.1137\/1.9780898718515"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36625-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:32:05Z","timestamp":1710343925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36625-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366246","9783031366253"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36625-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}