A Hybrid Pso and Shuffled Complex Evolution Algorithm for Order Assignment Problem in Holonic Manufacturing System

Article Preview

Abstract:

Today’s market dynamics have made operation process in manufacturing system extremely complex and difficult. Enterprise need to continuous adjust its strategies on evaluating and designing their task and order assignment methods to provide products at the lowest possible cost while reducing the total lead time. The evaluation model based on Holonic Manufacturing System is presented in this paper. The model incorporates operation cost and lead time as the object. A hybrid PSO algorithm with Shuffled Complex Evolution Algorithm(SCE) is utilized to compute the combination optimum for Order assignment problem . Simulation result shows that the model and the algorithm are effective to the problem.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 97-101)

Pages:

2213-2216

Citation:

Online since:

March 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhang Yingfeng, Jiang Pingyu and Huang George: International Journal of Materials and Product Technology Vol. 33(2008), p.170.

Google Scholar

[2] G.D. Sivakumar and P. Shahabudeen: International Journal of Advanced Manufacturing Technology Vol. 38(2008), p.321.

Google Scholar

[3] G. Anand, Kodali Rambabu: Journal of Manufacturing Technology Management Vol. 20 (2009), p.258.

Google Scholar

[4] Arumugam Veeri, Ooi Keng-Boon and Fong Tuck-Chee: TQM Journal Vol. 20 (2008), p.636.

Google Scholar

[5] Information on http: /hms. ifw. uni. hannover. de.

Google Scholar

[6] Bal Mert, Hashemipour Majid: Robotics and Computer-Integrated Manufacturing Vol. 25(2009), p.570.

Google Scholar

[7] Pan Quan-Ke, Wang Ling, Fatih. M. Tasgetiren, et al: International Journal of Advanced Manufacturing Technology Vol. 38(2008), p.337.

Google Scholar

[8] Q.Y. Duan, V.K. Gupta, S. Sorooshian: Journal of Optimization Theory and Applications, 76(1993), p.501 Best rate(100%) HPSO GA Enumeration Best 855 843 829 Mean 838 834 798 Maximum 820 825 766 CPU time 21. 23" 49. 00" 1529. 0.

Google Scholar