Junhua Xiong
School of Mechanical Engineering and Automation, Beihang University, Beijing, 100191, China
Ting Ling Wang
North China University of Water Conservancy and Electric Power, Zhengzhou, 450011, China
Chao Yun
School of Mechanical Engineering and Automation, Beihang University, Beijing, 100191, China
ABSTRACT
In order to improve the storage efficiency and the space utilization, the optimization strategy of storage location of the automated pharmacy was researched according to irregular features of storage spaces.The improved chaotic particle swarm algorithm was proposed to solve the storage location optimization problem by using the ergodicity and randomness of chaotic motion for mathematical model of storage spaces. Simulation results showed that the algorithm got rid of the shortcomings that the Particle Swarm Optimization was easy to fall into of the local extreme point in late stages, while kept the rapidity in early search. The algorithm improved the efficiency of intelligent storage system, implemented intensive storage, which provided a theoretical basis and practical way to the optimization of irregular allocation of storage space of intelligent storage system in automated pharmacy.
PDF References Citation
How to cite this article
Junhua Xiong, Ting Ling Wang and Chao Yun, 2013. Optimization of Storage Location of Automated Pharmacy Based on Chaotic Particle
Swarm Algorithm. Information Technology Journal, 12: 3378-3381.
DOI: 10.3923/itj.2013.3378.3381
URL: https://scialert.net/abstract/?doi=itj.2013.3378.3381
DOI: 10.3923/itj.2013.3378.3381
URL: https://scialert.net/abstract/?doi=itj.2013.3378.3381
REFERENCES
- Byung, C.P., D.F. Robert and H.F. Edward, 2006. Performance of miniload systems with two-class storage. Eur. J. Operational Res., 170: 144-155.
CrossRef - Kennedy, J. and R. Eberhart, 1995. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Volume 4, November 27-December 1, 1995, Perth, WA., pp: 1942-1948.
CrossRef - Muppani, V.R. and G.K. Adil, 2008. A branch and bound algorithm for class based storage location assignment. Eur. J. Operational Res., 189: 492-507.
CrossRef - Poulos, P.N., G.G. Rigatos, S.G. Tzafestas and A.K. Koukos, 2001. A Pareto-optimal genetic algorithm for warehouse multi-objective optimization. Eng. Appl. Artificial Intell., 14: 737-749.
CrossRef - Thonemann, U.V. and M.L. Brandeau, 1998. Optimal storage assignment policies for automated storage and retrieval systems with stochastic demands. Manage. Sci., 44: 142-148.
Direct Link - Van den Berg, J.P. and W.H.M. Zijm, 1999. Models for warehouse management: Classification and examples. Int. J. Prod. Econ., 59: 519-528.
CrossRef