期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A hybrid algorithm based on tabu search and large neighbourhood search for car sequencing problem 被引量:7
1
作者 ZHANG Xiang-yang GAO Liang +1 位作者 WEN Long HUANG Zhao-dong 《Journal of Central South University》 SCIE EI CAS CSCD 2018年第2期315-330,共16页
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.Firs... 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)obtains100best known values out of109public instances,among these89instances get their best known values with100%success rate.By comparing with the well-known related algorithms,computational results demonstrate the effectiveness,efficiency and robustness of the proposed algorithm. 展开更多
关键词 car sequencing problem large neighborhood search tabu search ratio constraint
下载PDF
Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem 被引量:1
2
作者 Xiangyang ZHANG Liang GAO +1 位作者 Long WEN Zhaodong HUANG 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2017年第2期373-384,共12页
For the car sequencing(CS) problem, the draw-backs of the "sliding windows" technique used in the objective function have not been rectified, and no high quality initial solution has been acquired to accelerate th... For the car sequencing(CS) problem, the draw-backs of the "sliding windows" technique used in the objective function have not been rectified, and no high quality initial solution has been acquired to accelerate the improvement of the solution quality. Firstly, the objective function is improved to solve the double and bias counting of violations broadly discussed. Then, a new method combining heuristic with constraint propagation is proposed which constructs initial solutions under a parallel framework. Based on constraint propagation, three filtering rules are designed to intersecting with three greedy functions, so the variable domain is narrowed in the process of the construction. The parallel framework is served to show its robustness in terms of the quality of the solution since it greatly increases the performance of obtaining the best solution. In the computational experiments, 109 instances of 3 sets from the CSPLib' s benchmarks are used to test the performance of the proposed method. Experiment results show that the proposed method outperforms others in acquiring the best-known results for 85 best-known results of 109 are obtained with only one construction. The proposed research provides an avenue to remedy the deficiencies of "sliding windows" technique and construct high quality initial solutions. 展开更多
关键词 Car sequencing problem · Constraint propagation · Parallel construction heuristic · Filtering rule
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部