A new minimum pheromone threshold strategy (MPTS) for max-min ant system

Authors:
Kuan Yew Wong;Phen Chiak See
Affiliations:
Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, 81310 UTM Skudai, Malaysia;Department of Manufacturing and Industrial Engineering, Faculty of Mechanical Engineering, Universiti Teknologi Malaysia, 81310 UTM Skudai, Malaysia
Venue:
Applied Soft Computing
Year:
2009

Citing 10
Cited 6

Heuristics for a new model of facility layout

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Ant algorithms for discrete optimization

Artificial Life
MAX-MIN Ant system

Future Generation Computer Systems
Parallel ant colonies for the quadratic assignment problem

Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Ant Colony Optimisation for Machine Layout Problems

Computational Optimization and Applications
Ant colony optimization theory: a survey

Theoretical Computer Science
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment

Applied Soft Computing
Ant colony optimization with hill climbing for the bandwidth minimization problem

Applied Soft Computing

Short Communication: Solving facility layout problems using Flexible Bay Structure representation and Ant System algorithm

Expert Systems with Applications: An International Journal
An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem

Applied Soft Computing
Swarm intelligence algorithms parameter tuning

AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Generic Cabling of Intelligent Buildings Based on Ant Colony Algorithm

International Journal of Software Science and Computational Intelligence
Two-steps learning of Fuzzy Cognitive Maps for prediction and knowledge discovery on the HIV-1 drug resistance

Expert Systems with Applications: An International Journal
An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.