求解置换流水线调度问题的混合离散果蝇算法_郑晓龙.pdfVIP

31 2 Vol. 31 No. 2 2014 2 Control Theory Applications Feb. 2014 DOI: 10.7641/CTA.2014.30675 , , ( , 100084) : , . 4: . , ; , ; , ; , . , , . , . : ; ; ; : TP18 : A A hybrid discrete fruit fly optimization algorithm for solving permutation flow-shop scheduling problem ZHENG Xiao-long, WANG Ling , WANG Sheng-yao (Department of Automation, Tsinghua University, Beijing 100084, China) Abstract: To solve the permutation flow-shop scheduling problem (PFSP), we propose a novel hybrid discrete fruit fly optimization algorithm (HDFOA). Each generation of evolution in the algorithm contains four search stages: smell-based search, vision-based search, co-evolutionary search and annealing procedure. In the smell-based search stage, an insertion operator is adopted to produce neighbors. In the vision-based search stage, the individuals are replaced by their best neighbors. In the co-evolutionary search stage, the guiding individuals are produced based on the differential information among fruit flies. In the annealing procedure, the best guiding fruit flies are accepted according to certain acceptance probabilities for updating the population. Moreover, the effect from parameter setting is analyzed by using the experiment design method, and a combination of suitable parameter values is determined. Finally, simulation results and comparisons based on the benchmark testing sets demonstrate the effectiveness and robustness of the proposed algorithm. Key words: permutation flow-shop scheduling; discrete fruit fly optimization algorithm; co-