All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Adaptive Ant Colony Optimization with node clustering applied to the Travelling Salesman Problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG42__%2F23%3A00557902" target="_blank" >RIV/60162694:G42__/23:00557902 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989592:15510/22:73613034

  • Result on the web

    <a href="http://www.elsevier.com/wps/find/journaldescription.cws_home/724666/description#description" target="_blank" >http://www.elsevier.com/wps/find/journaldescription.cws_home/724666/description#description</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.swevo.2022.101056" target="_blank" >10.1016/j.swevo.2022.101056</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Adaptive Ant Colony Optimization with node clustering applied to the Travelling Salesman Problem

  • Original language description

    This article presents the Ant Colony Optimization algorithm to solve the Travelling Salesman Problem. The proposed algorithm implements three novel techniques to enhance the overall performance, lower the execution time and reduce the negative effects particularly connected with ACO-based methods such as falling into a local optimum and issues with settings of control parameters for different instances. These techniques include (a) the node clustering concept where transition nodes are organised in a set of clusters, (b) adaptive pheromone evaporation controlled dynamically based on the information entropy and (c) the formulation of the new termination condition based on the diversity of solutions in population. To verify the effectiveness of the proposed principles, a number of experiments were conducted using 30 benchmark instances (ranging from 51 to 2,392 nodes with various nodes topologies) taken from the well-known TSPLIB benchmarks and the results are compared with several state-of-the-art ACO-based methods; the proposed algorithm outperforms these rival methods in most cases. The impact of the novel techniques on the behaviour of the algorithm is thoroughly analysed and discussed in respect to the overall performance, execution time and convergence.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Swarm and Evolutionary Computation

  • ISSN

    2210-6502

  • e-ISSN

    2210-6510

  • Volume of the periodical

    70

  • Issue of the periodical within the volume

    April 2022

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    101056

  • UT code for WoS article

    000780758500003

  • EID of the result in the Scopus database

    2-s2.0-85126141002