A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem

Antoon Kolen

Statistica Neerlandica, 2007, vol. 61, issue 1, 4-15

Abstract: 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: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.2007.00357.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:61:y:2007:i:1:p:4-15

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().