Incremental Genetic Algorithm

LAUR Repository

Show simple item record

dc.contributor.author Mansour, Nashat
dc.contributor.author Awad, Mohamad
dc.contributor.author El-Fakih, Khaled
dc.date.accessioned 2016-01-26T12:20:23Z
dc.date.available 2016-01-26T12:20:23Z
dc.date.copyright 2006
dc.date.issued 2016-01-26
dc.identifier.issn 1683-3198 en_US
dc.identifier.uri http://hdl.handle.net/10725/2960
dc.description.abstract Classical Genetic Algorithms (CGA) are known to find good sub-optimal solutions for complex and intractable optimization problems. In many cases, problems undergo frequent minor modifications, each producing a new problem version. If these problems are not small in size, it becomes costly to use a genetic algorithm to reoptimize them after each modification. In this paper, we propose an Incremental Genetic Algorithm (IGA) to reduce the time needed to reoptimize modified problems. The idea of IGA is simple and leads to useful results. IGA is similar to CGA except that it starts with an initial population that contains chromosomes saved from the CGA run for the initial problem version (prior to modifying it). These chromosomes are best feasible and best infeasible chromosomes to which we apply two techniques in order to ensure sufficient diversity within them. To validate the proposed approach, we consider three problems: Optimal regression software testing, general optimization, and exam scheduling. The empirical results obtained by applying IGA to the three optimization problems show that IGA requires a smaller number of generations than those of a CGA to find a solution. In addition, the quality of the solutions produced by IGA is comparable to those of CGA.
dc.language.iso en en_US
dc.title Incremental Genetic Algorithm en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 198629170 en_US
dc.author.woa N/A en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal The international Arab journal of information technology en_US
dc.journal.volume 3 en_US
dc.journal.issue 1 en_US
dc.article.pages 42-47 en_US
dc.keywords Exam scheduling en_US
dc.keywords General optimization en_US
dc.keywords Incremental genectic algorithms en_US
dc.keywords Regression testing en_US
dc.keywords Soft computing en_US
dc.identifier.ctation Mansour, N., Awad, M., & El-Fakih, K. (2006). Incremental genetic algorithm. The International Arab Journal of Information Technology, 3(1), 42-47. en_US
dc.author.email nmansour@lau.edu.lb
dc.identifier.url http://iajit.org/PDF/vol.3,no.1/7-Nashat.pdf

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account