IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

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

  • Kolen Antoon

    (METEOR)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://digitalarchive.maastrichtuniversity.nl/fedora/objects/guid:0c5da7e2-51fe-423d-9914-839d3ae187a4/datastreams/ASSET1/content
    Our checks indicate that this address may not be valid because: 401 Unauthorized. If this is indeed the case, please notify (Charles Bollen)


    Download Restriction: no

    Paper provided by Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR) in its series Research Memorandum with number 045.

    as
    in new window

    Length:
    Date of creation: 2006
    Date of revision:
    Handle: RePEc:unm:umamet:2006045
    Contact details of provider: Postal: P.O. Box 616, 6200 MD Maastricht
    Phone: +31 (0)43 38 83 830
    Web page: http://www.maastrichtuniversity.nl/
    Email:


    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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 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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.