DocumentCode
3251673
Title
A hybrid greedy algorithm for the car sequencing problem
Author
Lin, Long
Author_Institution
Sch. of Mech. Eng., Southeast Univ., Nanjing, China
fYear
2010
fDate
29-31 Oct. 2010
Firstpage
719
Lastpage
722
Abstract
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.
Keywords
assembling; automobile industry; greedy algorithms; optimisation; vehicles; ant colony optimization; car sequencing problem; greedy algorithm; heuristic information; mixed-model assembly line; pheromone; vehicle sequence; Complexity theory; Europe; ant colony optimization; car sequencing problem; hybrid greedy algorithm; mixed-model assembly;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Engineering Management (IE&EM), 2010 IEEE 17Th International Conference on
Conference_Location
Xiamen
Print_ISBN
978-1-4244-6483-8
Type
conf
DOI
10.1109/ICIEEM.2010.5646520
Filename
5646520
Link To Document