Stepwise-overlapped parallel annealing and its application to floorplan designs (Q756935): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Joseph Frédéric Bonnans / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Joseph Frédéric Bonnans / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:08, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stepwise-overlapped parallel annealing and its application to floorplan designs |
scientific article |
Statements
Stepwise-overlapped parallel annealing and its application to floorplan designs (English)
0 references
1991
0 references
The authors propose a parallel version of the simulated annealing algorithm. They use the idea of decomposition by Markov chains, i.e. the Markov chain used in the simulated annealing algorithm is truncated and decomposed into subchains, each of them being associated to a processor. They discuss the strategy for reducing the temperature and give encouraging numerical results on the travelling salesman problem. They also apply the algorithm to the floorplan design of VLSI circuits.
0 references
global optimization
0 references
combinatorial optimization
0 references
parallel computation
0 references
simulated annealing algorithm
0 references
numerical results
0 references
travelling salesman problem
0 references
floorplan design of VLSI circuits
0 references
