Ant Colony Hyper-heuristics for Travelling Salesman Problem
Metaheuristics are capable of producing good quality solutions. However, they often need to perform some adjustment of relevant parameters in order to be applied to new problems or different problem instances. Furthermore, they often are time-consuming and knowledge intensive procedures that require...
Main Authors: | Aziz, Z.A (Author), Miskon M.F (Author), Yussof H. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier B.V.
2015
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
Similar Items
-
Ant Colony Hyper-heuristics for Travelling Salesman Problem
by: Abd Aziz, Z
Published: (2015) -
Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
by: Bib Paruhum Silalahi, et al.
Published: (2019-10-01) -
A Novel Heuristic Communication Heterogeneous Dual Population Ant Colony Optimization Algorithm
by: Mingle Xu, et al.
Published: (2017-01-01) -
The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities
by: Jamshid Salehi Sadaghiani
Published: (2010-10-01) -
Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB
by: Kalaipriyan Thirugnanasambandam, et al.
Published: (2019-08-01)