Decision-making and multi-objectivization for cost sensitive robust optimization over time

被引:13
作者
Huang, Yuanjun [1 ,2 ]
Jin, Yaochu [2 ,3 ]
Hao, Kuangrong [2 ]
机构
[1] Jiaxing Univ, Jiaxing 314001, Zhejiang, Peoples R China
[2] Donghua Univ, Coll Informat Sci & Technol, Engn Res Ctr Digitized Text & Apparel Technol, Minist Educ, Shanghai 201620, Peoples R China
[3] Univ Surrey, Dept Comp Sci, Surrey GU2 7XH, Surrey, England
基金
浙江省自然科学基金; 英国工程与自然科学研究理事会;
关键词
Robust optimization over time; Switching cost; Decision-making; Multi-objective optimization; Multi-objectivization; DIFFERENTIAL EVOLUTION; DYNAMIC ENVIRONMENTS; SWARM OPTIMIZER; ALGORITHM; PERFORMANCE; OBJECTIVES; STRATEGY; SEARCH; MEMORY;
D O I
10.1016/j.knosys.2020.105857
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most existing research on dynamic optimization focuses on tracking the moving global optimum (TMO). Recently, a new paradigm for handling dynamic optimization, known as robust optimal over time (ROOT), has been proposed to avoid frequent changes in the optimal solutions. To explicitly minimize the costs incurred in switching solutions, a multi-objective ROOT algorithm has also been suggested. In practice, however, only one Pareto optimal solution can be adopted when the environment changes. To automate the decision-making process, this paper proposes a new approach that combines a ROOT/SCII algorithm with a policy to handle dynamic optimization problems. In the proposed approach, ROOT/SCII is used to simultaneously maximize the robustness and minimize the costs of switching solutions, and the policy is used to select a solution from the obtained Pareto set to be used in the new environment. In addition, multi-objectivization is introduced to enhance the efficiency in search for Pareto optimal solutions trading off between the robustness over time and the switching costs for the high dimension of decision space. Simulation results demonstrate that multi-objectivization is effective and the proposed approach is able to find a sequence of preferred solutions guided by the policy, considerably reducing the total switching costs while satisfying the user's robustness requirement, and outperforming TMO and ROOT in terms of switching cost minimization. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:14
相关论文
共 74 条
[1]  
[Anonymous], 2015, C EV COMP CEC SEND J
[2]  
Aragon V.S., 2004, J. Comput. Sci. Technol., V4, P127
[3]  
Bradstreet L., 2011, Ph.D. dissertation
[4]   A collaboration-based particle swarm optimizer with history-guided estimation for optimization in dynamic environments [J].
Cao, Leilei ;
Xu, Lihong ;
Goodman, Erik D. .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 120 :1-13
[5]  
Chao T, 2009, INT CONF BIOMED, P2000
[6]   Quadratic interpolation based teaching-learning-based optimization for chemical dynamic system optimization [J].
Chen, Xu ;
Mei, Congli ;
Xu, Bin ;
Yu, Kunjie ;
Huang, Xiuhui .
KNOWLEDGE-BASED SYSTEMS, 2018, 145 :250-263
[7]   A Competitive Swarm Optimizer for Large Scale Optimization [J].
Cheng, Ran ;
Jin, Yaochu .
IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (02) :191-204
[8]  
Coello CAC, 2004, IEEE T EVOLUT COMPUT, V8, P256, DOI [10.1109/TEVC.2004.826067, 10.1109/tevc.2004.826067]
[9]   Optimization in dynamic environments: a survey on problems, methods and measures [J].
Cruz, Carlos ;
Gonzalez, Juan R. ;
Pelta, David A. .
SOFT COMPUTING, 2011, 15 (07) :1427-1448
[10]   An Adaptive Differential Evolution Algorithm for Global Optimization in Dynamic Environments [J].
Das, Swagatam ;
Mandal, Ankush ;
Mukherjee, Rohan .
IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (06) :966-978