A Hybrid Greedy Algorithm for the Car Sequencing Problem
A hybrid greedy algorithm integrated with ant colony optimization is proposed to solve the car sequencing problem. The objective is to determine a vehicle sequence that minimizes the violations of sequencing rules on a mixed-model assembly line. Pheromone and heuristic information are used together to choose the car to be added to the end of the partial sequence. Numerical experiments are performed to demonstrate the effectiveness and efficiency of the proposed algorithm.
mixed-model assembly car sequencing problem hybrid greedy algorithm ant colony optimization
Long LIN
School of Mechanical Engineering,Southeast University,Nanjing,China
国际会议
厦门
英文
719-722
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）