论文部分内容阅读
针对带有阻塞(blocking)限制的流水车间调度问题,将分散搜索与变邻域搜索结合起来,提出了分散变邻域搜索算法。在算法中提出了基于工件块的复合邻域及其搜索方法,该邻域的规模可以根据工件块的大小动态变化,从而实现局域搜索与广域搜索的平衡。此外,提出用分散搜索的参考集来存储算法搜索过程中得到的质量与分散性较好的解,每次迭代过程中变邻域搜索的初始解均从该集合中产生。使用标准测试问题对所提出的混合算法进行了测试,并与已有文献中的较好算法进行了比较,结果验证了所提出的分散变邻域搜索算法的有效性。
Aiming at the problem of flowshop scheduling with blocking constraints, we combine decentralized search with variable neighborhood search and propose a decentralized and variable neighborhood search algorithm. In the algorithm, a composite neighborhood based on a piece of work piece and its searching method are proposed. The size of the neighborhood can dynamically change according to the size of a piece of work piece, so as to balance the local search with the wide area search. In addition, a decentralized reference set is proposed to store the solutions of good quality and decentralization obtained in the algorithm search process. The initial solutions of variable neighborhood search in each iteration are generated from the set. The proposed hybrid algorithm is tested using standard test problems and compared with the better algorithms in the existing literature. The results verify the validity of the proposed distributed variable neighborhood search algorithm.