An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction
A problem-specific routing algorithm integrating ant colony optimization (ACO) and integer-coded genetic algorithm (GA) is developed to address the newly observed limitations imposed by ultranarrow aisles and access restriction, which exist in the largest e-commerce enterprise with self-run logistic...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2019-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2019/1280285 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832555348110606336 |
|---|---|
| author | Fangyu Chen Gangyan Xu Yongchang Wei |
| author_facet | Fangyu Chen Gangyan Xu Yongchang Wei |
| author_sort | Fangyu Chen |
| collection | DOAJ |
| description | A problem-specific routing algorithm integrating ant colony optimization (ACO) and integer-coded genetic algorithm (GA) is developed to address the newly observed limitations imposed by ultranarrow aisles and access restriction, which exist in the largest e-commerce enterprise with self-run 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-optimal solutions of picker-routing 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-service efficiency in the presence of access limitations. |
| format | Article |
| id | doaj-art-93fdf47f7db24aa5b27ee6683503b47d |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2019-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-93fdf47f7db24aa5b27ee6683503b47d2025-02-03T05:48:27ZengWileyComplexity1076-27871099-05262019-01-01201910.1155/2019/12802851280285An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access RestrictionFangyu Chen0Gangyan Xu1Yongchang Wei2Institute of Operations Management and System Engineering, School of Business Administration, Zhongnan University of Economics and Law, Wuhan 430073, ChinaSchool of Architecture, Harbin Institute of Technology, Shenzhen, ChinaInstitute of Operations Management and System Engineering, School of Business Administration, Zhongnan University of Economics and Law, Wuhan 430073, ChinaA problem-specific routing algorithm integrating ant colony optimization (ACO) and integer-coded genetic algorithm (GA) is developed to address the newly observed limitations imposed by ultranarrow aisles and access restriction, which exist in the largest e-commerce enterprise with self-run 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-optimal solutions of picker-routing 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-service efficiency in the presence of access limitations.http://dx.doi.org/10.1155/2019/1280285 |
| spellingShingle | Fangyu Chen Gangyan Xu Yongchang Wei An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction Complexity |
| title | An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction |
| title_full | An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction |
| title_fullStr | An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction |
| title_full_unstemmed | An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction |
| title_short | An Integrated Metaheuristic Routing Method for Multiple-Block Warehouses with Ultranarrow Aisles and Access Restriction |
| title_sort | integrated metaheuristic routing method for multiple block warehouses with ultranarrow aisles and access restriction |
| url | http://dx.doi.org/10.1155/2019/1280285 |
| work_keys_str_mv | AT fangyuchen anintegratedmetaheuristicroutingmethodformultipleblockwarehouseswithultranarrowaislesandaccessrestriction AT gangyanxu anintegratedmetaheuristicroutingmethodformultipleblockwarehouseswithultranarrowaislesandaccessrestriction AT yongchangwei anintegratedmetaheuristicroutingmethodformultipleblockwarehouseswithultranarrowaislesandaccessrestriction AT fangyuchen integratedmetaheuristicroutingmethodformultipleblockwarehouseswithultranarrowaislesandaccessrestriction AT gangyanxu integratedmetaheuristicroutingmethodformultipleblockwarehouseswithultranarrowaislesandaccessrestriction AT yongchangwei integratedmetaheuristicroutingmethodformultipleblockwarehouseswithultranarrowaislesandaccessrestriction |