Multi-objective layout optimization of a satellite module using the Wang-Landau sampling method with local search

被引:16
作者
Liu, Jing-fa [1 ,2 ]
Hao, Liang [1 ,2 ]
Li, Gang [3 ]
Xue, Yu [1 ,2 ]
Liu, Zhao-xia [4 ]
Huang, Juan [1 ,2 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Jiangsu Engn Ctr Network Monitoring, Nanjing 210044, Jiangsu, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Comp & Software, Nanjing 210044, Jiangsu, Peoples R China
[3] Nanjing Univ Informat Sci & Technol, Sch Math & Stat, Nanjing 210044, Jiangsu, Peoples R China
[4] Nanjing Univ Informat Sci & Technol, Off Informationizat Construct & Management, Nanjing 210044, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Packing; Layout design; Satellite module; Wang-Landau algorithm; PACKING PROBLEM; DESIGN METHOD; ALGORITHM;
D O I
10.1631/FITEE.1500292
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The layout design of satellite modules is considered to be NP-hard. It is not only a complex coupled system design problem but also a special multi-objective optimization problem. The greatest challenge in solving this problem is that the function to be optimized is characterized by a multitude of local minima separated by high-energy barriers. The Wang-Landau (WL) sampling method, which is an improved Monte Carlo method, has been successfully applied to solve many optimization problems. In this paper we use the WL sampling method to optimize the layout of a satellite module. To accelerate the search for a global optimal layout, local search (LS) based on the gradient method is executed once the Monte-Carlo sweep produces a new layout. By combining the WL sampling algorithm, the LS method, and heuristic layout update strategies, a hybrid method called WL-LS is proposed to obtain a final layout scheme. Furthermore, to improve significantly the efficiency of the algorithm, we propose an accurate and fast computational method for the overlapping depth between two objects (such as two rectangular objects, two circular objects, or a rectangular object and a circular object) embedding each other. The rectangular objects are placed orthogonally. We test two instances using first 51 and then 53 objects. For both instances, the proposed WL-LS algorithm outperforms methods in the literature. Numerical results show that the WL-LS algorithm is an effective method for layout optimization of satellite modules.
引用
收藏
页码:527 / 542
页数:16
相关论文
共 35 条
[1]   A hybrid placement strategy for the three-dimensional strip packing problem [J].
Allen, S. D. ;
Burke, E. K. ;
Kendall, G. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 209 (03) :219-227
[2]   The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon [J].
Bennell, JA ;
Dowsland, KA ;
Dowsland, WB .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (03) :271-287
[3]  
Chen W, 2008, LECT NOTES COMPUT SC, V5227, P742, DOI 10.1007/978-3-540-85984-0_89
[4]   Efficient lower bounds and heuristics for the variable cost and size bin packing problem [J].
Crainic, Teodor Gabriel ;
Perboli, Guido ;
Rei, Walter ;
Tadei, Roberto .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (11) :1474-1482
[5]   A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem [J].
Goncalves, Jose Fernando ;
Resende, Mauricio G. C. .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (02) :180-201
[7]   A short note on a simple search heuristic for the diskspacking problem [J].
Huang, WQ ;
Kang, Y .
ANNALS OF OPERATIONS RESEARCH, 2004, 131 (1-4) :101-108
[8]   Optimal Layout Design of a Satellite Module Using a Coevolutionary Method with Heuristic Rules [J].
Huo, Jun-Zhou ;
Teng, Hong-Fei .
JOURNAL OF AEROSPACE ENGINEERING, 2009, 22 (02) :101-111
[9]  
Jin B, 2007, J SCI IND RES INDIA, V66, P989
[10]   Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts [J].
Khanafer, Ali ;
Clautiaux, Francois ;
Talbi, El-Ghazali .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) :54-63