A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
We describe a genetic algorithm for the partial constraint satisfaction problem. The typical elements of a genetic algorithm, selection, mutation and cross-over, are filled in with combinatorial ideas. For instance, cross-over of two solutions is performed by taking the one or two domain elements in the solutions of each of the variables as the complete domain of the variable. Then a branch-and-bound method is used for solving this small instance. When tested on a class of frequency assignment problems this genetic algorithm produced the best known solutions for all test problems. This feeds the idea that combinatorial ideas may well be useful in genetic algorithms.
|Date of creation:||2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +31 (0)43 38 83 830
Web page: http://www.maastrichtuniversity.nl/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:unm:umamet:2006045. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Charles Bollen)
If references are entirely missing, you can add them using this form.