A new minimum pheromone threshold strategy (MPTS) for max-min ant system
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 w...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Elsevier, The Netherlands
2009
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/8750/ http://dx.doi.org/10.1016/j.asoc.2008.11.011 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|