{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:28:40Z","timestamp":1743038920847,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":19,"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_46","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"581-597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Discrete Artificial Bee Colony Algorithm"],"prefix":"10.1007","author":[{"given":"Wanying","family":"Liang","sequence":"first","affiliation":[]},{"given":"Shuo","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Shiji","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Xuechun","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Yanzi","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"5","key":"46_CR2","first-page":"51","volume":"10","author":"M Lang","year":"2002","unstructured":"Lang, M., Hu, S.: Research on solving logistics distribution path optimization problem with hybrid genetic algorithm. Chin. Manag. Sci. 10(5), 51\u201356 (2002)","journal-title":"Chin. Manag. Sci."},{"issue":"44","key":"46_CR3","first-page":"46","volume":"06","author":"X Lv","year":"2009","unstructured":"Lv, X., Liao, T.: Research on postal vehicle routing problem with time window based on genetic algorithm. J. Shandong Univ. 06(44), 46\u201350 (2009)","journal-title":"J. Shandong Univ."},{"issue":"10","key":"46_CR4","first-page":"13","volume":"10","author":"F Lin","year":"2007","unstructured":"Lin, F., Guo, H.: Simulation research on workshop distribution path optimization based on ant colony algorithm. Mech. Des. Manuf. 10(10), 13\u201315 (2007)","journal-title":"Mech. Des. Manuf."},{"key":"46_CR5","unstructured":"Tang, Y., Liu, F.: A new genetic simulated annealing algorithm for solving VRPTW problem. Comput. Eng. Appl. 42(7), 12\u201314 (2006)"},{"key":"46_CR6","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numercial optimization. Technical Report-TR06. Erciyes University, 13\u201315 (2005)"},{"key":"46_CR7","unstructured":"Jin, Y., Sun, Y., Wang, J., Wang, D.: An improved elite artificial bee colony algorithm based on simplex. J. Zhengzhou Univ. 39(6), 13\u201315 (2018)"},{"key":"46_CR8","unstructured":"Zhao, Y., Xu, X., Huang, W., Ma, Y.: Hybrid artificial bee swarm algorithm based on cat swarm idea. Comput. Technol. Dev. 29(1), 11\u201312 (2019)"},{"issue":"3","key":"46_CR9","first-page":"49","volume":"34","author":"X Liang","year":"2018","unstructured":"Liang, X., Zhao, X.: An improved artificial bee swarm algorithm based on steepest drop method. J. Beijing Univ. Archit. 34(3), 49\u201356 (2018)","journal-title":"J. Beijing Univ. Archit."},{"issue":"2","key":"46_CR10","first-page":"300","volume":"13","author":"X Chao","year":"2019","unstructured":"Chao, X., Li, W.: Feature selection method for artificial bee swarm algorithm optimization. Comput. Sci. Explor. 13(2), 300\u2013309 (2019)","journal-title":"Comput. Sci. Explor."},{"key":"46_CR11","doi-asserted-by":"publisher","unstructured":"Aslan, S.: A transition control mechanism for artificial bee colony algorithm. Comput. Intell. Neurosci. 4(6), 1\u201323 (2019). \nhttps:\/\/doi.org\/10.1155\/2019\/5012313","DOI":"10.1155\/2019\/5012313"},{"key":"46_CR12","doi-asserted-by":"publisher","unstructured":"Dervis, K.: Discovery of conserved regions in DNA sequences by Artificial Bee Colony (ABC) algorithm based methods. Nat. Comput. 15(6) (2019). \nhttps:\/\/doi.org\/10.1007\/s11047-018-9674-1","DOI":"10.1007\/s11047-018-9674-1"},{"key":"46_CR13","unstructured":"Yu, X.: Research on vehicle routing problem with time window considering carbon emission based on artificial bee swarm algorithm. Master\u2019s thesis. Dalian University of Technology, vol. 1, no. 5, pp. 88\u201389 (2016)"},{"key":"46_CR14","volume-title":"Multi-Objective Optimization Using Evolutionary Algorithms","author":"K Deb","year":"2001","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester (2001)"},{"issue":"2","key":"46_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.3724\/SP.J.1001.2009.00271","volume":"20","author":"M Gong","year":"2009","unstructured":"Gong, M., Jiao, L., Yang, D.: Research on evolutionary multiobjective optimization algorithm. J. Softw. 20(2), 271\u2013289 (2009)","journal-title":"J. Softw."},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1186\/s40064-016-2940-8","volume":"5","author":"M Alzaqebah","year":"2016","unstructured":"Alzaqebah, M., Abdullah, S., Jawarneh, S.: Modified artificial bee colony for the vehicle routing problems with time windows. SpringerPlus 5, 1298 (2016)","journal-title":"SpringerPlus"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"KC Tan","year":"2001","unstructured":"Tan, K.C., Lee, L.H., Zhu, Q.L., Ou, K.: Heuristic methods for vehicle routing problem with time windows. Artif. Intell. Eng. 15, 281\u2013295 (2001)","journal-title":"Artif. Intell. Eng."},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","volume":"38","author":"B Yu","year":"2011","unstructured":"Yu, B., Yang, Z.Z., Yao, B.Z.: A hybrid algorithm for vehicle routing problem with time windows. Expert Syst. Appl. 38, 435\u2013441 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"46_CR19","first-page":"1420","volume":"34","author":"X Su","year":"2013","unstructured":"Su, X., Sun, H., Pan, X.: Simulation of traveling Salesman problem based on improved bee swarm algorithm. Comput. Eng. Des. 34(4), 1420\u20131424 (2013)","journal-title":"Comput. Eng. Des."}],"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_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:34:38Z","timestamp":1585791278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_46","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)"}}]}}