A Heuristic Algorithm Based on Line-up Competition and Generalized Pattern Search for Solving Integer and Mixed Integer Non-linear Optimization Problems

AUTOR(ES)

Shahriari, Behrooz, Ravari, M. R. Karamooz, Yousefi, Shahram, Tajdari, Mahdi

FONTE

Lat. Am. j. solids struct.

DATA DE PUBLICAÇÃO

2016-02

RESUMO

Abstract The global optimization of integer and mixed integer non-linear problems has a lot of applications in engineering. In this paper a heuristic algorithm is developed using line-up competition and generalized pattern search to solve integer and mixed integer non-linear optimization problems subjected to various linear or nonlinear constraints. Due to its ability to find more than one local or global optimal points, the proposed algorithm is more beneficial for multi-modal problems. The performance of this algorithm is demonstrated through several non-convex integer and mixed integer optimization problems exhibiting good agreement with those reported in the literature. In addition, the convergence time is compared with LCAs' one demonstrating the efficiency and speed of the algorithm. Meanwhile, the constraints are satisfied after passing only a few iterations.

Documentos Relacionados

• Ability of non-linear mixed models to predict growth in laying hens
• An efficient formulation for linear and geometric non-linear membrane elements
• Low cost BIST techniques for linear and non-linear analog circuits
• Panoramic e-learning videos for non-linear navigation
• Non-linear dynamics of a hanging rope