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...

Full description

Bibliographic Details
Main Authors: Wong, Kuan Yew, See, Phen Chiak
Format: Article
Published: Elsevier, The Netherlands 2009
Subjects:
Online Access:http://eprints.utm.my/8750/
_version_ 1848891758749941760
author Wong, Kuan Yew
See, Phen Chiak
author_facet Wong, Kuan Yew
See, Phen Chiak
author_sort Wong, Kuan Yew
building UTeM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T21:03:04Z
format Article
id utm-8750
institution Universiti Teknologi Malaysia
institution_category Local University
last_indexed 2025-11-15T21:03:04Z
publishDate 2009
publisher Elsevier, The Netherlands
recordtype eprints
repository_type Digital Repository
spelling utm-87502022-04-29T21:53:51Z http://eprints.utm.my/8750/ A new minimum pheromone threshold strategy (MPTS) for max-min ant system Wong, Kuan Yew See, Phen Chiak TJ Mechanical engineering and machinery 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. Elsevier, The Netherlands 2009 Article PeerReviewed Wong, Kuan Yew and See, Phen Chiak (2009) A new minimum pheromone threshold strategy (MPTS) for max-min ant system. Applied Soft Computing, 9 (3). pp. 882-888. ISSN 1568-4946 http://dx.doi.org/10.1016/j.asoc.2008.11.011 doi:10.1016/j.asoc.2008.11.011
spellingShingle TJ Mechanical engineering and machinery
Wong, Kuan Yew
See, Phen Chiak
A new minimum pheromone threshold strategy (MPTS) for max-min ant system
title A new minimum pheromone threshold strategy (MPTS) for max-min ant system
title_full A new minimum pheromone threshold strategy (MPTS) for max-min ant system
title_fullStr A new minimum pheromone threshold strategy (MPTS) for max-min ant system
title_full_unstemmed A new minimum pheromone threshold strategy (MPTS) for max-min ant system
title_short A new minimum pheromone threshold strategy (MPTS) for max-min ant system
title_sort new minimum pheromone threshold strategy (mpts) for max-min ant system
topic TJ Mechanical engineering and machinery
url http://eprints.utm.my/8750/
http://eprints.utm.my/8750/
http://eprints.utm.my/8750/