.png){kind=icon}
.png){kind=icon}
Return
Worm optimization for the multiple level warehouse layout problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-017-2683-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the NP-complete multiple level warehouse layout problem is addressed. The problem consists of assigning items to cells and levels with the objective of minimizing transportation costs. A worm optimization algorithm (WO) is introduced, based on the foraging behaviors of Caenorhabditis elegans (Worms), and its performance was assessed by comparing with a genetic algorithm (GA), ant colony optimization (ACO), and an exact solution (B&B) for small problems. The computational results reflected the superiority of WO in large problems, with a marginally better performance than ACO and GA in smaller ones, while solving the tested problems within a reasonable computational time. Furthermore, WO was able to attain most of the known optimal solutions.
Keywords:
Multiple level warehouse layout problem
Worm optimization
Ant colony optimization
Genetic algorithm
Branch and bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available