基于禁忌搜索和大邻城搜索的混合算法求解车辆排序问题

摘要

The car sequencing problem (CSP) concerns a production sequence of different types of cars in the mixed-model assembly line. A hybrid algorithm is proposed to find an assembly sequence of CSP with minimum violations. Firstly, the hybrid algorithm is based on the tabu search and large neighborhood search (TLNS), servicing as the framework. Moreover, two components are incorporated into the hybrid algorithm. One is the parallel constructive heuristic (PCH) that is used to construct a set of initial solutions and find some high quality solutions, and the other is the small neighborhood search (SNS) which is designed to improve the new constructed solutions. The computational results show that the proposed hybrid algorithm (PCH+TLNS+SNS) obtains 100 best known values out of 109 public instances, among these 89 instances get their best known values with 100% success rate. By comparing with the well-known related algorithms, computational results demonstrate the effectiveness, efficiency and robustness of the proposed algorithm.%汽车排序问题涉及混流装配线上由多种车型组成的一个加工序列,一个混合算法用以搜索违约数最小的序列.该混合算法以禁忌搜索和大邻域搜索为算法框架,结合了两个组件以提高算法性能.一个是平行构建启发式方法,构建一系列初解用于选择高质量的解,另一个是小邻域搜索,进一步改进新解的质量.计算结果显示,针对109个问题的公共测试集,该算法得到100个已知最好解,89个问题得到最好解的成功率是100%.结果表明,与知名相关算法比较,该算法具有有效性、高效率和鲁棒性.