Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods

In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result in...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Algorithms Ročník 15; číslo 2; s. 64
Hlavní autori: Sharma, Shalini, Chou, Jerry
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.02.2022
Predmet:
Algorithms
Apexes
Computation
Evolution
graph partitioning
Graphs
incremental algorithm
Partitioning
Simulation
time-evolving graphs
Traveling salesman problem
ISSN:1999-4893, 1999-4893
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TSP tour is computed from the previous result instead of the whole graph. In our current work, we have mapped the TSP problem to three partitioning methods named vertex size attribute, edge attribute, and k-means; then, we compared the TSP tour results. We have also examined the effect of increasing the number of partitions on the total computation time. Through our experiments, we have observed that the vertex size attribute performs the best because of a balanced number of vertices in each partition.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a15020064