Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)

In the process of solving the Traveling Salesman Problem (TSP), both Ant Colony Optimization and simulated annealing exhibit different limitations depending on the dataset. This article aims to address these limitations by improving and combining these two algorithms using the clustering method. The...

詳細記述

書誌詳細

出版年:	PeerJ Computer Science
主要な著者:	Tan Hao, Wu Yingnian, Zhang Jiaxing, Zhang Jing
フォーマット:	論文
言語:	英語
出版事項:	PeerJ Inc. 2023-10-01
主題:	k-Medoids algorithm The ant colony algorithm The simulated annealing algorithm 2-opt operator Logistics and transportation
オンライン･アクセス:	https://peerj.com/articles/cs-1609.pdf