Research on Circuit Partitioning Algorithm Based on Partition Connectivity Clustering and Tabu Search
In this paper, a circuit-partitioning method is proposed based on partition connectivity clustering and tabu search. It includes four phases: coarsening, initial partitioning, uncoarsening, and refinement. In the initial partitioning phase, the concept of partition connectivity is introduced to opti...
Saved in:
| Main Authors: | Linzi Yin, Hao Hu, Changgeng Li |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-02-01
|
| Series: | Technologies |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7080/13/2/81 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A hybrid genetic tabu search algorithm based on a multi-operation joint movement neighborhood structure for job shop scheduling problems
by: Lei Wang, et al.
Published: (2025-08-01) -
Algorithms for partitioning logical circuits into subcircuits
by: N. A. Kirienko
Published: (2020-09-01) -
Applying the Intelligence of Ant and Tabu Search to Solve The 8-puzzle Problem
by: Ruqaya Sha’ban
Published: (2013-07-01) -
Tabu Search Algorithm for Solving a Location-Routing-Inventory Problem
by: Nova Indah Saragih, et al.
Published: (2024-10-01) -
Genetic algorithm-tabu search for mobile agents measurement scheduling in wireless sensor networks
by: WANG Sheng, et al.
Published: (2008-01-01)