Title | ||
---|---|---|
Evolutionary Algorithm for Zero-One Constrained Optimization Problems Based on Objective Penalty Function |
Abstract | ||
---|---|---|
In many evolutionary algorithms, it is very important way to use penalty function as a fitness function in order to solve many integer optimization problems. In this paper, we first define a new objective penalty function and give its some properties for integer constrained optimization problems. Then, we present an algorithm with global convergence for integer constrained optimization problems in theory. Moreover, based on the objective penalty function, a simple novel evolutionary algorithm to solve the zero-one constrained optimization problems is developed. Finally, numerical results of several examples show that the proposed evolutionary algorithm has a good performance for some zero-one optimization problems. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/CIS.2010.36 | CIS |
Keywords | Field | DocType |
fitness function,evolutionary algorithm,proposed evolutionary algorithm,evolutionary computation,integer constrained optimization problem,integer programming,objective penalty function,integer optimization problem,zero-one constrained optimization,convergence,optimization problem,global convergence,zero-one optimization problem,zero-one optimization problems,integer optimization,new objective penalty function,penalty function,optimization,programming,business,np hard problem | Continuous optimization,Mathematical optimization,Evolutionary algorithm,Computer science,Multi-objective optimization,Fitness approximation,Artificial intelligence,Imperialist competitive algorithm,Optimization problem,Machine learning,Penalty method,Constrained optimization | Conference |
ISBN | Citations | PageRank |
978-0-7695-4297-3 | 0 | 0.34 |
References | Authors | |
2 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhiqing Meng | 1 | 43 | 14.49 |
Min Jiang | 2 | 7 | 4.15 |
Chuangyin Dang | 3 | 2552 | 112.80 |