Cooperative Parallel Tabu Search for Capacitated Network Design
Journal of Heuristics
A first multilevel cooperative algorithm for capacitated multicommodity network design
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Explicit and Emergent Cooperation Schemes for Search Algorithms
Learning and Intelligent Optimization
Evolutionary algorithms for VLSI multi-objective netlist partitioning
Engineering Applications of Artificial Intelligence
A cooperative multilevel tabu search algorithm for the covering design problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
| Hi-index | 0.03 |
The objectives in this paper are twofold: design an approach for the netlist partitioning problem using the cooperative multilevel search paradigm introduced by Toulouse et al. and study the effectiveness of this paradigm for solving combinatorial optimization problems, in particular, those arising in the very large scale integration (VLSI) computer-aided design (CAD) area. The authors present a cooperative multilevel search algorithm CoMHP and describe a parallel implementation on the SGI O2000 system. Experiments on ISPD98 benchmark suite of circuits show, for four-way and eight-way partitioning, a reduction of 3% to 15% in the size of hyperedge cuts compared to those obtained by hMETIS. Bisections of hypergraphs based on the algorithm also outperform hMETIS, although more modestly. The authors present experimental results to demonstrate that the cooperation scheme plays a key role in the performance of CoMHP. In fact, the improvement in the quality of the solutions produced by CoMHP is to a large extent independent of the partitioners used in the implementation of CoMHP. The experimental results also demonstrate the effectiveness of the cooperative multilevel search paradigm for solving the netlist partitioning problem