一类解决无等待流水车间调度问题的蚁群算法.pdfVIP

13 9 计算机集成制造系统 Vol. 13 No.9 2 0 0 7 9 Computer Integrated Manufacturing Systems Sep. 2 0 07 : 100 - 5911( 2007) 09- 1801- 04 1, 2 1 1 3 , , , ( 1. , 23002 ; 2. , 252059; 3. , 100083) : , , O( n) ; , ; , ; , , : ; ; : T P278 : A Antcolony heuristic algorithm for nowait flow shop problem with makespan criterion 1, 2 1 1 3 PA N Qua nke , ZH A O B aohua , Q U Yug ui , B I Yuh ui ( 1. School of Information Science Technology , University of Science Technology of China, Hefei 23002 , China; 2. School of Computer Science, Liaocheng University, Liaocheng 252059, China; 3. School of Information, Beijing Forestry University, Beijing 100083, China) Abstract: An antcolony heurist ic algorit hm was proposed for the NoWait Flow Shop problem ( NWFS) w ith makespan criterion. Firstly, a speedup method w ith the computational complexity O( n) w as developed to calculate the makespan of a permutation. Secondly, a permutat ion w as constructed according to trail intensities and solution best so far, and a local search based on multi insert, which performed several insert s simultaneously in a single iter ation of algorithm, was em ployed to im prove makespan of t he permutat ion. Finally , computational tests based on the w ell known benchmark suites in the literature w ere conducted, and the comput ational result s showed t hat the presented algorithm was effective in finding opt imal or nearoptimal solut ions. Key words: now ait flow shop problem; makespan; antcolony heuristic algorithm