Reactive max-min ant system with recursive local search and its application to TSP and QAP
Ant colony optimization is a successful metaheuristic for solving combinatorial optimization problems. However, the drawback of premature exploitation arises in ant colony optimization when coupled with local searches, in which the neighborhood’s structures of the search space are not completely...
Main Authors: | Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2016
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/18475/1/IASC%202016%201-8.pdf |
Similar Items
-
Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches
by: Sagban, Rafid, et al.
Published: (2015) -
Reactive memory model for ant colony optimization and its application to TSP
by: Sagban, Rafid, et al.
Published: (2014) -
Unified strategy for intensification and diversification balance in ACO metaheuristic
by: Sagban, Rafid, et al.
Published: (2017) -
Nature-inspired parameter controllers for ACO-based reactive search
by: Sagban, Rafid, et al.
Published: (2015) -
Ant-based sorting and ACO-based clustering approaches: A review
by: Jabbar, Ayad Mohammed, et al.
Published: (2018)