Mixed-Integer Constrained Optimization Based on Memetic Algorithm
Evolutionary algorithms (EAs) are population-based global search methods. They have been successfully applied tomany complex optimization problems. However, EAs are frequently incapable of finding a convergence solution indefault of local search mechanisms. Memetic Algorithms (MAs) are hybrid EAs th...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | México |
| Institución: | UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO |
| Repositorio: | Journal of Applied Research and Technology |
| Idioma: | inglés |
| OAI Identifier: | oai:ojs2.localhost:article/319 |
| Acceso en línea: | https://jart.icat.unam.mx/index.php/jart/article/view/319 |
| Access Level: | acceso abierto |
| Palabra clave: | Evolutionary algorithm memetic algorithm mixed-integer hybrid differential evolution Lagrange method. |
| Sumario: | Evolutionary algorithms (EAs) are population-based global search methods. They have been successfully applied tomany complex optimization problems. However, EAs are frequently incapable of finding a convergence solution indefault of local search mechanisms. Memetic Algorithms (MAs) are hybrid EAs that combine genetic operators withlocal search methods. With global exploration and local exploitation in search space, MAs are capable of obtainingmore high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE), as an EA-basedsearch algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, amemetic algorithm based on MIHDE is developed for solving mixed-integer optimization problems. However, most ofreal-world mixed-integer optimization problems frequently consist of equality and/or inequality constraints. In order toeffectively handle constraints, an evolutionary Lagrange method based on memetic algorithm is developed to solvethe mixed-integer constrained optimization problems. The proposed algorithm is implemented and tested on twobenchmark mixed-integer constrained optimization problems. Experimental results show that the proposed algorithmcan find better optimal solutions compared with some other search algorithms. Therefore, it implies that the proposedmemetic algorithm is a good approach to mixed-integer optimization problems. |
|---|