Let G = （V, E） be a complete undirected graph with vertex set V, edge set E, and edge weights I（e） satisfying the triangle inequality. The vertex set V is partitioned into clusters V1, V2 ,…, Vk. The clustered tr...Let G = （V, E） be a complete undirected graph with vertex set V, edge set E, and edge weights I（e） satisfying the triangle inequality. The vertex set V is partitioned into clusters V1, V2 ,…, Vk. The clustered traveling salesman problem （CTSP） seeks to compute the shortest Hamiltonian tour that visits all the vertices, in which the vertices of each cluster are visited consecutively. A two-level genetic algorithm （TLGA） was developed for the problem, which favors neither intra-cluster paths nor inter-cluster paths, thus realized integrated evolutionary optimization for both levels of the CTSP. Results show that the algorithm is more effective than known algorithms. A large-scale traveling salesman problem （TSP） can be converted into a CTSP by clustering so that it can then be solved by the algorithm. Test results demonstrate that the clustering TLGA for large TSPs is more effective and efficient than the classical genetic algorithm.展开更多
Wireless sensor network(WSN)technologies have advanced significantly in recent years.With in WSNs,machine learning algorithms are crucial in selecting cluster heads(CHs)based on various quality of service(QoS)metrics....Wireless sensor network(WSN)technologies have advanced significantly in recent years.With in WSNs,machine learning algorithms are crucial in selecting cluster heads(CHs)based on various quality of service(QoS)metrics.This paper proposes a new clustering routing protocol employing the Traveling Salesman Problem(TSP)to locate the optimal path traversed by the Mobile Data Collector(MDC),in terms of energy and QoS efficiency.To bemore specific,to minimize energy consumption in the CH election stage,we have developed the M-T protocol using the K-Means and the grid clustering algorithms.In addition,to improve the transmission phase of the Low Energy Adaptive Clustering-Grid-KMeans(LEACH-G-K)protocol,the MDC is employed as an intermediary between the CH and the sink to improve the wireless sensor network(WSN)QoS.The results of the experiment demonstrate that the M-T protocol enhances various Low Energy Adaptive Clustering protocol(LEACH)improvements such as the LEACH-G-K,LEACH-C,Threshold sensitive Energy Efficient Sensor Networks(TEEN),MDC maximum residual energy leach protocol.展开更多
文摘Let G = （V, E） be a complete undirected graph with vertex set V, edge set E, and edge weights I（e） satisfying the triangle inequality. The vertex set V is partitioned into clusters V1, V2 ,…, Vk. The clustered traveling salesman problem （CTSP） seeks to compute the shortest Hamiltonian tour that visits all the vertices, in which the vertices of each cluster are visited consecutively. A two-level genetic algorithm （TLGA） was developed for the problem, which favors neither intra-cluster paths nor inter-cluster paths, thus realized integrated evolutionary optimization for both levels of the CTSP. Results show that the algorithm is more effective than known algorithms. A large-scale traveling salesman problem （TSP） can be converted into a CTSP by clustering so that it can then be solved by the algorithm. Test results demonstrate that the clustering TLGA for large TSPs is more effective and efficient than the classical genetic algorithm.
基金supported by the Ministry of Education of the Republic of Korea and the National Research Foundation of Korea(NRF-2023S1A5C2A07096111).
文摘Wireless sensor network(WSN)technologies have advanced significantly in recent years.With in WSNs,machine learning algorithms are crucial in selecting cluster heads(CHs)based on various quality of service(QoS)metrics.This paper proposes a new clustering routing protocol employing the Traveling Salesman Problem(TSP)to locate the optimal path traversed by the Mobile Data Collector(MDC),in terms of energy and QoS efficiency.To bemore specific,to minimize energy consumption in the CH election stage,we have developed the M-T protocol using the K-Means and the grid clustering algorithms.In addition,to improve the transmission phase of the Low Energy Adaptive Clustering-Grid-KMeans(LEACH-G-K)protocol,the MDC is employed as an intermediary between the CH and the sink to improve the wireless sensor network(WSN)QoS.The results of the experiment demonstrate that the M-T protocol enhances various Low Energy Adaptive Clustering protocol(LEACH)improvements such as the LEACH-G-K,LEACH-C,Threshold sensitive Energy Efficient Sensor Networks(TEEN),MDC maximum residual energy leach protocol.
