DocumentCode :
2650229
Title :
Ant Algorithm with Summation Rules for Assembly Line Balancing Problem
Author :
Ze-qiang, ZHANG ; Wen-ming, CHENG ; Lian-sheng, TANG ; Bin, ZHONG
Author_Institution :
Southwest Jiaotong Univ., Chengdu
fYear :
2007
fDate :
20-22 Aug. 2007
Firstpage :
369
Lastpage :
374
Abstract :
An improved ant colony optimization with pheromone summation rules is proposed to solve type 1 of the simple assembly line balancing problem (SALBP-1). The proposed algorithm makes use of the trail information which is deposited between the task and the task selected position, and pheromone summation rules is adopted. The heuristic information is set to the position weight for tasks of SALBP-1, which synthesis consider processing time of the task and the number of successors. A new nonlinear objective function is used to instead of the function of number of workstations. The proposed algorithm is tested and compared with literature test problems, the result indicated the validity of the proposed algorithms.
Keywords :
assembly planning; optimisation; ant colony optimization; assembly line balancing problem; nonlinear objective function; pheromone summation rules; Ant colony optimization; Assembly; Conference management; Constraint optimization; Engineering management; Mass production; Mechanical engineering; Optimization methods; Testing; Workstations; ant colony optimization; assembly line balancing; heuristics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Management Science and Engineering, 2007. ICMSE 2007. International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-7-88358-080-5
Electronic_ISBN :
978-7-88358-080-5
Type :
conf
DOI :
10.1109/ICMSE.2007.4421875
Filename :
4421875
Link To Document :
بازگشت