Genetic search and the dynamic layout problem

Genetic search and the dynamic layout problem

0.00 Avg rating0 Votes
Article ID: iaor2001949
Country: United Kingdom
Volume: 27
Issue: 6
Start Page Number: 587
End Page Number: 593
Publication Date: May 2000
Journal: Computers and Operations Research
Authors: ,
Keywords: artificial intelligence
Abstract:

An improved genetic algorithm for the dynamic layout problem is developed and tested in this research. Our genetic algorithm differs from the existing implementation in three ways: first, we adopt a different crossover operator, second, we use mutation, and third, we use a new generational replacement strategy to help increase population diversity. A computational study shows that the proposed GA is quite effective.

Reviews

Required fields are marked *. Your email address will not be published.