Optimization Algorithm Study for Multiple-Constrained and Multiple-Objective Job-Shop Tool Dynamic Distribution

Article Preview

Abstract:

It’s an NP problem for distributing tools for job-shop tasks when the schedules were formulated, and it belongs to multiple-constrained and multiple-objective problem. Based on adaptive weight approach, the restriction and multiple objective problems were solved. The optimization dynamic distribution model for this problem was established. Then heuristic and self-adaptive genetic algorithm was presented. In order to express the dynamic of the distribution result, Two-dimensional coding technology was adopted, a new coding rule combining dispatching rule was designed. The results show that hybrid self-adaptive genetic algorithm based on adaptive weight approach forms well for multiple-constrained and multiple-objective job-shop tool dynamic distribution.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

612-616

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Xuan Guangnan, Chen Runwei. Genetic Algorithms and Engineering Optimization[M]. Beijing: Tsinghua University Press, 2004, 76~100.

Google Scholar

[2] Ding Wuxue, Gong Guangrong, Wang Shuanghu, etc. The Dynamic Tools Planning Management for FMS[J]. Ordance Industry Automation . 2001, 20(4): 6~10.

Google Scholar

[3] He Jianyong. Optimization Methods[M]. Beijing: Tsinghua University Press, 2005. 417~461.

Google Scholar

[4] Yang Pingfan, Zhang Changshui. Artificial neural network simulation Evolutionary Computation[M]. Beijing: Tsinghua University Press, 2005. 550~606.

Google Scholar

[5] Wang Yuexuan, Liu Lianchen, MU Shengjing, etc . Constrained multi-objective optimization evolutionary algorithm [J]. Journal of Tsinghua University (Science and Technology) , 2005, 45(1): 103~106.

Google Scholar

[6] ByungJooPark. A hybrid genetic algorithm for the job shop scheduling problems[J], Computers& Industrial Engineering, 2003, 45: 597~613.

DOI: 10.1016/s0360-8352(03)00077-9

Google Scholar