基于偏好排序淘汰NSGAII算法的短波網(wǎng)絡(luò)多區(qū)域重點(diǎn)覆蓋優(yōu)化方法
doi: 10.11999/JEIT161172
基金項(xiàng)目:
國(guó)家自然科學(xué)基金(61571192)，廣東省公益研究(2015A010103003)
Multi-areas Outstanding Covering Optimization Method of HF Network Based on Preference Ranking Elimination NSGAII Algorithm
Funds:
The National Natural Science Foundation of China (61571192), The Public Welfare Research Project of Guangdong Province (2015A010103003)
-
摘要: 在采用偏好NSGAII算法求解多子區(qū)域重點(diǎn)覆蓋的短波網(wǎng)絡(luò)頻率優(yōu)化指配時(shí)，針對(duì)算法中非支配排序耗時(shí)較多的問(wèn)題，該文提出一種偏好排序淘汰的NSGAII算法。在進(jìn)行非支配排序前，根據(jù)解的偏好評(píng)價(jià)排序結(jié)果淘汰一部分偏好評(píng)價(jià)較差的解，減少參與非支配排序的解的數(shù)量從而減少求解時(shí)間，同時(shí)降低偏好評(píng)價(jià)結(jié)果較差的個(gè)體解被選中進(jìn)行交叉、變異的概率，提高算法的求解效率和求解效果。在進(jìn)行的48組數(shù)據(jù)測(cè)試中，該文算法在其中38組決策解偏好評(píng)價(jià)結(jié)果和求解時(shí)間同時(shí)最優(yōu)，相同迭代次數(shù)時(shí)相比偏好NSGAII算法節(jié)省27%的求解時(shí)間。結(jié)果表明通過(guò)偏好排序淘汰機(jī)制的引入，更好利用了偏好信息，使算法用較少的時(shí)間求得更好的偏好解。
-
關(guān)鍵詞:
- 短波網(wǎng)絡(luò) /
- 頻率指配 /
- 多目標(biāo)優(yōu)化 /
- 非支配排序 /
- 偏好排序淘汰
Abstract: This paper proposes a preference ranking elimination NSGAII algorithm to deal with the time-consuming issue of the preference NSGAII algorithm in optimizing HF network frequency assignment in multi-areas outstanding coverage. The proposed algorithm sorts and eliminates solutions according to their preference evaluation priori to the non-dominate sorting. By eliminating solutions with low ranking, the number of solutions participates in non-dominate sorting is reduced. The calculation time and the probability of selecting low ranking individuals for crossover or mutation are both decreased. The proposed algorithm simultaneously achieves the best performance and least calculation time in 38 of 48 sets experiments. Constrained with the same iteration number, the proposed algorithm saves 27% of computation time against the preference NSGAII algorithm. Experimental results show that by adopting preference evaluation sorting, the proposed algorithm takes less time and obtains a better solution. -
王俊江, 柳文, 焦培南. 基于返回散射探測(cè)和干擾監(jiān)測(cè)的短波通信實(shí)時(shí)選頻系統(tǒng)[J]. 電子學(xué)報(bào), 2012, 40(4): 729-733. doi: 10.3969/j.issn.0372-2112.2012.04.017. WANG Junjiang, LIU Wen, and JIAO Peinan. Real-time frequency selection system in HF communication based on backscatter sounding and interference monitoring[J]. Acta Electronica Sinica, 2012, 40(4): 729-733. doi: 10.3969/j.issn. 0372-2112.2012.04.017. BAYNAT B, PROUVEZ R, KHALIFE H, et al. Modlisation dun mcanisme de prise de ligne dans les rseaux de communication HF[J]. European Psychiatry, 2015, 28(8): 42-46. 景淵, 李栓紅, 楊峰, 等. 短波IP網(wǎng)絡(luò)中速率自適應(yīng)與SR- ARQ性能分析[J]. 系統(tǒng)工程與電子技術(shù), 2013, 35(1): 184-190. doi: 10.3969/j.issn.1001-506X.2013.01.31. JING Yuan , LI Shuanhong, YANG Feng, et al. Performance analysis of rate adaptation and SR-ARQ in high frequency IP network[J]. Systems Engineering Electronics, 2013, 35(1): 184-190. doi: 10.3969/j.issn.1001-506X.2013.01.31. 朱振飛, 劉毅敏, 吳永宏, 等. 短波網(wǎng)動(dòng)態(tài)頻率管理系統(tǒng)的狀態(tài)查詢(xún)?cè)O(shè)計(jì)[J]. 電波科學(xué)學(xué)報(bào), 2013, 28(3): 65-69. doi: 10.13443/j.cjors.2013.03.016. ZHU Zhenfei, LIU Yimin, WU Yonghong, et al. A method of link status inquiry for HF network dynamic frequency management[J]. Chinese Journal of Radio Science, 2013, 28(3): 65-69. doi: 10.13443/j.cjors.2013.03.016. 李新超, 賀前華, 李艷雄, 等. 基于互信息擴(kuò)散蟻群算法的短波頻率優(yōu)化指配[J]. 華中科技大學(xué)學(xué)報(bào)(自然科學(xué)版), 2016, 44(4): 6-11. doi: 10.13245/j.hust.160402. LI Xinchao, HE Qianhua, LI Yanxiong, et al. HF frequency assignment based on ant colony algorithm utilizing mutual information pheromone diffusion[J]. Huazhong University of Science and Technology (Natural Science Edition), 2016, 44(4): 6-11. doi: 10.13245/j.hust.160402. 楊青彬, 余毅敏, 郭馬坤, 等. 大區(qū)域網(wǎng)絡(luò)化應(yīng)急短波通信中的頻率管理方法[J]. 電訊技術(shù), 2013(4): 470-475. doi: 10 .3969/j.issn.1001-893x.2013.04.019. YANG Qingbin, YU Yimin, GUO Makun, et al. Frequency management methods for large regional network of emergency HF communication[J]. Telecommunication Engineering, 2013(4): 470-475. doi: 10.3969/j.issn.1001-893x. 2013.04.019. 公茂果, 焦李成, 楊咚咚, 等. 進(jìn)化多目標(biāo)優(yōu)化算法研究[J]. 軟件學(xué)報(bào), 2009, 20(2): 271-289. doi: 10.3724/SP.J.1001. 2009.03483. GONG Maoguo, JIAO Licheng, YANG Dongdong, et al. Research on evolutionary multi-objective optimization algorithms[J]. Journal of Software, 2009, 20(2): 271-289. doi: 10.3724/SP.J.1001.2009.03483. KHARE V, YAO X, and DEB K. Performance Scaling of Multi-objective Evolutionary Algorithms[M]. Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg, 2015: 376-390. HU Jianjie, YU Guo, ZHENG Jinhua, et al. A preference-based multi-objective evolutionary algorithm using preference selection radius[J]. Soft Computing, 2016: 1-27. doi: 10.1007/s00500-016-2099-9. 鞏敦衛(wèi), 王更星, 孫曉燕. 高維多目標(biāo)優(yōu)化問(wèn)題融入決策者偏好的集合進(jìn)化優(yōu)化方法[J]. 電子學(xué)報(bào), 2014, 42(5): 933-939. doi: 10.3969/j.issn.0372-2112.2014.05.015. GONG Dunwei, WANG Gengxing, and SUN Xiaoyan. Set-based evolutionary optimization algorithms integrating decision-maker's preferences for many-objective optimization problems[J]. Acta Electronica Sinica, 2014, 42(5): 933-939. doi: 10.3969 /j.issn.0372-2112.2014.05.015. MOLINA J, SANTANA L V, HERNANDEZ-DIAZ A G, et al. g-dominance: Reference point based dominance for multiobjective metaheuristics[J]. European Journal of Operational Research, 2009, 197(2): 685-692. doi: 10.1016/j.ejor.2008.07.015. LIU Ruochen, SONG Xiaolin, FANG Lingfen, et al. An r-dominance-based preference multi-objective optimization for many-objective optimization[J]. Soft Computing, 2016: 1-22. doi: 10.1007/s00500-016-2098-x. WANG S, ALI S, YUE T, et al. UPMOA: An improved search algorithm to support user-preference multi-objective optimization[C]. IEEE 26th International Symposium on Software Reliability Engineering, Gaithersbury, MD, USA, 2015: 393-404. doi: 10.1109/ISSRE.2015.7381833. DEB Kalyanmoy, and KUMAR Abhishek. Interactive evolutionary multi-objective optimization and decision- making using reference direction method[C]. Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, 2007: 788-802. doi: 10.1145/1276958. 1277116. 曾三友, 李暉, 丁立新, 等. 基于排序的非劣集合快速求解算法[J]. 計(jì)算機(jī)研究與發(fā)展, 2004, 41(9): 1565-1571. ZENG Sangou LI Hui, DING Lixin, et al. A fast algorithm for finding non-dominated set based on sorting[J]. Journal of Computer Research and Development, 2004, 41(9): 1565-1571. ZHANG X, TIAN Y, CHENG R, et al. An efficient approach to non-dominated sorting for evolutionary multi-objective optimization[J]. IEEE Transactions on Evolutionary Computation, 2015, 19(2): 201-213. doi: 10.1109/TEVC. 2014.2308305. YAN Z, ZHANG L, RAHMAN T, et al. Prediction of the HF ionospheric channel stability based on the modified ITS model[J]. IEEE Transactions on Antennas and Propagation, 2013, 61(6): 3321-3333. doi: 10.1109/TAP.2013.2249571. ZITZLER E and THIELE L. Multi-objective evolutionary algorithms: A comparative case study and the strength pareto approach[J]. IEEE Transactions on Evolutionary Computation, 1999, 3(4): 257-271. doi: 10.1109/4235.797969. -
計(jì)量
- 文章訪(fǎng)問(wèn)數(shù): 1349
- HTML全文瀏覽量: 104
- PDF下載量: 411
- 被引次數(shù): 0
下載:
