{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:14:39Z","timestamp":1771467279496,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819985395","type":"print"},{"value":"9789819985401","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T00:00:00Z","timestamp":1703462400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T00:00:00Z","timestamp":1703462400000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8540-1_40","type":"book-chapter","created":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T18:01:32Z","timestamp":1703440892000},"page":"500-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online Airline Baggage Packing Based on Hierarchical Tree A2C-Reinforcement Learning Framework"],"prefix":"10.1007","author":[{"given":"Pan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ming","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jintao","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Jiulin","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,25]]},"reference":[{"key":"40_CR1","first-page":"39","volume":"06","author":"M Xu","year":"2020","unstructured":"Xu, M.: Thinking on the development of smart airport in the new era. Civ. Aviat. Manage. 06, 39\u201342 (2020)","journal-title":"Civ. Aviat. Manage."},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.cie.2022.108122","volume":"168","author":"S Ali","year":"2022","unstructured":"Ali, S., Ramos, A.G., Carravilla, M.A., Oliveira, J.F.: On-line three-dimensional packing problems: a review of off-line and on-line solution approaches. Comput. Ind. Eng. 168, 108\u2013122 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"40_CR4","first-page":"2345","volume":"48","author":"Z Xing","year":"2022","unstructured":"Xing, Z., Hou, X., Li, B., Zhang, T., Wen, T.: Dynamic quadtree search algorithm for luggage cart placement in Civil Aviation. J. Beijing Univ. Aeronaut. Astronaut. 48(12), 2345\u20132355 (2022)","journal-title":"J. Beijing Univ. Aeronaut. Astronaut."},{"key":"40_CR5","unstructured":"Hong, Z., Zhang, C.: Airport Baggage stowage strategy based on support vector machine model. J. Comput. Appl. Softw. 39(7), 44\u201351+66 (2022)"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Ha, C.T., Nguyen, T.T., Bui, L.T., Wang, R.: An online packing heuristic for the three-dimensional container loading problem in dynamic environments and the physical internet. In: Applications of Evolutionary Computation: 20th European Conference, Amsterdam, The Netherlands, April, pp. 19\u201321 (2017)","DOI":"10.1007\/978-3-319-55792-2_10"},{"issue":"12","key":"40_CR7","doi-asserted-by":"publisher","first-page":"2553","DOI":"10.3724\/SP.J.1016.2012.02553","volume":"35","author":"D Zhang","year":"2012","unstructured":"Zhang, D., Peng, Y., Zhang, L.: Multi-layer heuristic search algorithm for three-dimensional packing problem. Chin. J. Comput. 35(12), 2553\u20132561 (2012)","journal-title":"Chin. J. Comput."},{"issue":"21","key":"40_CR8","first-page":"200","volume":"42","author":"C Zhang","year":"2021","unstructured":"Zhang, C., Zhang, Q., Zhai, Y., Liu, J.: Online airline baggage loading optimization based on improved particle swarm optimization. Packag. Eng. 42(21), 200\u2013206 (2021)","journal-title":"Packag. Eng."},{"issue":"21","key":"40_CR9","first-page":"213","volume":"42","author":"W Zhang","year":"2021","unstructured":"Zhang, W., Chai, S., Wang, W., Chen, Y.: Heuristic algorithm for solving the online multi-size luggage packing problem. Packag. Eng. 42(21), 213\u2013221 (2021)","journal-title":"Packag. Eng."},{"key":"40_CR10","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"40_CR11","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, 6\u20139 May (2019)"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPDS.2021.3138459","volume":"01","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Shen, H.: Deep reinforcement learning enhanced greedy algorithm for online scheduling of batched tasks in cloud in cloud HPC systems. IEEE Trans. Parallel Distrib. Syst. 01, 1\u201312 (2021)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"40_CR13","unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., Xu, Y.: Solving a new 3d bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930 (2017)"},{"issue":"5","key":"40_CR14","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1109\/TCYB.2021.3121542","volume":"53","author":"Y Jiang","year":"2023","unstructured":"Jiang, Y., Cao, Z., Zhang, J.: Learning to solve 3-D bin packing problem via deep reinforcement learning and constraint programming. IEEE Trans. Cybernet. 53(5), 2864\u20132875 (2023)","journal-title":"IEEE Trans. Cybernet."},{"key":"40_CR15","unstructured":"Verma, R., et al.: A generalized reinforcement learning algorithm for online 3d bin-packing. arXiv preprint arXiv:2007.00463 (2020)"},{"issue":"112105","key":"40_CR16","first-page":"1","volume":"65","author":"H Zhao","year":"2022","unstructured":"Zhao, H., Zhu, C., Xu, X., Huang, H., Xu, K.: Learning Practically feasible policies for online 3D bin packing. SCIENCE CHINA Inf. Sci. 65(112105), 1\u201317 (2022)","journal-title":"SCIENCE CHINA Inf. Sci."},{"key":"40_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107518","volume":"159","author":"S Erbayrak","year":"2021","unstructured":"Erbayrak, S., \u00d6zk\u0131r, V., Y\u0131ld\u0131r\u0131m, U.M.: Multi-objective 3D bin packing problem with load balance and product family concerns. Comput. Ind. Eng. 159, 107518 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, X., Xia, L., Zhang, L., Ding, Z., Yin, D., Tang, J.: Deep reinforcement learning for page-wise recommendations. arXiv preprint arXiv:1805.02343 (2018)","DOI":"10.1145\/3240323.3240374"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8540-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T18:06:52Z","timestamp":1703441212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8540-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,25]]},"ISBN":["9789819985395","9789819985401"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8540-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,25]]},"assertion":[{"value":"25 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chinese Conference on Pattern Recognition and Computer Vision  (PRCV)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","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":"13 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccprcv2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prcv2023.xmu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1420","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":"532","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":"37% - 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,78","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,69","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)"}}]}}