Wong, Kuan Yew and Komarudin, - (2008) Ant Colony Optimization in Solving Facility Layout Problems. In: International Conference on Mechanical & Manufacturing Engineering (ICME 2008), 21â€“ 23 May 2008, Johor Bahru.
Full text not available from this repository.
Ant Colony Optimization (ACO) is a young metaheuristic algorithm which has experienced rapid developments and applications in many areas. With its strength as a discrete oriented metaheuristic, it has become one of the successful algorithms for solving Combinatorial Optimization Problem (COP). One of the COP's areas which has been solved successfully with ACO is Facility Layout Problem (FLP). ACO has been reported as the current state of art for solving this problem. Unfortunately, the application of ACO in FLP is primarily limited to Quadratic Assignment Problem (QAP) and its variations. This paper examines the applications of ACO in FLP published in the literature. It then shows an opportunity to expand ACO applications to other types of FLPs.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||T Technology > T Technology (General)|
|Deposited By:||PM Dr Mohd Azman Zainul Abidin|
|Deposited On:||17 Dec 2008 03:42|
|Last Modified:||17 Dec 2008 03:42|
Repository Staff Only: item control page