A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems

Purpose – The purpose of this paper is to find a global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems.Design/methodology/approach – To represent some real design considerations, a new concept of semi‐free hypergraphs is proposed and a method to apply semi‐free hypergraphs to the decomposition of complex design problems based on optimal models is also suggested. On this basis, the limited K‐partitioning problem of semi‐free hypergraphs and its partitioning objective for the optimal design of complex machines is presented. A global method based on genetic algorithms, GALKP, for the limited K‐partitioning of semi‐free hypergraphs is also proposed. Finally, a case study is presented in detail.Findings – Semi‐free hypergraphs are a more powerful tool to map a complex engineering design problem. The decomposition of complex design problems may be converted to a limited K‐partitioning problem of semi‐free hypergraphs. The algorithm presented ...

[1]  Shashi Shekhar,et al.  Partitioning Similarity Graphs: A Framework for Declustering Problems , 1996, Inf. Syst..

[2]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[3]  Andrew B. Kahng,et al.  Hypergraph partitioning with fixed vertices , 1999, DAC '99.

[4]  Andrew B. Kahng,et al.  Hypergraph partitioning with fixed vertices [VLSI CAD] , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Santanu Chaudhury,et al.  Genetic Algorithm for Node Partitioning Problem and Applications in VLSI Design , 1993 .

[6]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[7]  Marc Schoenauer,et al.  Genetic algorithms for partitioning air space , 1994, Proceedings of the Tenth Conference on Artificial Intelligence for Applications.

[8]  Pinaki Mazumder,et al.  Genetic multiway partitioning , 1995, Proceedings of the 8th International Conference on VLSI Design.

[9]  Byung Ro Moon,et al.  A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs , 1994, 31st Design Automation Conference.

[10]  Terrance Carl Wagner,et al.  A general decomposition methodology for optimal system design. , 1993 .

[11]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning , 1995 .

[12]  Cao Rui.  Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows , 2002 .

[13]  Kishan G. Mehrotra,et al.  Genetic algorithms for graph partitioning and incremental graph partitioning , 1994, Proceedings of Supercomputing '94.

[14]  Youssef Saab,et al.  Fast effective heuristics for the graph bisectioning problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Ioannis G. Karafyllidis,et al.  Genetic partitioning and placement for VLSI circuits , 1999, ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357).

[16]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[18]  S.-P. Chan,et al.  A new and efficient partitioning algorithm: genetic partitioning , 1991, [1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems.

[19]  Panos Y. Papalambros,et al.  A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems , 1997, Comput. Optim. Appl..

[20]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[21]  Yi Lin,et al.  Fundamental structure of general systems and its relation to knowability of the physical world , 1997 .

[22]  Shoucheng OuYang,et al.  Blown‐up theory of evolution science and fundamental problems of the first push , 2001 .

[23]  Andrew B. Kahng,et al.  Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning , 1993, 30th ACM/IEEE Design Automation Conference.

[24]  Shoucheng OuYang,et al.  Infrastructural analysis and restriction in the evolution of weather systems , 2000 .