4.7 Article

Combining a Population-Based Approach with Multiple Linear Models for Continuous and Discrete Optimization Problems

期刊

MATHEMATICS
卷 10, 期 16, 页码 -

出版社

MDPI
DOI: 10.3390/math10162920

关键词

metaheuristics; machine learning; hybrid approach; optimization

资金

  1. National Agency for Research and Development ANID/Scholarship Program/DOCTORADO NACIONAL [2020-21202527]
  2. [CONICYT/FONDECYT/REGULAR/1190129]
  3. [ANID/FONDECYT/REGULAR/1210810]

向作者/读者索取更多资源

Population-based approaches offer new search strategies for optimization problems. This work proposes a hybrid architecture that intelligently balances population size by using learning components and statistical modeling methods. It demonstrates the viability and effectiveness of the approach through solving benchmark functions and the multidimensional knapsack problem.
Population-based approaches have given us new search strategies and ideas in order to solve optimization problems. Usually, these methods are based on the performance carried out by a finite number of agents, which by the interaction between them they evolve and work all over the search space. Also, it is well-known that the correct employment of parameter values in this kind of method can positively impact their performance and behavior. In this context, the present work focuses on the design of a hybrid architecture which smartly balances the population size on run-time. In order to smartly balance and control the population size, a modular approach, named Linear Modular Population Balancer (LMPB), is proposed. The main ideas behind the designed architecture include the solving strategy behind a population-based metaheuristic, the influence of learning components based on multiple statistical modeling methods which transform the dynamic data generated into knowledge, and the possibilities to tackle both discrete and continuous optimization problems. In this regard, three modules are proposed for LMPB, which concern tasks such as the management of the population-based algorithm, parameter setting, probabilities, learning methods, and selection mechanism for the population size to employ. In order to test the viability and effectiveness of our proposed approach, we solve a set of well-known benchmark functions and the multidimensional knapsack problem (MKP). Additionally, we illustrate promising solving results, compare them against state-of-the-art methods which have proved to be good options for solving optimization problems, and give solid arguments for future work in the necessity to keep evolving this type of proposed architecture.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据