{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T21:10:55Z","timestamp":1770844255508,"version":"3.50.1"},"reference-count":34,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:00:00Z","timestamp":1560816000000},"content-version":"vor","delay-in-days":168,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71701213"],"award-info":[{"award-number":["71701213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71401181"],"award-info":[{"award-number":["71401181"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","award":["15YJC630008"],"award-info":[{"award-number":["15YJC630008"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","award":["14YJC630136"],"award-info":[{"award-number":["14YJC630136"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>A problem\u2010specific routing algorithm integrating ant colony optimization (<jats:italic>ACO<\/jats:italic>) and integer\u2010coded genetic algorithm (<jats:italic>GA<\/jats:italic>) is developed to address the newly observed limitations imposed by ultranarrow aisles and access restriction, which exist in the largest e\u2010commerce enterprise with self\u2010run logistics in China. Those limitations prohibit pickers from walking through the whole aisle, and the access restriction even allows them to access the pick aisles only from specific entrances. The ant colony optimization is mainly responsible for generating the initial chromosomes for the genetic algorithm, which then searches the near\u2010optimal solutions of picker\u2010routing with our novel chromosome design by recording the detailed information of access modes and subaisles. To demonstrate the merits of the proposed algorithm, a comprehensive simulation for comparison is conducted with 12 warehouse layouts with real order information. The simulation results show that the proposed hybrid algorithm is superior to dedicated heuristics in terms of solution quality. The impacts of the parameters with respect to warehouse layout on the picking efficiency are analyzed as well. Setting more connect aisles and cross aisles is suggested to effectively optimize the picking\u2010service efficiency in the presence of access limitations.<\/jats:p>","DOI":"10.1155\/2019\/1280285","type":"journal-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:30:39Z","timestamp":1560900639000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An Integrated Metaheuristic Routing Method for Multiple\u2010Block Warehouses with Ultranarrow Aisles and Access Restriction"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4512-7190","authenticated-orcid":false,"given":"Fangyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Gangyan","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1738-2047","authenticated-orcid":false,"given":"Yongchang","family":"Wei","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2019,6,18]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2013.10.009"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.11.017"},{"key":"e_1_2_10_3_2","volume-title":"Facilities Planning","author":"Tompkins J. A.","year":"2010"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-017-9277-7"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2017.08.004"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1108\/01443579710177860"},{"key":"e_1_2_10_7_2","first-page":"859","article-title":"The effects of pick density on order picking areas with narrow aisles","volume":"38","author":"Gue K.","year":"2006","journal-title":"Institute of Industrial Engineers (IIE). IIE Transactions"},{"key":"e_1_2_10_8_2","first-page":"232","article-title":"Estimating picker blocking in wide-aisle order picking systems","volume":"41","author":"Parikh P. J.","year":"2009","journal-title":"Institute of Industrial Engineers (IIE). IIE Transactions"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.12.031"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.03.045"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.06.013"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0871-1"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1473657"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.07.009"},{"key":"e_1_2_10_15_2","first-page":"76","article-title":"Distance approximations for routing manual pickers in a warehouse","volume":"25","author":"Hall R. W.","year":"1993","journal-title":"Institute of Industrial Engineers (IIE). IIE Transactions"},{"key":"e_1_2_10_16_2","first-page":"63","article-title":"Order batching to minimize total travel time in a parallel-aisle warehouse","volume":"37","author":"Gademann N.","year":"2005","journal-title":"Institute of Industrial Engineers (IIE). IIE Transactions"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.02.029"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/2726070"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/8420294"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-011-9101-8"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.001"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.03.069"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.03.009"},{"key":"e_1_2_10_24_2","first-page":"65","article-title":"A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions","volume":"20","author":"Grosse E. H.","year":"2014","journal-title":"International Journal of Operations and Quantitative Management"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2014.09.029"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2015.03.021"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1187313"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.02.018"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207540600806398"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.849009"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.07.003"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110028128"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2015.05.004"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00177-6"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/1280285.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/1280285.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/1280285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:52:27Z","timestamp":1723031547000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/1280285"}},"subtitle":[],"editor":[{"given":"Jorge Luis","family":"Garc\u00eda-Alcaraz","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/1280285"],"URL":"https:\/\/doi.org\/10.1155\/2019\/1280285","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2019-04-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-05-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1280285"}}