Picking Route Optimization of Automated Warehouse Based on Improved Genetic Algorithms

Article Preview

Abstract:

In order to improve the efficiency of automated warehouse, the order-picking task of the fixed shelve was researched and analysed. The picking mathematical model of automated warehouse was established and attributed to the classical traveling salesman problem (TSP) model. At the same time, using an improved genetic algorithms(improved GAs) solved the optimization problem. Firstly, the initial population of the algorithm was optimized, and then a 'reverse evolution operator' was introduced in the improved genetic algorithms because of the lack of local optimization ability of genetic algorithm. Results of experiments verify that the method can acquire satisfying the demands of the route picking and optimization of speed.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2694-2697

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Guohui Tian, Pan Zhang, Xiaolei Li: Acta Simulata Systematica Sinica, 2004, 6: 024. In Chinese.

Google Scholar

[2] Sanjun Wei, Beizhi Li, Zhijun Lv: Computer Simulation, 2011(12): 0204-04. In Chinese.

Google Scholar

[3] Guohui Tian, Pan Zhang: Chinese journal of mechanical engineering, 2004; 10(2): 141-144. In Chinese.

Google Scholar

[4] Agnetis A: International Journal of Flexible Manufacturing Systems, 1996; 8(2) : 131- 157.

Google Scholar

[5] Long Pang, Jingui Lu: Computer Engineering&Science 2012; 34(3): 148-151. In Chinese.

Google Scholar

[6] Kees JR, Iris FAV: European Journal of Operational Research, 2009; 3(2): 142-149.

Google Scholar

[7] Yingjie Lei, Shanwen Zhang, Xuwu Li: Xidian University Publication, 2005. In Chinese.

Google Scholar

[8] Haichang Gao, Boqin Feng, Li Zhu: Control and Decision, 2006; 21(03): 241-252. In Chinese.

Google Scholar