A Real-Time Routing Protocol in Wireless Sensor-Actuator Network

Lu, Yue; Tian, Hui; Yin, Jiajia

doi:10.1007/978-981-13-5907-1_12

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem also gathers attention from researchers in computer science and electronics fields (Ex. [5], [6]). Regardless of the context in which TSP is analyzed, heuristics are the mostly used solution methodology for this problem and there are several heuristics to solve TSP.…”

Section: Introductionmentioning

confidence: 99%

Analysis of TSP: Simulated Annealing and Genetic Algorithm Approaches

Botsalı

Alaykiran

2020

International Journal of Computational and Experimental Science and Engineering

View full text Add to dashboard Cite

This paper analyzes the performance of the popular heuristic methods 'Simulated Annealing (SA)' and 'Genetic Algorithm (GA)' on the symmetric TSP. TSP is a well-known combinatorial optimization problem in NP-complete class. NP-completeness of TSP originates many specific approximation algorithms to find optimal or near optimal solutions in a reasonable time. On the other hand, both SA and GA are general purpose heuristic methods that are applicable to almost every kind of problem whose solution lies inside a search space. The performance of SA and GA depends on many factors such as the nature of the problem, design of the algorithm, parameter values, etc. In this paper, a GA and an SA algorithm are given and their performance with respect to several factors is analyzed. The algorithms are tested on some benchmark problems (TSPLIB) which are obtainable via Internet from

show abstract

Section: Introductionmentioning

confidence: 99%