2020
DOI: 10.1109/access.2020.2980135
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Simulated Annealing Algorithm With Excessive Length Penalty for Fixed-Outline Floorplanning

Abstract: In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which optimizes the area, the total wirelength, and the prescribed outline constraints at the same time. In order to enhance the effectiveness of SA algorithm, we propose a novel feasible solution strategy which ensures that viable solution would be found at all tim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…In formula (8), T(D) is the set of all nodes in the DAG graph of disease D. en, the contribution of disease d to the semantic value of D is expressed as follows:…”
Section: Similarity Calculation Of Obesitymentioning
confidence: 99%
See 1 more Smart Citation
“…In formula (8), T(D) is the set of all nodes in the DAG graph of disease D. en, the contribution of disease d to the semantic value of D is expressed as follows:…”
Section: Similarity Calculation Of Obesitymentioning
confidence: 99%
“…Sun et al [ 7 ] used simulated annealing algorithm to optimize the Kriging agent model, so as to realize the crashworthiness optimization of the automobile front end structure. Huang et al [ 8 ] proposed an improved simulated annealing algorithm to deal with the fixed contour plane planning problem of modern buildings. The results show that the algorithm can achieve 100% success rate in any benchmark.…”
Section: Introductionmentioning
confidence: 99%
“…This process of generation is iterated until an equilibrium is achived and the reduction in the temperature parameter is visualized. Furthermore, the temperature of the sucessive annealing step 𝑇 𝑁𝑒𝑤 is calculated based on the geometric annealing schedule by multiplying the temperature of the current iteration 𝑇 𝐶𝑢𝑟𝑟𝑒𝑛𝑡 with the factor of cooling 𝛼 (generally lies between 0.8 and 0.99) for the reducing the temperature as depicted in Equation (14).…”
Section: Adoption Of Novel Solution Generation Processmentioning
confidence: 99%
“…Physics-based optimization algorithms have been developed based on the simulation of various laws and phenomena in physics. One of the oldest algorithms in this group is Simulated Annealing (SA), which is inspired by the simulation of the annealing process by melting and cooling operations in metallurgy [17,18]. Simulation of the gravitational force that objects exert on each other at different distances has led to the design of a Gravitational Search Algorithm (GSA) [19].…”
Section: Introductionmentioning
confidence: 99%