Abstract

Evolutionary algorithms (EAs) are population-based global search methods. They have been successfully applied to many complex optimization problems. However, EAs are frequently incapable of finding a convergence solution in default of local search mechanisms. Memetic Algorithms (MAs) are hybrid EAs that combine genetic operators with local search methods. With global exploration and local exploitation in search space, MAs are capable of obtaining more high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE), as an EA-based search algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, a memetic algorithm based on MIHDE is developed for solving mixed-integer optimization problems. However, most of real-world mixed-integer optimization problems frequently consist of equality and/or inequality constraints. In order to effectively handle constraints, an evolutionary Lagrange method based on memetic algorithm is developed to solve the mixed-integer constrained optimization problems. The proposed algorithm is implemented and tested on two benchmark mixed-integer constrained optimization problems. Experimental results show that the proposed algorithm can find better optimal solutions compared with some other search algorithms. Therefore, it implies that the proposed memetic algorithm is a good approach to mixed-integer optimization problems.

Citation

Lin, Y.C. (2013). Mixed-Integer Constrained Optimization Based on Memetic Algorithm. Journal of Applied Research and Technology, 11(2), 242-250. Elsevier Ltd. Retrieved May 19, 2022 from https://www.learntechlib.org/p/198466/.

Keywords

• Evolutionary Algorithm
• Lagrange method
• memetic algorithm
• mixed-integer hybrid differential evolution