This paper proposes a new metaheuristic algorithm called Particle Swarm-based picking time minimization (Pkt_PSO), ideated for picking time minimization in manual warehouses. As the name suggests, Pkt_PSO is inspired by Particle Swarm Optimization (PSO), and it is specifically designed to minimize the picking time in order case picking contexts. To assess the quality and the robustness of Pkt_PSO, it is compared to five alternative algorithms used as benchmarks. The comparisons are made in nine different scenarios obtained by changing the layout of the warehouse and the length of the picking list. The results of the analysis show that Pkt_PSO has a slower convergence rate and suffers less of early stagnation in local minima; this ensures a more extensive and accurate exploration of the solution space. In fact, the solutions provided by Pkt_PSO are always better (or at least comparable) to the ones found by the benchmarks, both in terms of quality (closeness to the overall best) and reliability (frequency with which the best solution is found). Clearly, as more solutions are explored, the computational time of Pkt_PSO is longer, but it remains compatible with the operational needs of most practical applications.
Enhancing Manual Order Picking through a New Metaheuristic, Based on Particle Swarm Optimization / Bertolini, Massimo; Mezzogori, D.; Zammori, F.. - In: MATHEMATICS. - ISSN 2227-7390. - 11:14(2023), pp. 1-37. [10.3390/math11143077]
Enhancing Manual Order Picking through a New Metaheuristic, Based on Particle Swarm Optimization
Bertolini Massimo
;Mezzogori D.;Zammori F.
2023
Abstract
This paper proposes a new metaheuristic algorithm called Particle Swarm-based picking time minimization (Pkt_PSO), ideated for picking time minimization in manual warehouses. As the name suggests, Pkt_PSO is inspired by Particle Swarm Optimization (PSO), and it is specifically designed to minimize the picking time in order case picking contexts. To assess the quality and the robustness of Pkt_PSO, it is compared to five alternative algorithms used as benchmarks. The comparisons are made in nine different scenarios obtained by changing the layout of the warehouse and the length of the picking list. The results of the analysis show that Pkt_PSO has a slower convergence rate and suffers less of early stagnation in local minima; this ensures a more extensive and accurate exploration of the solution space. In fact, the solutions provided by Pkt_PSO are always better (or at least comparable) to the ones found by the benchmarks, both in terms of quality (closeness to the overall best) and reliability (frequency with which the best solution is found). Clearly, as more solutions are explored, the computational time of Pkt_PSO is longer, but it remains compatible with the operational needs of most practical applications.File | Dimensione | Formato | |
---|---|---|---|
81_2023_Math_Enhancing Manual Order Picking.pdf
Accesso riservato
Tipologia:
VOR - Versione pubblicata dall'editore
Dimensione
3.4 MB
Formato
Adobe PDF
|
3.4 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris