EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Remora optimization algorithm-based adaptive fusion via ant colony optimization for traveling salesman problem

Lin Piao

Computer Science and Information Systems · 2024 · 21 (4) · 1651-1672

DOI: 10.2298/csis240314052p ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computer Science and Information Systems, 2024. Verfasst von Lin Piao. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The traditional ant colony optimization (ACO) is easy to fall into local optimal when solving large-scale traveling salesman problem (TSP), and the convergence speed is slow. In order to enhance the local search ability of ACO, speed up the efficiency of ACO and avoid the premature problem, this paper proposes a novel remora optimization algorithm-based adaptive fusion via ant colony optimization for solving TSP. Firstly, an improved K-means clustering method is used to obtain the best clustering results and the optimal solutions of each class quickly by adaptive clustering strategy based on the maximum and minimum distance and class density. By using an improved Remora optimization algorithm, adjacent classes are fused to effectively improve the accuracy of the initial solution. In addition, the initial solution is optimized by the k-opt strategy. Finally, the random recombination strategy is used to recombine the pheromone and random excitation to make the algorithm jump out of the local optimal as far as possible and improve the accuracy of the algorithm. The experimental results show that the proposed algorithm not only guarantees the accuracy of solution, but also improves the stability when solving large-scale TSP.

Zitieren

APA

Piao, L. (2024). Remora optimization algorithm-based adaptive fusion via ant colony optimization for traveling salesman problem. Computer Science and Information Systems, 21(4), 1651-1672. https://doi.org/10.2298/csis240314052p

Vancouver

Piao L. Remora optimization algorithm-based adaptive fusion via ant colony optimization for traveling salesman problem. Computer Science and Information Systems. 2024;21(4):1651-1672. doi:10.2298/csis240314052p

BibTeX
@article{Piao2024,
  author = {Piao, Lin},
  title = {Remora optimization algorithm-based adaptive fusion via ant colony optimization for traveling salesman problem},
  journal = {Computer Science and Information Systems},
  year = {2024},
  volume = {21},
  number = {4},
  pages = {1651--1672},
  doi = {10.2298/csis240314052p}
}
Kostenlos starten →