返回
A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem
DOI:10.1016/j.knosys.2013.12.011.png)
摘要
En 中文
In this paper, a novel fruit fly optimization algorithm (nFOA) is proposed to solve the semiconductor final testing scheduling problem (SFTSP). First, a new encoding scheme is presented to represent solutions reasonably, and a new decoding scheme is presented to map solutions to feasible schedules. Second, it uses multiple fruit fly groups during the evolution process to enhance the parallel search ability of the FOA. According to the characteristics of the SFTSP, a smell-based search operator and a vision-based search operator are well designed for the groups to stress exploitation. Third, to simulate the information communication behavior among fruit flies, a cooperative search process is developed to stress exploration. The cooperative search process includes a modified improved precedence operation crossover (IPDX) and a modified multipoint preservative crossover (MPX) based on two popular structures of the flexible job shop scheduling. Moreover, the influence of the parameter setting is investigated by using Taguchi method of design-of-experiment (DOE), and suitable values are determined for key parameters. Finally, computational tests results with some benchmark instances and the comparisons to some existing algorithms are provided, which demonstrate the effectiveness and the efficiency of the nFOA in solving the SFTSP. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Fruit fly optimization algorithm
Smell-based search
Vision-based search
Cooperative search
Semiconductor final testing scheduling problem
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
Operando mechanistic studies of selective oxidation of glycerol to dihydroxyacetone over amorphous cobalt oxide在无定形氧化钴上甘油选择性氧化为二羟基丙酮的机理研究
Fruit fly optimization algorithm based fractional order fuzzy-PID controller for electronic throttle
A new Fruit Fly Optimization Algorithm: Taking the financial distress model as an example一种新的果蝇优化算法 -- 以财务困境模型为例

