Dynamic constrained multi-objective optimization based on adaptive combinatorial response mechanism

In dynamic multi-objective optimization problems (DMOPs), objective functions, problem parameters, and constraints may change over time. Mainly, DMOPs use response mechanisms to generate the initial population after the environment changes. In this research, we develop an adaptive version of the com...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied soft computing Ročník 155; s. 111398
Hlavní autoři: Aliniya, Zahra, Khasteh, Seyed Hossein
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.04.2024
Témata:
Adaptive combinatorial response mechanism
Constraint handling technique
Dynamic constrained multi-objective optimization
Evolutionary algorithm
Reinforcement learning
Dynamic constrained multi-objective optimization
Adaptive combinatorial response mechanism
Evolutionary algorithm
Reinforcement learning
Constraint handling technique
ISSN:1568-4946, 1872-9681
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In dynamic multi-objective optimization problems (DMOPs), objective functions, problem parameters, and constraints may change over time. Mainly, DMOPs use response mechanisms to generate the initial population after the environment changes. In this research, we develop an adaptive version of the combinational response mechanism (ACRM). ACRM uses three response mechanisms based on diversity, prediction, and memory to form the initial population. In ACRM, the number of solutions generated by a response mechanism is determined by reinforcement learning according to the severity of environmental changes. The background knowledge is transferred to reinforcement learning using the Q-value initialization method. Thus, in the early stages of optimization, when the experience gained from the environment is low, the proposed algorithm improves its performance using background knowledge. Also, we develop a new combinational constraint handling technique (CCHT). This method uses the dynamic information of the environment (i.e. the ratio of feasible solutions) to choose the appropriate constraint handling technique. The results of the tests on 23 dynamic test functions and seven dynamic constrained test functions indicate that the performance of the proposed algorithm can compete with advanced evolutionary algorithms in terms of the degree of convergence and variety of solutions. Permanent link to reproducible Capsule: <https://doi.org/10.24433/CO.1949267.v1>. •Developing an adaptive CRM that uses reinforcement learning.•Extracting valuable information from the environment to adapt to changes.•Using reinforcement learning to determine the number of solutions.•Proposing a new combinational constraint-handling technique (CCHT).•Generate six new DCMOPs by combining ACRM with six constraint-handling techniques.
ISSN:1568-4946
1872-9681
DOI:10.1016/j.asoc.2024.111398