{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:32:40Z","timestamp":1726079560071},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"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-981-15-3425-6_20","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"244-254","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Ant Colony Optimization Algorithm for the Fleet Size and Mix Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Xiaodong","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Ding","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"G Bruce","year":"1984","unstructured":"Bruce, G.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49\u201366 (1984)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"20_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"FH Liu","year":"1999","unstructured":"Liu, F.H., Shen, S.Y.: The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50(7), 721\u2013732 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/trsc.1070.0190","volume":"41","author":"DA Mauro","year":"2007","unstructured":"Mauro, D.A., et al.: Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transp. Sci. 41(4), 516\u2013526 (2007)","journal-title":"Transp. Sci."},{"issue":"3","key":"20_CR4","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/trsc.1070.0217","volume":"42","author":"B Olli","year":"2008","unstructured":"Olli, B., et al.: An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transp. Sci. 42(3), 371\u2013386 (2008)","journal-title":"Transp. Sci."},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.trc.2009.08.004","volume":"18","author":"PP Repoussis","year":"2010","unstructured":"Repoussis, P.P., Tarantilis, C.D.: Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transp. Res. Part C Emerg. Technol. 18(5), 695\u2013712 (2010)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., et al.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2\u20133","key":"20_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., et al.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344(2\u20133), 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"20_CR8","first-page":"894","volume":"98","author":"B Yun","year":"2015","unstructured":"Yun, B., Li, T.Q., Zhang, Q.: A weighted max-min ant colony algorithm for TSP instances. IEICE Trans. Fund. 98(3), 894\u2013897 (2015)","journal-title":"IEICE Trans. Fund."},{"issue":"5","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/TEVC.2009.2016570","volume":"13","author":"Y Zhou","year":"2009","unstructured":"Zhou, Y.: Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Trans. Evol. Comput. 13(5), 1083\u20131092 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"9","key":"20_CR10","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.patrec.2008.06.001","volume":"30","author":"XX Zhang","year":"2009","unstructured":"Zhang, X.X., Tang, L.X.: A new hybrid ant colony optimization algorithm for the vehicle routing problem. Pattern Recogn. Lett. 30(9), 848\u2013855 (2009)","journal-title":"Pattern Recogn. Lett."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.endm.2004.06.029","volume":"18","author":"S Mazzeo","year":"2004","unstructured":"Mazzeo, S., Loiseau, I.: An ant colony algorithm for the capacitated vehicle routing. Electr. Notes Discrete Math. 18, 181\u2013186 (2004)","journal-title":"Electr. Notes Discrete Math."},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"625","DOI":"10.21629\/JSEE.2018.03.20","volume":"29","author":"Y Deng","year":"2018","unstructured":"Deng, Y., et al.: Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows. J. Syst. Eng. Electron. 29(3), 625\u2013638 (2018)","journal-title":"J. Syst. Eng. Electron."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"HZ Zhang","year":"2019","unstructured":"Zhang, H.Z., Zhang, Q.W.: A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf. Sci. 490, 166\u2013190 (2019)","journal-title":"Inf. Sci."},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:36:54Z","timestamp":1585769814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","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":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"197","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":"121","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":"61% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}