Dissemin is shutting down on January 1st, 2025

Published in

2007 IEEE Congress on Evolutionary Computation

DOI: 10.1109/cec.2007.4425060

Links

Tools

Export citation

Search in Google Scholar

A genetic algorithm for solving multi-constrained function optimization problems based on KS function

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

In this paper, a new genetic algorithm for solving multi-constrained optimization problems based on KS function is proposed. Firstly, utilizing the agglomeration features of KS function, all constraints of optimization problems are agglomerated to only one constraint. Then, we use genetic algorithm to solve the optimization problem after the compression of constraints. Finally, the simulation results on benchmark functions show the efficiency of our algorithm.