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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.