Using genetic algorithms for order batching in multi-parallel-aisle picker-to-parts systems Online publication date: Mon, 26-Oct-2020
by Jose Alejandro Cano; Alexander Correa-Espinal; Rodrigo Gómez-Montoya
International Journal of Applied Decision Sciences (IJADS), Vol. 13, No. 4, 2020
Abstract: This article aims to introduce a metaheuristic to solve the order batching problem in multi-parallel-aisle warehouse systems to minimise the travelled distance. The proposed metaheuristic is based on an item-oriented genetic algorithm (GA) using a new chromosome representation where a gen represents a customer order to guarantee feasibility in the mutation operator, decreasing the correction of chromosomes generated by the crossover operator, and avoiding the calculation of the minimum number of feasible batches. When comparing the performance of the proposed algorithm with the first-come-first-served (FCFS) rule in 360 instances, we found average savings of 11% (up to 24%) in travelled distance and 2% (up to 17%) in the number of batches. The proposed algorithm can be easily integrated into a warehouse management system (WMS) to provide significant savings in travelled distances, increasing the efficiency of order-picking operations, and reducing the consumption of energy sources required by picking devices.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook