A heuristic non-dominated sorting genetic algorithm-II for satellite-module layout optimisation Online publication date: Fri, 16-Jul-2010
by Y. Xu, C. Li, Y.J. Shi, H.F. Teng
International Journal of Computer Applications in Technology (IJCAT), Vol. 38, No. 1/2/3, 2010
Abstract: This paper proposes a Heuristic Non-dominated Sorting Genetic Algorithm-II (HNSGA-II) to solve alayout optimisation problem such as that of satellite-modules. Firstly, we apply a diversity degree method to evaluate the dominance (or inferiority) of solutions in the same front instead of the crowding-distance method. Secondly, a filter technique of a Pareto solution set is introduced to preserve the elite individuals more effectively. Thirdly, three kinds of operators are adopted to improve search performance. Finally, we give two heuristic layout strategies in the optimisation process. The numerical experiments of a simplified satellite-module layout design show the feasibility and the effectiveness of the proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com