IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v61y2007i1p4-15.html
   My bibliography  Save this article

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

Author

Listed:
  • Antoon Kolen

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.

Suggested Citation

  • Antoon Kolen, 2007. "A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 61(1), pages 4-15, February.
    • Handle: RePEc:bla:stanee:v:61:y:2007:i:1:p:4-15
    DOI: 10.1111/j.1467-9574.2007.00357.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.2007.00357.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1467-9574.2007.00357.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:stanee:v:61:y:2007:i:1:p:4-15. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.