Genetic Algorithm for Production Order Picking Schedule in an AGV-Based FMS

Abstract:

Article Preview

This paper discussed production order picking schedule problem in AGV-based FMS. A general formulation of production order picking schedule mode is suggestion with objective of minimizing the order picking time and the number of AGVs. Based on the analysis that the relationship between our problem and the standard VRP, we design a genetic algorithm (GA) to solve the mode. Computational experiment is conducted and excellent computational results comparison with other method indicates that the genetic algorithm proposed in this paper is suitable for production order picking problem.

Info:

Periodical:

Edited by:

Qi Luo

Pages:

283-287

DOI:

10.4028/www.scientific.net/AMM.20-23.283

Citation:

D. Q. Chen "Genetic Algorithm for Production Order Picking Schedule in an AGV-Based FMS", Applied Mechanics and Materials, Vols. 20-23, pp. 283-287, 2010

Online since:

January 2010

Authors:

Export:

Price:

$38.00

[1] R.L. Daniels, J.L. Rummel and R. Schantz: A model for warehouse order picking. European Journal of Operational Research Vol. 105 (1998), pp.1-17.

DOI: 10.1016/s0377-2217(97)00043-x

[2] Y. Seo and P.J. Egbelu: Integrated manufacturing planning for an AGV-based FMS. International Journal of Production Economics Vol. 60-61 (1999), pp.473-478.

DOI: 10.1016/s0925-5273(98)00185-6

[3] P.H. Koo, J. Jang: Vehicle travel time models for AGV systems under various dispatching rules. International Journal of Flexible Manufacturing Systems Vol. 14 (2002), pp.249-261.

[4] C.W. Kim, J.M.A. Tanchoco, P.H. Koo: AGV dispatching based on workload balancing. International Journal of Production Research Vol. 37 (1999), pp.4053-4066.

DOI: 10.1080/002075499189925

[5] M.O. Ball, in: Vehicle Routing: Methods and Studies, edited by A. Assad and B. Golden, Elsevier Science Publishers, New York, NY (1988).

[6] A. Reese: Random number generators in genetic algorithms for unconstrained and constrained optimization. Nonlinear Analysis (2008), doi: 10. 1016/j. na. 2008. 11. 084.

[7] H. Maaranen, K. Miettinen and M.M. Mäkelä: Quasi-random initial population for genetic algorithms. Computers & Mathematics with Applications Vol. 47 (2004), pp.1885-1895.

DOI: 10.1016/j.camwa.2003.07.011

[8] G. Syswerda: Schedule optimization using genetic algorithms, in: Handbook of Genetic Algorithms, edited by L. Davis, Van Nostrand Reinhold, New York(1991), pp.332-349.

In order to see related information, you need to Login.