Phen, Chiak See and Wong, Kuan Yew and Komarudin, - (2008) A technique for improving the Max-Min Ant System algorithm. In: Proceedings of the International Conference on Computer and Communication Engineering 2008, ICCCE08: Global Links for Human Development, 13-15th May 2008, Kuala Lumpur, Malaysia.
Restricted to Repository staff only
Official URL: http://dx.doi.org/10.1109/ICCCE.2008.4580728
In recent years, various metaheuristic approaches have been created to solve Quadratic Assignment Problems (QAPs). Among others is the Ant Colony Optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. Although it has solved some QAPs successfully, it still contains some weaknesses and is unable to solve large QAP instances effectively. Thereafter, various suggestions have been made to improve the performance of the ACO algorithm. One of them is through the development of the Max-Min Ant System (MMAS) algorithm. In this paper, a discussion will be given on the working structure of MMAS and its associated weaknesses or limitations. A new strategy that could further improve the search performance of MMAS will then be presented. Finally, the results of an experimental evaluation conducted to evaluate the usefulness of this new strategy will be described.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||ant colony optimization, distributed algorithms, max-min ant system algorithm, metaheuristic approaches, quadratic assignment problems|
|Subjects:||T Technology > TJ Mechanical engineering and machinery|
|Divisions:||Chemical and Natural Resources Engineering (Formerly known)|
|Deposited By:||Maznira Sylvia Azra Mansor|
|Deposited On:||09 Jan 2009 00:27|
|Last Modified:||01 Jun 2010 15:53|
Repository Staff Only: item control page