An Improved Genetic Algorithm for Solving Tri-level Programming Problems

When genetic algorithm is adopted to solve tri-level programming, many problems exist, such as controlling population size, jumping out of local optima, and avoiding low efficiency. An improved genetic algorithm with parallel strategy is proposed in this paper to solve tri-level programming, as well...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2022 4th International Conference on Industrial Artificial Intelligence (IAI) s. 1 - 5
Hlavní autori: Su, Kai, Lei, Zhili, Niu, Haiming
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 24.08.2022
Predmet:
Aerospace electronics
Artificial intelligence
Computational complexity
crowding distance
elite reserving
genetic algorithm
Numerical models
Programming
Sociology
Statistics
tri-level programming
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:When genetic algorithm is adopted to solve tri-level programming, many problems exist, such as controlling population size, jumping out of local optima, and avoiding low efficiency. An improved genetic algorithm with parallel strategy is proposed in this paper to solve tri-level programming, as well as elites reserving and fitness value crowding strategy. Simulations with numerical examples are done to prove correctness and effectiveness of the proposed algorithm.
DOI:10.1109/IAI55780.2022.9976878