Pareto and niche genetic algorithm for storage location assignment optimization problem

3rd International Conference on Innovative Computing Information and Control, ICICIC'08

Volumn , Issue , 2008, Pages

  Li, Meijuan ^a,b   Chen, Xuebo ^c   Liu, Chenqi ^b  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

^b ANSHAN NORMAL UNIVERSITY   (China)

^c LIAONING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED WAREHOUSES; CLASS-BASED; CROSSOVER AND MUTATION; DATA SETS; IMPROVED GENETIC ALGORITHM; INTERNATIONAL CONFERENCES; MULTI OBJECTIVES; NICHE GENETIC ALGORITHM; NICHE TECHNIQUES; OPERATIONAL EFFICIENCIES; OPTIMIZ ATION PROBLEMS; ORDER-PICKING; PARETO SOLUTIONS; PARETO-OPTIMIZATION; PICKING EFFICIENCY; REAL-LIFE PROBLEMS; STORAGE LOCATION; STORAGE SPACES; STORAGE/RETRIEVAL;

ALGORITHMS; DATA STORAGE EQUIPMENT; DIESEL ENGINES; GENETIC ALGORITHMS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; PACKET NETWORKS; PARETO PRINCIPLE;

SET THEORY;

EID: 52449115908     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICIC.2008.655     Document Type: Conference Paper

References (14)

1. I. Potrc, T. Lerher, J. Kramberger, and M. Sraml. "Simulation of multi-shuttle automated storage and retrieval systems," Journal of Materials Technology 157-158, pp.236-244, 2004.
2. Ya-hong Hu, Shell Ying Huang, and Chuanyu Chen. "Travel time analysis of a new automated storage and retrieval system," Computers & Operations Research, vol. 32, no.6 pp. 1515-1544, 2005.
3. E. Frazelle, World-class Warehousing and Material Handling. McGraw-Hill, New York, USA. 2002.
4. W.H. Hausman, L.B. Schwarz and S.C., Graves, "Optimal storage assignment in automatic warehousing systems," Management Science, vol. 22, no.6, pp.629-638.1976.
5. J. L. Heskett, "Cube-per-order index: a key to warehouse stock location", Transportation and Distribution Management, vol.3, no.4, pp.27-31, 1963.
6. M. Goetschalckx, and H.D. Ratliff, Shared storage policies based on the duration stay of unit loads. Management Science, vol. 34, no.9, pp.1120-1132, 1990.
7. S. Hsieh and K.-C. Tsai, "A BOM Oriented Class-Based Storage Assignment in an Automated Storage/Retrieval System," Int J Adv ManufTechnol, vol.17, no.9, pp. 683-691, 2001.
8. P. N. Poulos, G. G. Rigatos, S.G. Tzafestas, "A Pareto-optimal genetic algorithm for warehouse multi-objective optimization," Engineering Applications of Artificial Intelligence, vol. 14, no.6, pp.737-749, 2001.
9. V.R. Muppani, and G.K. Adil, "A branch and bound algorithm for class based storage location assignment," European Journal of Operational Research, pp.1-15, 2007.
10. D.E.Goldberg, Genetic algorithm in search.Optimization and machine learning.MA:Addison Wesley, 1989.
11. S. Baskar, J.P. Subbera, M.V.C. Rao, "Hybrid real coded genetic algorithm solution to economic dispatch problem," Computers and Electrical Engineering, vol.29, no.3, pp.407-419, 2003.
12. Y.W. Leung, Y. Wang, "Multiobjective programming using uniform design and genetic algorithm," IEEE Transactions on Systems, Man and Cybernetics-Part C, vol. 30, no.3, pp. 293-304, 2000.
13. E. Zitzler, L. Thiele, "Multi-objective evolutionary algorithms: A comparative case study and the strength Pareto approach," IEEE Transactions on Evolutionary Computation, vol.3, no.4 pp.257-271, 1999.
14. P. Thierens, D. Bosman, "The balance between proximity and diversity in multi-objective evolutionary algorithms," IEEE Transactions on Evolutionary Computation, vol.7, no.2, pp.174-188, 2003.