DocumentCode
2135477
Title
A differential evolution algorithm for solving geometric programming problems
Author
Xiaohong Wang ; Qinghua Su ; Yongfei Miao
Author_Institution
Wuhan Bus. Univ., Wuhan, China
fYear
2013
fDate
23-25 July 2013
Firstpage
359
Lastpage
363
Abstract
A geometric program (GP) is a type of optimization problem characterized by objective and constraint functions that have a special form. By combining with a simple constraint-handling mechanism based on feasibility rules, a new approach based on a differential evolution algorithm is proposed for solving the GP problem in this paper. Numerical simulation experiments show the validity of the method, and comparative studies expose the proposed algorithm as a competitive approach for geometric programming problems.
Keywords
constraint handling; evolutionary computation; geometric programming; GP problem; constraint functions; constraint-handling mechanism; differential evolution algorithm; geometric programming problems; numerical simulation experiments; objective functions; optimization problem; Algorithm design and analysis; Educational institutions; Optimization; Programming; Sociology; Statistics; Vectors; constraint-handling mechanism; differential evolution algorithm; geometric programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation (ICNC), 2013 Ninth International Conference on
Conference_Location
Shenyang
Type
conf
DOI
10.1109/ICNC.2013.6818001
Filename
6818001
Link To Document