Using Ant Colony Algorithm to Optimize Assembly Line Balancing Problem  

Oleh:

Muttaqin, Hilman ; Jambak, Muhammad Ikhwan

Jenis: Article from Proceeding
Dalam koleksi: APCOMS 2009: The 2nd Asia-Pacific Conference on Manufacturing System: Reconfigurable Manufacturing System for Facing Turbulent Manufacturing Environment, November 4th-5th, 2009, Yogyakarta, Indonesia, page VI.31-35.
Topik: Ant Colony Optimization; Assembly Line Balancing; SALBP; Local Search; Number Of Workstation Optimization;
Fulltext: APCOMS G6-5.pdf (127.24KB)

Isi artikel

In this research, the Ant Colony Optimization (ACO) algorithm has been developed to minimize the efficiency of an assembly line problem. The efficiency of an assembly line is a parameter which defines a degree of balance of load work among workstations. The algorithm enhanced by two types of local search procedures, i.e. (i) reduce number of workstation, and (ii) unite two different workstations. In addition, the algorithm is assured to fulfill two problems constraints; the cycle time constraint and predecessor-successor constraint. Several tests showed that the simulation has given similar minimum number of workstation result from the manual calculation of Simple Assembly Line Balancing Problem (SALBP).

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali