An improved assisted evolutionary algorithm for data-driven mixed integer optimization based on Two_Arch

被引:6
作者
Gu, Qinghua [1 ,2 ]
Wang, Danna [1 ]
Jiang, Song [2 ]
Xiong, Naixue [2 ]
Jin, Yu [2 ]
机构
[1] Xian Univ Architecture & Technol, Sch Management, Xian 710055, Shaanxi, Peoples R China
[2] Xian Univ Architecture & Technol, Sch Resources Engn, Xian 710055, Shaanxi, Peoples R China
关键词
Data-driven optimization; Expensive constrained multi-objective mixed-integer optimization problem; Surrogate model; Two-archive algorithm; Differential evolution strategy; GENETIC ALGORITHM; CONVERGENCE;
D O I
10.1016/j.cie.2021.107463
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Most of the existing data-driven surrogate-assisted optimization algorithms are developed to solve continuous optimization problems, but there are many problems in reality belong to combinatorial optimization/discrete optimization problems, especially (subdivided into) mixed-integer optimization problems. However, there are few researches based on online data-driven mixed-integer linear programming. Therefore, in this work, we solve a kind of expensive data-driven constrained multi-objective mixed-integer optimization problem, the objectives and constraints are derived based on a large number of calculations. In order to solve this kind of problem, we proposed the use of a random forest classifier (RF) as a surrogate model to approximate the objective and constraints. At the same time, to balance the convergence, diversity, and complexity of the objective, this paper proposes a new improvement strategy that combines the surrogate-assisted model and the Two_Arch method, which assigns different selection principles to the two files, and a dual structure multi-objective maintenance program based on Hypervolume district size (HD) indicators. To further improve the accuracy and performance of the model, this paper also adopts a new crossover operator. To verify the effectiveness of the algorithm, tests are carried out on ten benchmark problems of multi-objective knapsack, and comprehensive comparison with several well-known algorithms is carried out. Experimental results show that the improved algorithm is effective in solving data-driven multi-objective mixed-integer optimization problems.
引用
收藏
页数:11
相关论文
共 59 条
  • [1] Ai W., 2012, HUANAN LIGONG DAXUE, V40
  • [2] Particle swarm optimisation with stochastic ranking for constrained numerical and engineering benchmark problems
    Ali, Layak
    Sabat, Samrat L.
    Udgata, Siba K.
    [J]. INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2012, 4 (03) : 155 - 166
  • [3] HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces
    Arora, Akhil
    Sinha, Sakshi
    Kumar, Piyush
    Bhattacharya, Arnab
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2018, 11 (08): : 906 - 919
  • [4] Smoothed Analysis of the k-Means Method
    Arthur, David
    Manthey, Bodo
    Roeglin, Heiko
    [J]. JOURNAL OF THE ACM, 2011, 58 (05)
  • [5] HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
    Bader, Johannes
    Zitzler, Eckart
    [J]. EVOLUTIONARY COMPUTATION, 2011, 19 (01) : 45 - 76
  • [6] Logistic regression when binary predictor variables are highly correlated
    Barker, L
    Brown, C
    [J]. STATISTICS IN MEDICINE, 2001, 20 (9-10) : 1431 - 1442
  • [7] Model-based methods for continuous and discrete global optimization
    Bartz-Beielstein, Thomas
    Zaefferer, Martin
    [J]. APPLIED SOFT COMPUTING, 2017, 55 : 154 - 167
  • [8] DOMINO: Data-driven Optimization of bi-level Mixed-Integer NOnlinear Problems
    Beykal, Burcu
    Avraamidou, Styliani
    Pistikopoulos, Ioannis P. E.
    Onel, Melis
    Pistikopoulos, Efstratios N.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2020, 78 (01) : 1 - 36
  • [9] Random forests
    Breiman, L
    [J]. MACHINE LEARNING, 2001, 45 (01) : 5 - 32
  • [10] Breiman L., Classification And Regression Trees. eng