Solving mixed-integer nonlinear programming problems using improved genetic algorithms

This paper proposes a method for solving mixed-integer nonlinear programming problems to achieve or approach the optimal solution by using modified genetic algorithms. The representation scheme covers both integer and real variables for solving mixed-integer nonlinear programming, nonlinear programm...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Korean journal of chemical engineering Ročník 28; číslo 1; s. 32 - 40
Hlavní autori: Wasanapradit, Tawan, Mukdasanit, Nalinee, Chaiyaratana, Nachol, Srinophakun, Thongchai
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.01.2011
한국화학공학회
Predmet:
Biotechnology
Catalysis
Chemistry
Chemistry and Materials Science
Industrial Chemistry/Chemical Engineering
Materials Science
화학공학
Mixed Integer Nonlinear Programming
CPSS
Modified Genetic Algorithms
Genetic Algorithms
Repairing Strategy
ISSN:0256-1115, 1975-7220
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper proposes a method for solving mixed-integer nonlinear programming problems to achieve or approach the optimal solution by using modified genetic algorithms. The representation scheme covers both integer and real variables for solving mixed-integer nonlinear programming, nonlinear programming, and nonlinear integer programming. The repairing strategy, a secant method incorporated with a bisection method, plays an important role in converting infeasible chromosomes to feasible chromosomes at the constraint boundary. To prevent premature convergence, the appropriate diversity of the structures in the population must be controlled. A cross-generational probabilistic survival selection method (CPSS) is modified for real number representation corresponding to the representation scheme. The efficiency of the proposed method was validated with several numerical test problems and showed good agreement.
Bibliografia:G704-000406.2011.28.1.040
http://www.cheric.org/article/855516
ISSN:0256-1115
1975-7220
DOI:10.1007/s11814-010-0323-3