Article ID: | iaor20001762 |
Country: | Netherlands |
Volume: | 114 |
Issue: | 2 |
Start Page Number: | 430 |
End Page Number: | 436 |
Publication Date: | Apr 1999 |
Journal: | European Journal of Operational Research |
Authors: | Teng Hongfei, Feng Enmin, Wang Xilu, Wang Xiumei |
Keywords: | global optimization, packing |
The two-dimensional layout problem is known to be NP-complete, and the current research work is basically in the heuristic way. In this paper, we mainly discuss the methods for solving layout problem for the artificial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented for the first time. The method given here can be extended to solve other types of layout problems.