{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:57Z","timestamp":1742913837747,"version":"3.40.3"},"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_37","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"484-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Task Set Scheduling of Airport Freight Station Based on Parallel Artificial Bee Colony Algorithm"],"prefix":"10.1007","author":[{"given":"Haiquan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Menghao","family":"Su","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Shanshan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"95","key":"37_CR1","first-page":"1407","volume":"23","author":"H Wang","year":"2016","unstructured":"Wang, H., Hu, Y., Liao, W.: Path planning algorithm based on improved artificial bee colony algorithm. Control Eng. China 23(95), 1407\u20131411 (2016)","journal-title":"Control Eng. China"},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s10696-012-9164-1","volume":"27","author":"S Henn","year":"2012","unstructured":"Henn, S.: Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flex. Serv. Manuf. J. 27(1), 86\u2013114 (2012). \nhttps:\/\/doi.org\/10.1007\/s10696-012-9164-1","journal-title":"Flex. Serv. Manuf. J."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Chen, R.-M., Shen, Y.-M., Wang, C.-T.: Ant colony optimization inspired swarm optimization for grid task scheduling. In: CONFERENCE 2016. LNCS, pp. 461\u2013464 (2016)","DOI":"10.1109\/IS3C.2016.122"},{"issue":"c","key":"37_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cie.2016.03.011","volume":"96","author":"N Kundakci","year":"2016","unstructured":"Kundakci, N., Kulak, O.: Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Comput. Ind. Eng. 96(c), 31\u201351 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"37_CR5","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ins.2017.07.011","volume":"417","author":"L Cui","year":"2017","unstructured":"Cui, L., Li, G., Wang, X.: A ranking-based adaptive artificial bee colony algorithm for global numerical optimization. Inf. Sci. 417(11), 169\u2013185 (2017)","journal-title":"Inf. Sci."},{"issue":"4","key":"37_CR6","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.asoc.2017.10.040","volume":"62","author":"S Ghambari","year":"2018","unstructured":"Ghambari, S., Rahati, A.: An improved artificial bee colony algorithm and its application to reliability optimization problems. Appl. Soft Comput. 62(4), 736\u2013767 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"37_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.engappai.2015.05.009","volume":"44","author":"H Ma","year":"2015","unstructured":"Ma, H., Su, S., Simon, D.: Ensemble multi-objective biogeography-based optimization with application to automated warehouse scheduling. Eng. Appl. Artif. Intell. 44(9), 79\u201390 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"C","key":"37_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ijpe.2018.10.001","volume":"206","author":"E Ardjmand","year":"2018","unstructured":"Ardjmand, E., Shakeri, H., Singh, M.: Minimizing order picking makespan with multiple pickers in a wave picking warehouse. Int. J. Prod. Econ. 206(C), 169\u2013183 (2018)","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"37_CR9","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.ejor.2017.10.020","volume":"266","author":"V Nesello","year":"2018","unstructured":"Nesello, V., Subramanian, A., Battarra, M.: Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times. Eur. J. Oper. Res. 266(2), 498\u2013507 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"37_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ins.2017.07.011","volume":"417","author":"L Cui","year":"2017","unstructured":"Cui, L., et al.: A ranking-based adaptive artificial bee colony algorithm for global numerical optimization. Inf. Sci. 417(11), 169\u2013185 (2017)","journal-title":"Inf. Sci."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Wang, H., Wei, J., Wen, S.: Research on parallel optimization of artificial bee colony algorithm. In: CONFERENCE 2018. LNCS, pp. 125\u2013129 (2018)","DOI":"10.1109\/ICAMechS.2018.8507121"},{"issue":"12","key":"37_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.cie.2016.06.025","volume":"102","author":"L Asadzadeh","year":"2016","unstructured":"Asadzadeh, L.: A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput. Ind. Eng. 102(12), 359\u2013367 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"37_CR13","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.trc.2017.03.019","volume":"80","author":"M Dell\u2019Orco","year":"2017","unstructured":"Dell\u2019Orco, M., Marinelli, M., Altieri, M.G.: Solving the gate assignment problem through the fuzzy bee colony optimization. Transp. Res. Part C Emerg. Technol. 80(7), 424\u2013438 (2017)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"37_CR14","unstructured":"Qiu, J., Jiang, Z., Tang, M.: Research and application of NLAPSO algorithm to ETV scheduling optimization in airport cargo terminal. 34(1), 65\u201370 (2015)"}],"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_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:34:12Z","timestamp":1585791252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_37","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)"}}]}}