A Memetic Algorithm for Mixed-Integer Optimization Problems

Evolutionary algorithms (EAs) are population-based global search methods. 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...

Full description

Saved in:
Bibliographic Details
Published inApplied Mechanics and Materials Vol. 284-287; pp. 2970 - 2974
Main Author Lin, Yung Chien
Format Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications Ltd 25.01.2013
Subjects
Online AccessGet full text
ISBN3037856122
9783037856123
ISSN1660-9336
1662-7482
1662-7482
DOI10.4028/www.scientific.net/AMM.284-287.2970

Cover

More Information
Summary:Evolutionary algorithms (EAs) are population-based global search methods. 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 constrained optimization problems. The proposed algorithm is implemented and tested on a benchmark mixed-integer constrained optimization problem. Experimental results show that the proposed algorithm can find a better optimal solution compared with some other search algorithms.
Bibliography:Selected, peer reviewed papers from the Second International Conference on Engineering and Technology Innovation 2012, November 2 - 6, 2012, Kaohsiung, Taiwan, R. O. C.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISBN:3037856122
9783037856123
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.284-287.2970