{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:29:30Z","timestamp":1771190970452,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T00:00:00Z","timestamp":1641254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T00:00:00Z","timestamp":1641254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Science, Technology and Innovation Commission of ShenZhen Municipality","award":["JCYJ20190807094803721"],"award-info":[{"award-number":["JCYJ20190807094803721"]}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["ZR2020MF085"],"award-info":[{"award-number":["ZR2020MF085"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Robotic Mobile Fulfillment System (RMFS) affects the traditional scheduling problems heavily while operating a warehouse. This paper focuses on storage assignment optimization for Fishbone Robotic Mobile Fulfilment Systems (FRMFS). Based on analyzing operation characteristics of FRMFS, a storage assignment optimization model is proposed with the objectives of maximizing operation efficiency and balancing aisle workload. Adaptive Genetic Algorithm (AGA) is designed to solve the proposed model. To validate the effectiveness of AGA in terms of iteration and optimization rate, this paper designs a variety of scenarios with different task sizes and storage cells. AGA outperforms other four algorithm in terms of fitness value and convergence and has better convergence rate and stability. The experimental results also show the advancement of AGA in large size FRMFS. In conclusion, this paper proposes a storage assignment model for FRMFS to reduce goods movement and travel distance and improve the order picking efficiency.<\/jats:p>","DOI":"10.1007\/s40747-021-00597-2","type":"journal-article","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T07:03:04Z","timestamp":1641279784000},"page":"4587-4602","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Storage assignment optimization for fishbone robotic mobile fulfillment systems"],"prefix":"10.1007","volume":"8","author":[{"given":"Yanyan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Rongjun","family":"Man","sequence":"additional","affiliation":[]},{"given":"Wanmeng","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Honglin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,4]]},"reference":[{"issue":"3","key":"597_CR1","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1007\/s40747-020-00267-9","volume":"7","author":"F Yang","year":"2021","unstructured":"Yang F, Gu S (2021) Industry 4.0, a revolution that requires technology and national strategies. Complex Intell Syst 7(3):1311\u20131325","journal-title":"Complex Intell Syst"},{"issue":"3","key":"597_CR2","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.ejor.2016.06.063","volume":"256","author":"T Lamballais","year":"2017","unstructured":"Lamballais T, Roy D, De Koster M (2017) Estimating performance in a robotic mobile fulfillment system. Eur J Oper Res 256(3):976\u2013990","journal-title":"Eur J Oper Res"},{"issue":"3","key":"597_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1080\/07408170802112726","volume":"41","author":"R Gue","year":"2009","unstructured":"Gue R, Meller D (2009) Aisle configurations for unit load warehouses. IIE Trans 41(3):171\u2013182","journal-title":"IIE Trans"},{"issue":"4","key":"597_CR4","first-page":"333","volume":"4","author":"J White","year":"1972","unstructured":"White J (1972) Optimum design of warehouses having radial aisles. IIE Trans 4(4):333\u2013336","journal-title":"IIE Trans"},{"issue":"6","key":"597_CR5","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1287\/trsc.2018.0826","volume":"52","author":"F Weidinger","year":"2018","unstructured":"Weidinger F, Boysen N, Briskorn D (2018) Storage assignment with rack-moving mobile robots in KIVA warehouses. Transp Sci 52(6):1479\u20131495","journal-title":"Transp Sci"},{"issue":"1","key":"597_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/24725854.2018.1560517","volume":"52","author":"T Lamballais","year":"2020","unstructured":"Lamballais T, Roy D, Koster R (2020) Inventory allocation in robotic mobile fulfillment systems. IISE Trans 52(1):1\u201317","journal-title":"IISE Trans"},{"key":"597_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.tre.2018.11.005","volume":"122","author":"D Roy","year":"2019","unstructured":"Roy D, Nigam S, de Koster R, Adan I, Resing J (2019) Robot-storage zone assignment strategies in mobile fulfillment systems. Transp Res Pt e-Logist Transp Rev 122:119\u2013142","journal-title":"Transp Res Pt e-Logist Transp Rev"},{"issue":"1","key":"597_CR8","doi-asserted-by":"publisher","first-page":"12020","DOI":"10.1088\/1757-899X\/337\/1\/012020","volume":"337","author":"M Hadi","year":"2018","unstructured":"Hadi M, Djatna T (2018) A modeling of dynamic storage assignment for order picking in beverage warehousing with Drive-in Rack system. Iop Conference 337(1):12020\u201312026","journal-title":"Iop Conference"},{"issue":"21","key":"597_CR9","doi-asserted-by":"publisher","first-page":"6593","DOI":"10.1080\/00207543.2019.1567953","volume":"57","author":"B Bahrami","year":"2019","unstructured":"Bahrami B, Aghezzaf E, Lim\u00e8re V (2019) Enhancing the order picking process through a new storage assignment strategy in forward-reserve area. Int J Prod Res 57(21):6593\u20136614","journal-title":"Int J Prod Res"},{"issue":"4","key":"597_CR10","doi-asserted-by":"publisher","first-page":"860","DOI":"10.3901\/CJME.2014.0430.084","volume":"27","author":"Y Wu","year":"2014","unstructured":"Wu Y, Wu Y (2014) Taboo search algorithm for item assignment in synchronized zone automated order picking system. Chin J Mech Eng 27(4):860\u2013866","journal-title":"Chin J Mech Eng"},{"issue":"04","key":"597_CR11","first-page":"47","volume":"40","author":"M He","year":"2018","unstructured":"He M, Xie F, Li C (2018) Dynamic optimization strategy of KIVA storage location based on T-SKU method. Logist Eng Manag 40(04):47\u201350","journal-title":"Logist Eng Manag"},{"issue":"01","key":"597_CR12","first-page":"128","volume":"41","author":"X Xu","year":"2020","unstructured":"Xu X, He S, Li X (2020) RMFS storage location assignment based on dutch auction. Packag Eng 41(01):128\u2013133","journal-title":"Packag Eng"},{"key":"597_CR13","doi-asserted-by":"publisher","first-page":"106129","DOI":"10.1016\/j.cie.2019.106129","volume":"139","author":"I Lee","year":"2020","unstructured":"Lee I, Chung S, Yoon S (2020) Two-stage storage assignment to minimize travel time and congestion for warehouse order picking operations. Comput Ind Eng 139:106129","journal-title":"Comput Ind Eng"},{"key":"597_CR14","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cie.2019.01.027","volume":"129","author":"R Zhang","year":"2019","unstructured":"Zhang R, Wang M, Pan X (2019) New model of the storage location assignment problem considering demand correlation pattern. Comput Ind Eng 129:210\u2013219","journal-title":"Comput Ind Eng"},{"key":"597_CR15","first-page":"1","volume":"2019","author":"Y He","year":"2019","unstructured":"He Y, Wang A, Su H, Wang M (2019) Particle swarm optimization using neighborhood-based mutation operator and intermediate disturbance strategy for outbound container storage location assignment problem. Math Probl Eng 2019:1\u201313","journal-title":"Math Probl Eng"},{"issue":"05","key":"597_CR16","first-page":"204","volume":"47","author":"H Tang","year":"2020","unstructured":"Tang H, Yan W, Chen Q, Lu J, Zhan Y (2020) Integrated optimization of location assignment and job scheduling in automated storage and retrieval system. Comput Sci 47(05):204\u2013211","journal-title":"Comput Sci"},{"key":"597_CR17","volume-title":"Research on the optimization storage slotting and order picking with non-traditional warehouse","author":"Y Hu","year":"2019","unstructured":"Hu Y (2019) Research on the optimization storage slotting and order picking with non-traditional warehouse. Nanchang University, Nanchang"},{"key":"597_CR18","first-page":"95","volume":"5","author":"A Cai","year":"2019","unstructured":"Cai A, Cai Y, Guo S, Geng C (2019) Ensemble multi-objective genetic algorithm with application to automated warehouse scheduling. Mach Des Manuf 5:95\u201398","journal-title":"Mach Des Manuf"},{"key":"597_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.asoc.2017.06.042","volume":"60","author":"A Gonzalez-Pardo","year":"2017","unstructured":"Gonzalez-Pardo A, Del Ser J, Camacho D (2017) Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems. Appl Soft Comput 60:241\u2013255","journal-title":"Appl Soft Comput"},{"issue":"04","key":"597_CR20","first-page":"293","volume":"38","author":"F Ning","year":"2017","unstructured":"Ning F, He C, Li T (2017) Study on slotting optimization of fishbone layout based on rack-to- picker mode. J Zhejiang Sci-Tech Univ (Soc Sci Ed) 38(04):293\u2013298","journal-title":"J Zhejiang Sci-Tech Univ (Soc Sci Ed)"},{"issue":"20","key":"597_CR21","doi-asserted-by":"publisher","first-page":"6175","DOI":"10.1080\/00207543.2017.1331050","volume":"55","author":"B Zou","year":"2017","unstructured":"Zou B, Gong Y, Xu X, Yuan Z (2017) Assignment rules in robotic mobile fulfilment systems for online retailers. Int J Prod Res 55(20):6175\u20136192","journal-title":"Int J Prod Res"},{"key":"597_CR22","first-page":"19","volume":"142","author":"A Gharehgozli","year":"2020","unstructured":"Gharehgozli A, Zaerpour N (2020) Robot scheduling for pod retrieval in a robotic mobile fulfillment system. Transp Res Pt e-Logist Transp Rev 142:19","journal-title":"Transp Res Pt e-Logist Transp Rev"},{"issue":"4","key":"597_CR23","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1109\/TASE.2020.2979897","volume":"17","author":"H Kim","year":"2020","unstructured":"Kim H, Pais C, Shen Z (2020) Item assignment problem in a robotic mobile fulfillment system. IEEE Trans Autom Sci Eng 17(4):1854\u20131867","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"597_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s40747-017-0036-x","volume":"3","author":"S Nguyen","year":"2017","unstructured":"Nguyen S, Mei Y, Zhang M (2017) Genetic programming for production scheduling: a survey with a unified framework. Complex Intell Syst 3(1):41\u201366","journal-title":"Complex Intell Syst"},{"issue":"7","key":"597_CR25","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1007\/s10845-016-1198-x","volume":"29","author":"G Nastasi","year":"2018","unstructured":"Nastasi G, Colla V, Cateni S, Campigli S (2018) Implementation and comparison of algorithms for multi-objective optimization based on genetic algorithms applied to the management of an automated warehouse. J Intell Manuf 29(7):1545\u20131557","journal-title":"J Intell Manuf"},{"key":"597_CR26","doi-asserted-by":"publisher","first-page":"100575","DOI":"10.1016\/j.swevo.2019.100575","volume":"51","author":"L He","year":"2019","unstructured":"He L, Li W, Zhang Y, Cao Y (2019) A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times. Swarm Evol Comput 51:100575\u2013110590","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"597_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s40747-020-00134-7","volume":"6","author":"S Qin","year":"2020","unstructured":"Qin S, Sun C, Zhang G, He X, Tan Y (2020) A modified particle swarm optimization based on decomposition with different ideal points for many-objective optimization problems. Complex Intell Syst 6(2):263\u2013274","journal-title":"Complex Intell Syst"},{"issue":"3","key":"597_CR28","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s40747-020-00159-y","volume":"6","author":"A Unal","year":"2020","unstructured":"Unal A, Kayakutlu G (2020) Multi-objective particle swarm optimization with random immigrants. Complex Intell Syst 6(3):635\u2013650","journal-title":"Complex Intell Syst"},{"key":"597_CR29","volume-title":"Design of automated warehouse and research on the method of intelligent accessing the goods","author":"W Peng","year":"2018","unstructured":"Peng W (2018) Design of automated warehouse and research on the method of intelligent accessing the goods. Jiangsu University of Science and Technology, Zhenjiang"},{"issue":"19","key":"597_CR30","first-page":"259","volume":"45","author":"G Yu","year":"2015","unstructured":"Yu G, Yu X (2015) An improved adaptive genetic algorithm. Math Pract Theory 45(19):259\u2013264","journal-title":"Math Pract Theory"},{"key":"597_CR31","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, Stutzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"key":"597_CR32","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Glob Optim 39:459\u2013471","journal-title":"J Glob Optim"},{"key":"597_CR33","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle Swarm Optimization. In Proceedings of the IEEE International Conference on Neural Networks, IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"597_CR34","doi-asserted-by":"crossref","unstructured":"Wang G, Deb S, Coelho L (2015) Elephant Herding Optimization. In Proceedings of the 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI 2015), IEEE, pp 1\u20135","DOI":"10.1109\/ISCBI.2015.8"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00597-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00597-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00597-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:17:17Z","timestamp":1666876637000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00597-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,4]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["597"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00597-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,4]]},"assertion":[{"value":"21 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors have approved the manuscript for publication, and there is no conflict of interest exists.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}