Discrete komodo algorithm for traveling salesman problem

Jati, Gilang Kusuma; Kuwanto, Garry; Hashmi, Tahir; Widjaja, Herman

doi:10.1016/j.asoc.2023.110219

Cited by 9 publications

(2 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, some other swarm intelligence algorithms have also been proposed for solving traveling salesman problems. Some of these algorithms are as follows: chicken swarm optimization [26], grey wolf optimizer [27], Jaya algorithm [2], bat algorithm [28], social spider algorithm [29], sparrow search algorithm [30], earthworm optimization algorithm [31], and Komodo algorithm [32]. These studies show that traveling discrete optimization algorithms based on swarm intelligence still attract the attention of researchers.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A New Approach Based on Collective Intelligence to Solve Traveling Salesman Problems

Kiran,

Beskirli

2024

Biomimetics

View full text Add to dashboard Cite

This paper presents a novel approach based on the ant system algorithm for solving discrete optimization problems. The proposed method is based on path construction, path improvement techniques, and the footprint mechanism. Some information about the optimization problem and collective intelligence is used in order to create solutions in the path construction phase. In the path improvement phase, neighborhood operations are applied to the solution, which is the best of the population and is obtained from the path construction phase. The collective intelligence in the path construction phase is based on a footprint mechanism, and more footprints on the arc improve the selection chance of this arc. A selection probability is also balanced by using information about the problem (e.g., the distance between nodes for a traveling salesman problem). The performance of the proposed method has been investigated on 25 traveling salesman problems and compared with state-of-the-art algorithms. The experimental comparisons show that the proposed method produced comparable results for the problems dealt with in this study.

show abstract

Section: Introductionmentioning

confidence: 99%

“…They also stated that they obtained good solutions by comparing the same method with other algorithms in the literature. Jati et al [32] proposed the discrete Komodo algorithm (DKA) for solving the TSP. They compared the performance of the proposed DKA method with some state-of-theart algorithms and classical algorithms.…”

Section: Introductionmentioning

confidence: 99%