Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems

A new hybrid algorithm is being introduced for solving Mixed Integer Nonlinear Programming ( ) problems which arise from study of many real-life engineering problems such as the minimum cost development of oil fields and the optimization of a multiproduct batch plant. This new algorithm employs both the Genetic Algorithm and a modified grid search method interfacing in such a way that the resulting hybrid algorithm is capable of solving many problems efficiently and accurately. Testings indicate that this algorithm is efficient and robust even for some ill-conditioned problems with nonconvex constraints.