Metaheuristics for Order Picking Optimisation: A Comparison Among Three Swarm-Intelligence Algorithms
Nowadays, the Order Picking Problem (OPP) represents the most costly and time-consuming operation of warehouse management, with an average ranging from 50 to 75% of the total warehouse management cost. So, OPP is being analysed to improve logistics operations in companies. The OPP consists of dispat...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | Capítulo de libro |
| Language: | English |
| Published: |
Springer
2021
|
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-030-68663-5_13 https://link.springer.com/chapter/10.1007/978-3-030-68663-5_13 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Nowadays, the Order Picking Problem (OPP) represents the most costly and time-consuming operation of warehouse management, with an average ranging from 50 to 75% of the total warehouse management cost. So, OPP is being analysed to improve logistics operations in companies. The OPP consists of dispatching a set of products, allocated in specific places in a warehouse, based in a group of customer orders. In most traditional warehouses, the optimisation methods of order picking operations are associated with time, whose model is based on the Traveling Salesperson Problem (TSP). The TSP is considered as an NP-Hard problem; thus, the development of metaheuristics approaches is justified. This chapter presents a comparison among three different optimisation metaheuristic approaches that solve the OPP. An analysis is used to evaluate and compare ant colony optimisation, elephant herding optimisation, and the bat algorithm. This study considers the number of picking aisles, the number of extra cross aisles, the number of items in the order, and the standard deviation in both the x and y-axis of the product distribution in the warehouse. |
|---|