An algorithm of global optimization for solving layout problems

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 about the artificial satellite module by virtue of graph theory and group theory. Also, an algorithm...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 1999-04, Vol.114 (2), p.430-436
Hauptverfasser:	Feng, Enmin, Wang, Xilu, Wang, Xiumei, Teng, Hongfei
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Artificial satellites Equivalent relation Exact sciences and technology Isomorphism Operational research and scientific management Operational research. Management science Operations research Optimal algorithm Optimization. Search problems Packing Studies Symmetry group
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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 about the artificial satellite module by virtue of graph theory and group theory. Also, an algorithm of global optimization is presented first time. The method given here can be extended to solve other type of layout problems.
ISSN:	0377-2217 1872-6860
DOI:	10.1016/S0377-2217(98)00011-3