A new genetic algorithm for solving nonconvex nonlinear programming problems

DOI10.1016/J.AMC.2007.09.047MaRDI QIDQ924398zbMATH OpenOpenAlexFDO

Authors Mohammad Hemati, Mir-Bahador Aryanezhad

Publication date 16 May 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.09.047

zbMATH Keywords

global optimumdecompositionnonlinear programmingnonconvex programminggenetic algorithmlarge scale problemssub problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)

Recommendations

• An improved genetic algorithm to optimize the nonlinear programming problems
• Genetic algorithms for solving a class of constrained nonlinear integer programs
• A hybrid genetic algorithm for a type of nonlinear programming problem
• Publication:4489976
• A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
• scientific article; zbMATH DE number 1500393
• A genetic algorithm based on optimality conditions for nonlinear bilevel programming problems
• COEVOLUTIONARY GENETIC ALGORITHMS FOR NONCONVEX NONLINEAR PROGRAMMING PROBLEMS: REVISED GENOCOP III

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• An effective genetic algorithm approach to large scale mixed integer programming problems
• An effective genetic algorithm approach to multiobjective routing problems (MORPs)
• An efficient algorithm for large scale global optimization of continuous functions
• An interactive fuzzy satisficing method for multiobjective nonconvex programming problems through floating point genetic algorithms
• Asymptotic convergence of genetic algorithms
• Convergence Criteria for Genetic Algorithms
• Evolutionary Computation for Modeling and Optimization
• Genetic algorithms and traveling salesman problems
• Modeling genetic algorithms with Markov chains.
• New directions in genetic algorithm theory
• Practical Genetic Algorithms
• Stopping Criteria for Finite Length Genetic Algorithms
• The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.

Cited in

(16)

• scientific article; zbMATH DE number 1475708 (Why is no real title available?)
• scientific article; zbMATH DE number 1500393 (Why is no real title available?)
• Genetic algorithms for solving a class of constrained nonlinear integer programs
• A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization
• LGMS-FOA: an improved fruit fly optimization algorithm for solving optimization problems
• Nonlinear goal programming using multi-objective genetic algorithms
• Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• A multipurpose parallel genetic hybrid algorithm for nonlinear nonconvex programming problems
• A dynamic genetic algorithm based on continuous neural networks for a kind of non-convex optimization problems.
• A hybrid genetic algorithm for nonconvex function minimization.
• GEM: A novel evolutionary optimization method with improved neighborhood search
• scientific article; zbMATH DE number 2159091 (Why is no real title available?)
• scientific article; zbMATH DE number 34971 (Why is no real title available?)
• Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints.
• An improved genetic algorithm to optimize the nonlinear programming problems

This page was built for publication: A new genetic algorithm for solving nonconvex nonlinear programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924398)