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

被引：22
|
作者：
Wong, Kuan Yew [1 ]
See, Phen Chiak [1 ]
机构：
[1] Univ Teknol Malaysia, Fac Mech Engn, Dept Ind & Mfg Engn, Skudai 81310, Malaysia
来源：
APPLIED SOFT COMPUTING | 2009年 / 9卷 / 03期
关键词：
Metaheuristics; Combinatorial optimization; Ant colony optimization (ACO); Max-min ant system (MMAS); QUADRATIC ASSIGNMENT PROBLEM; COLONY OPTIMIZATION; ALGORITHMS; SWARM;
D O I：
10.1016/j.asoc.2008.11.011
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：882 / 888
页数：7
相关论文
共 50 条
  • [1] MEMORY OPTIMIZED PHEROMONE STRUCTURES FOR MAX-MIN ANT SYSTEM
    Behalek, Marek
    Surkovsky, Martin
    Meca, Ondrej
    Bohm, Stanislav
    NEURAL NETWORK WORLD, 2015, 25 (02) : 161 - 174
  • [2] MAX-MIN Ant System
    Stützle, T
    Hoos, HH
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2000, 16 (08): : 889 - 914
  • [3] Extension of Max-Min Ant System with Exponential Pheromone Deposition Rule
    Acharya, Ayan
    Maiti, Deepyaman
    Banerjee, Aritra
    Janarthanan, R.
    Konar, Amit
    ADCOM: 2008 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATIONS, 2008, : 1 - +
  • [4] A max-min ant system algorithm with εMAX selection
    Ogawa, Masato
    Li, Lei
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2008, 11 (04): : 467 - 471
  • [5] On MAX-MIN ant system's parameters
    Pellegrini, Paola
    Favaretto, Daniela
    Moretti, Elena
    ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2006, 4150 : 203 - 214
  • [6] On the Explorative Behavior of MAX-MIN Ant System
    Favaretto, Daniela
    Moretti, Elena
    Pellegrini, Paola
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2009, 5752 : 115 - 119
  • [7] MAX-MIN Ant System in Image Preprocessing
    Laptik, R.
    Navakauskas, D.
    ELEKTRONIKA IR ELEKTROTECHNIKA, 2009, (01) : 21 - 24
  • [8] Max-Min Ant System with Linear Memory Complexity
    Kovarik, Oleg
    Kordik, Pavel
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [9] Protein structure calculation with a max-min ant system
    J Gimmler
    W Gronwald
    H Möller
    TE Exner
    Chemistry Central Journal, 3 (Suppl 1)
  • [10] A technique for improving the Max-Min Ant System algorithm
    See, Phen Chiak
    Wong, Kuan Yew
    Komarudin
    2008 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING, VOLS 1-3, 2008, : 863 - 866
12345