Water Flow-like Optimization Algorithm for Job-shop Scheduling Problems

• Main Authors: Ching-Yu Hsieh, 謝景宇
• Other Authors: Feng-Cheng Yang
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/46724552607442327165

碩士 === 國立臺灣大學 === 工業工程學研究所 === 100 === This research propose a technique which is using the level property of precedence constraints of job-shop scheduling problems to process the evolution, and use machining-sequence coding method to improve the efficiency of evolution, furthermore, develop a system which is using the water flow-like algorithm to solve the job-shop scheduling problems(WFA4JSP). Water flow-like algorithm is a modern innovative algorithm which is imitating the concept of water flow on the ground. The main characteristics of water flow-like algorithm is dynamically adjusting the number of solution agents, and using splitting, merging, evaporation, and precipitation operators to process the evolution. Instead of using the traditional operation sequence coding method which often cause a waste of re-search, this research using machining-sequence coding method to improve the efficiency of evolution and combining with the operation precedence constraints of job-shop scheduling problems and the machining-operation precedence constraints which is formed by using machining-sequence coding method to develop a partial machine based precedence level operation reallocated method to execute splitting operator. Compared with the “Added to the superior segments and subtracted from inferior segments ant system” and “A two-stage PSO” method, under the same stop criterion, the results show WFA4JSP can find the best solution of most small complexity problems, and the relative deviation value of large complexity problems are comparable.