An improved simulated annealing–linear programming hybrid algorithm applied to the optimal coordination of directional overcurrent relays

2020 ◽  
Vol 181 ◽  
pp. 106197 ◽  
Author(s):  
Alexandre A. Kida ◽  
Angel E. Labrador Rivas ◽  
Luis A. Gallego
Keyword(s):  
Linear Programming ◽  
Simulated Annealing ◽  
Hybrid Algorithm ◽  
Overcurrent Relays ◽  
Optimal Coordination

FAST ALGORITHMS FOR THERMAL-AWARE FLOORPLANNING

2014 ◽  
Vol 23 (07) ◽  
pp. 1450098 ◽  
Author(s):  
LIN WANG
Keyword(s):  
Genetic Algorithms ◽  
Linear Programming ◽  
Simulated Annealing ◽  
Greedy Algorithm ◽  
Hybrid Method ◽  
Integrated Circuit ◽  
Hybrid Algorithm ◽  
Fast Algorithms ◽  
Thermal Problem ◽  
The Greedy Algorithm

Thermal-aware floorplanning is an effective way to solve the thermal problem in modern integrated circuit (IC) designs. Existing thermal-aware floorplanning methods are all based on simulated annealing (SA), genetic algorithms (GAs) or linear programming (LP), which are quite time-consuming. In this paper, we propose two fast algorithms for thermal-aware floorplanning, a greedy algorithm based on the less-flexibility-first (LFF) principle and a hybrid algorithm combining the greedy algorithm and an SA-based refinement. The greedy algorithm can fast obtain a locally optimized floorplan with reduced area and temperature. The hybrid method can get similar results compared with pure SA-based approaches but it is still much faster.

Sign in / Sign up

Export Citation Format

Share Document