Simulated Annealing Routing
Simulated Annealing Routing is a routing optimization method that employs a probabilistic search algorithm inspired by the annealing process in metallurgy to iteratively refine route configurations by accepting suboptimal solutions with controlled probability, thereby escaping local minima in the search for a near-optimal global solution.
104
Publications
5K
Citations
248
Authors
139
Institutions
Publications per year
2017–2026
29
Parents
104
1–5 of 104
248
National Taiwan University of Science and Technology, Taiwan
4 publications · 249 citations
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 248
139

University of Tehran
Tehran, Iran
6 h-index
10 publications
603 citations

Iran University of Science and Technology
Tehran, Iran
5 h-index
6 publications
373 citations
National Taiwan University of Science and Technology
Taipei, Taiwan
4 h-index
10 publications
625 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
299 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
632 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
72 citations
University of California San Diego
San Diego, United States
2 h-index
3 publications
81 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
2 h-index
4 publications
50 citations
1–8 of 139
5 publications · 238 citations
5
h-index
4 publications · 492 citations
4
h-index
MBE · 2 publications · 32 citations
2
h-index
2 publications · 256 citations
2
h-index
2 publications · 104 citations
2
h-index
1–5