Spatial-domain fitness landscape analysis for combinatorial optimization

被引:15
作者
Lu, Hui [1 ]
Zhou, Rongrong [1 ]
Fei, Zongming [2 ]
Guan, Chongchong [1 ]
机构
[1] Beihang Univ, Sch Elect & Informat Engn, Beijing 100191, Peoples R China
[2] Univ Kentucky, Dept Comp Sci, Lexington, KY 40506 USA
基金
中国国家自然科学基金;
关键词
Fitness landscape analysis; Mapping mechanism; Ruggedness; Neutrality; Adaptive parameter control; ADAPTIVE OPERATOR SELECTION; SCHEDULING PROBLEMS; ALGORITHM; SEARCH; SIZE;
D O I
10.1016/j.ins.2018.09.019
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fitness landscape analysis has been effectively used to analyze the characteristics of combinatorial optimization problems (COPs) while investigating the behavior of applied algorithms. However, most COPs are high dimensional and an intuitive understanding of traditional fitness landscape analysis is challenging. To address this issue, the present study proposes a spatial-domain fitness landscape analysis framework. This framework aims to visualize the fitness landscapes regarding of a target COP and evaluate the properties of the COP. To construct the landscapes, a mapping strategy inspired by lexicographic order is designed to establish the connection between the high-dimensional and low-dimensional spaces. Accordingly, a spatial-domain parameter, namely, the slope of the digital elevation models (DEMs), is utilized to assess the ruggedness of landscapes. As an auxiliary value, the neutrality ratio is introduced to reflect the degree of neutrality. In addition, a parameter control mechanism based on these landscape metrics is advanced to enhance the adaptability of the algorithm. Finally, the experimental results reveal that the spatial-domain fitness landscape can help extract the characteristics of COPs and study the behavior of algorithms effectively. In addition, the proposed adaptive parameter control strategy significantly improves the performance of the algorithm for solving COPs. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:126 / 144
页数:19
相关论文
共 48 条
[1]   A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary Algorithms [J].
Aleti, Aldeida ;
Moser, Irene .
ACM COMPUTING SURVEYS, 2016, 49 (03)
[2]   A Hybrid Harmony search and Simulated Annealing algorithm for continuous optimization [J].
Assad, Assif ;
Deep, Kusum .
INFORMATION SCIENCES, 2018, 450 :246-266
[3]   Climbing combinatorial fitness landscapes [J].
Basseur, Matthieu ;
Goeffon, Adrien .
APPLIED SOFT COMPUTING, 2015, 30 :688-704
[4]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[5]   Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis [J].
Consoli, Pietro A. ;
Mei, Yi ;
Minku, Leandro L. ;
Yao, Xin .
SOFT COMPUTING, 2016, 20 (10) :3889-3914
[6]   A novel artificial bee colony algorithm with an adaptive population size for numerical function optimization [J].
Cui, Laizhong ;
Li, Genghui ;
Zhu, Zexuan ;
Lin, Qiuzhen ;
Wen, Zhenkun ;
Lu, Nan ;
Wong, Ka-Chun ;
Chen, Jianyong .
INFORMATION SCIENCES, 2017, 414 :53-67
[7]  
DaCosta L., 2008, P 10 ANN C GENETIC E, P913
[8]   A discrete gravitational search algorithm for solving combinatorial optimization problems [J].
Dowlatshahi, Mohammad Bagher ;
Nezamabadi-Pour, Hossein ;
Mashinchi, Mashaallah .
INFORMATION SCIENCES, 2014, 258 :94-107
[9]   Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources [J].
Fanjul-Peyro, Luis ;
Perea, Federico ;
Ruiz, Ruben .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (02) :482-493
[10]   Measuring epistasis in fitness landscapes: The correlation of fitness effects of mutations [J].
Ferretti, Luca ;
Schmiegelt, Benjamin ;
Weinreich, Daniel ;
Yamauchi, Atsushi ;
Kobayashi, Yutaka ;
Tajima, Fumio ;
Achaz, Guillaume .
JOURNAL OF THEORETICAL BIOLOGY, 2016, 396 :132-143