Abstract
A multi-objective mathematical model and an improved Genetic Algorithm (GA) are formulated for storage location assignment of the fixed rack system. According to the assignment rules, the optimization aim is to maximize the storage/retrieval efficiency and to keep the stability of the rack system. The improved GA with Pareto optimization and Niche Technology are developed. The approach considers Pareto solution sets with the traditional operators, while the Niche Technology distributes the solutions uniformly in Pareto solution sets. The realization of the approach ensures storage location assignment optimization and offers a dynamic decision making scheme for automated storage and retrieval system (AS/RS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hsieh, S., Tsai, K.C.: A BOM oriented class-based storage assignment in an automated storage / retrieval systems. Int. J. Adv. Manuf. Technol. 17, 683–691 (2001)
Thonemann, U.W., Brandeau, M.L.: Optimal storage assignment policies for automated storage and retrieval systems with stochastic demands. Management Science 44(1), 142–148 (1998)
Ulungu, E.L., Teghem, J., Fortemps, P.H., et al.: MOSA method: a tool for solving multi-objective combinatorial optimization problems. Journal of Multi-criteria Decision Analysis 8, 221–236 (1999)
Thierens, P., Bosman, D.: The balance between proximity and diversity in multi-objective Evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7(2), 174–188 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, Q., Zhang, Y., Ma, Z. (2010). Optimization of Storage Location Assignment for Fixed Rack Systems. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-16515-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16514-6
Online ISBN: 978-3-642-16515-3
eBook Packages: Computer ScienceComputer Science (R0)