针对模糊作业车间调度问题(Fuzzy job-shop scheduling problem,FJSSP),提出一种结合化学反应优化和禁忌搜索的混合算法(Chemical-reaction optimization and tabu search,CROTS),优化的目标是最小化最大模糊完工时间.算法采用基于工序的编码,通过扩展壁面碰撞、分子碰撞、合成、分解等操作算子,改进了基本化学反应优化(Chemical-reaction optimization,CRO)的四类基元反应.给出一种有效的交叉算子,并应用到分子碰撞、合成、分解三种基元反应中.对最好解进行禁忌搜索,进一步提高种群的搜索能力.结合16个经典算例试验分析,并与三种典型算法比较,验证算法具有较强的全局和局部搜索能力.通过18个随机算例的测试,验证算法具备求解较大规模问题的能力.
A hybrid algorithm combining chemical-reaction optimization and tabu search (CROTS) for solving the fuzzy job-shop scheduling problem (FJSSP) is investigated. The objective is to minimize the fuzzy makespan, i.e., the maximum fuzzy completion time. In the hybrid algorithm, encoding mechanism is realized through an operation sequence based way. Four improved Chemical-reaction optimization (CRO) collisions are embedded in the proposed algorithm, i.e., on-wall collision, inter-molecule collision, synthesis, and decomposition. An efficient crossover operator is designed and applied into the three elementary collisions, i.e., inter-molecule collision, synthesis, and decomposition. TS based local search is embedded to perform exploitation for the best molecule, which enhances the search ability of the algorithm. The proposed algorithm is tested on the sixteen well-known benchmark instances. Through the comparisons with other three present algorithms, the highly effective performance in exploration and exploitation capability of the proposed CROTS algorithm is concluded. Through the tests on eighteen randomly generated instances, the capability of CROTS for solving large scale problems is verified.