Adaptive Racing Sampling Based Immune Optimization Approach for Nonlinear Multi-Objective Chance Constrained Programming

This work investigates a multi-objective immune optimization approach to solve the general type of nonlinear multi-objective chance constrained programming without prior noise information. One such kind of model is first converted into a sample-dependent approximation one, while a sample bound estim...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 12; s. 96231 - 96245
Hlavní autori: Yang, Kai, Zhang, Renchong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Adaptation models
Adaptive sampling
Approximation methods
Complexity
Constraints
danger theory
Feasibility
immune optimization
Immune system
Multi-objective chance constrained programming
Multiple objective analysis
Nonlinear systems
Optimization
Optimization methods
Optimization models
Probabilistic logic
Programming profession
Random variables
sample-dependent approximation
Sampling methods
Stochastic processes
Transportation
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This work investigates a multi-objective immune optimization approach to solve the general type of nonlinear multi-objective chance constrained programming without prior noise information. One such kind of model is first converted into a sample-dependent approximation one, while a sample bound estimate model is theoretically acquired based on the empirical Bernstein bound, in order to control the sampling size of random variable. Secondly, a feasibility detection approach with adaptive sampling is designed to quickly justify whether an individual is empirically feasible. Inspired by the danger theory, an artificial immune optimization model is drawn in terms of immune response mechanisms in the immune system, which derives out a multi-objective chance constrained optimizer with small populations and multiple evolutionary strategies. The computational complexity of the optimizer depends mainly on the sample bound and the size of memory pool. Comparative experiments have validated that it is a robust, stable, and effective optimizer with high efficiency while helping for solving complex chance constrained problems.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2024.3417952