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

Authors

248

  1. VF
    Vincent F. Yu

    National Taiwan University of Science and Technology, Taiwan

    4 publications · 249 citations

    4

    h-index

  2. RT
    Reza Tavakkoli‐Moghaddam

    University of Tehran, Iran

    4 publications · 302 citations

    4

    h-index

  3. SL
    Shih-Wei Lin

    Chang Gung University, Taiwan

    3 publications · 144 citations

    3

    h-index

  4. NS
    Nima Safaei

    Iran University of Science and Technology, Iran

    3 publications · 245 citations

    3

    h-index

  5. CS
    Carl Sechen

    University of Washington, United States

    3 publications · 392 citations

    3

    h-index

1–5 of 248

Venues

  1. Applied Soft Computing

    5 publications · 238 citations

    5

    h-index

  2. European Journal of Operational Research

    4 publications · 492 citations

    4

    h-index

  3. Mathematical Biosciences & Engineering

    MBE · 2 publications · 32 citations

    2

    h-index

  4. 2

    h-index

  5. International Journal of Production Research

    2 publications · 104 citations

    2

    h-index

1–5