Fast genetic algorithm for pick-up path optimization in the large warehouse system

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The order-picking processes of fixed shelves in a warehouse system require high speed and efficiency. In this study, a novel fast genetic algorithm was proposed for constrained multi-objective optimization problems. The handling of constraint conditions were distributed to the initial population generation and each genetic process. Combine the constraint conditions and objectives, a new partial-order relation was introduced for comparison of individuals. This novel algorithm was used to optimize the stacker picking path in an Automated Storage/Retrieve System (AS/RS) of a large airport. The simulation results indicates that the proposed algorithm reduces the computational complexity of time and space greatly, and meets the needs of practical engineering of AS/RS optimization control.

Cite

CITATION STYLE

APA

Ma, Y., Li, Z., & Yun, W. (2015). Fast genetic algorithm for pick-up path optimization in the large warehouse system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9142, pp. 38–44). Springer Verlag. https://doi.org/10.1007/978-3-319-20469-7_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free