Self-learning genetic algorithm for constrains satisfaction problems

    Research output: Chapter in Book/Report/Conference proceedingChapter

    1 Citation (Scopus)

    Abstract

    The efficient choice of a preprocessing level can reduce the search time of a constraint solver to find a solution to a constraint problem. Currently the parameters in constraint solver are often picked by hand by experts in the field. Genetic algorithms are a robust machine learning technology for problem optimization such as function optimization. Self-learning Genetic Algorithm are a strategy which suggests or predicts the suitable preprocessing method for large scale problems by learning from the same class of small scale problems. In this paper Self-learning Genetic Algorithms are used to create an automatic preprocessing selection mechanism for solving various constraint problems. The experiments in the paper are a proof of concept for the idea of combining genetic algorithm self-learning ability with constraint programming to aid in the parameter selection issue.
    Original languageEnglish
    Title of host publication2012 Imperial College Computing Student Workshop
    Subtitle of host publicationICCSW 2012
    EditorsAndrew V. Jones
    Place of PublicationLeibnitz, Austria
    PublisherDagstuhl Publications
    Pages156-162
    Number of pages7
    Volume28
    ISBN (Print)9783939897484
    DOIs
    Publication statusPublished - 2012
    Event2nd Imperial College Computing Student Workshop, ICCSW 2012 - London, United Kingdom
    Duration: 27 Sep 201228 Sep 2012
    http://iccsw.doc.ic.ac.uk/2012/files/flyer.pdf

    Publication series

    NameOpen Access Series in Informatics (OASIcs)
    PublisherDagstuhl
    Volume28
    ISSN (Print)2190-6807

    Conference

    Conference2nd Imperial College Computing Student Workshop, ICCSW 2012
    CountryUnited Kingdom
    CityLondon
    Period27/09/1228/09/12
    Internet address

    Fingerprint

    Learning algorithms
    Genetic algorithms
    Learning systems
    Experiments

    Cite this

    Xu, H., & Petrie, K. (2012). Self-learning genetic algorithm for constrains satisfaction problems. In A. V. Jones (Ed.), 2012 Imperial College Computing Student Workshop: ICCSW 2012 (Vol. 28, pp. 156-162). (Open Access Series in Informatics (OASIcs); Vol. 28). Leibnitz, Austria: Dagstuhl Publications. https://doi.org/10.4230/OASIcs.ICCSW.2012.156
    Xu, Hu ; Petrie, Karen. / Self-learning genetic algorithm for constrains satisfaction problems. 2012 Imperial College Computing Student Workshop: ICCSW 2012. editor / Andrew V. Jones. Vol. 28 Leibnitz, Austria : Dagstuhl Publications, 2012. pp. 156-162 (Open Access Series in Informatics (OASIcs)).
    @inbook{6c5f7e0b3f4d4772860a8c8b6ed246eb,
    title = "Self-learning genetic algorithm for constrains satisfaction problems",
    abstract = "The efficient choice of a preprocessing level can reduce the search time of a constraint solver to find a solution to a constraint problem. Currently the parameters in constraint solver are often picked by hand by experts in the field. Genetic algorithms are a robust machine learning technology for problem optimization such as function optimization. Self-learning Genetic Algorithm are a strategy which suggests or predicts the suitable preprocessing method for large scale problems by learning from the same class of small scale problems. In this paper Self-learning Genetic Algorithms are used to create an automatic preprocessing selection mechanism for solving various constraint problems. The experiments in the paper are a proof of concept for the idea of combining genetic algorithm self-learning ability with constraint programming to aid in the parameter selection issue.",
    author = "Hu Xu and Karen Petrie",
    year = "2012",
    doi = "10.4230/OASIcs.ICCSW.2012.156",
    language = "English",
    isbn = "9783939897484",
    volume = "28",
    series = "Open Access Series in Informatics (OASIcs)",
    publisher = "Dagstuhl Publications",
    pages = "156--162",
    editor = "Jones, {Andrew V.}",
    booktitle = "2012 Imperial College Computing Student Workshop",

    }

    Xu, H & Petrie, K 2012, Self-learning genetic algorithm for constrains satisfaction problems. in AV Jones (ed.), 2012 Imperial College Computing Student Workshop: ICCSW 2012. vol. 28, Open Access Series in Informatics (OASIcs), vol. 28, Dagstuhl Publications, Leibnitz, Austria, pp. 156-162, 2nd Imperial College Computing Student Workshop, ICCSW 2012, London, United Kingdom, 27/09/12. https://doi.org/10.4230/OASIcs.ICCSW.2012.156

    Self-learning genetic algorithm for constrains satisfaction problems. / Xu, Hu; Petrie, Karen.

    2012 Imperial College Computing Student Workshop: ICCSW 2012. ed. / Andrew V. Jones. Vol. 28 Leibnitz, Austria : Dagstuhl Publications, 2012. p. 156-162 (Open Access Series in Informatics (OASIcs); Vol. 28).

    Research output: Chapter in Book/Report/Conference proceedingChapter

    TY - CHAP

    T1 - Self-learning genetic algorithm for constrains satisfaction problems

    AU - Xu, Hu

    AU - Petrie, Karen

    PY - 2012

    Y1 - 2012

    N2 - The efficient choice of a preprocessing level can reduce the search time of a constraint solver to find a solution to a constraint problem. Currently the parameters in constraint solver are often picked by hand by experts in the field. Genetic algorithms are a robust machine learning technology for problem optimization such as function optimization. Self-learning Genetic Algorithm are a strategy which suggests or predicts the suitable preprocessing method for large scale problems by learning from the same class of small scale problems. In this paper Self-learning Genetic Algorithms are used to create an automatic preprocessing selection mechanism for solving various constraint problems. The experiments in the paper are a proof of concept for the idea of combining genetic algorithm self-learning ability with constraint programming to aid in the parameter selection issue.

    AB - The efficient choice of a preprocessing level can reduce the search time of a constraint solver to find a solution to a constraint problem. Currently the parameters in constraint solver are often picked by hand by experts in the field. Genetic algorithms are a robust machine learning technology for problem optimization such as function optimization. Self-learning Genetic Algorithm are a strategy which suggests or predicts the suitable preprocessing method for large scale problems by learning from the same class of small scale problems. In this paper Self-learning Genetic Algorithms are used to create an automatic preprocessing selection mechanism for solving various constraint problems. The experiments in the paper are a proof of concept for the idea of combining genetic algorithm self-learning ability with constraint programming to aid in the parameter selection issue.

    UR - http://www.scopus.com/inward/record.url?scp=84874705139&partnerID=8YFLogxK

    U2 - 10.4230/OASIcs.ICCSW.2012.156

    DO - 10.4230/OASIcs.ICCSW.2012.156

    M3 - Chapter

    AN - SCOPUS:84874705139

    SN - 9783939897484

    VL - 28

    T3 - Open Access Series in Informatics (OASIcs)

    SP - 156

    EP - 162

    BT - 2012 Imperial College Computing Student Workshop

    A2 - Jones, Andrew V.

    PB - Dagstuhl Publications

    CY - Leibnitz, Austria

    ER -

    Xu H, Petrie K. Self-learning genetic algorithm for constrains satisfaction problems. In Jones AV, editor, 2012 Imperial College Computing Student Workshop: ICCSW 2012. Vol. 28. Leibnitz, Austria: Dagstuhl Publications. 2012. p. 156-162. (Open Access Series in Informatics (OASIcs)). https://doi.org/10.4230/OASIcs.ICCSW.2012.156