Swapping algorithm and meta-heuristic solutions for combinatorial optimization n-queens problem

N. Vaughan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    This research proposes the swapping algorithm a new algorithm for solving the n-queens problem, and provides data from experimental performance results of this new algorithm. A summary is also provided of various meta-heuristic approaches which have been used to solve the n-queens problem including neural networks, evolutionary algorithms, genetic programming, and recently Imperialist Competitive Algorithm (ICA). Currently the Cooperative PSO algorithm is the best algorithm in the literature for finding the first valid solution. Also the research looks into the effect of the number of hidden nodes and layers within neural networks and the effect on the time taken to find a solution. This paper proposes a new swapping algorithm which swaps the position of queens.
    Original languageEnglish
    Title of host publicationProceedings of the 2015 Science and Information Conference, SAI 2015
    PublisherIEEE
    Pages102-104
    Number of pages3
    DOIs
    Publication statusPublished - 2015
    EventScience and Information Conference 2015 - London, United Kingdom
    Duration: 28 Jul 201530 Jul 2015

    Conference

    ConferenceScience and Information Conference 2015
    Abbreviated titleSAI 2015
    CountryUnited Kingdom
    CityLondon
    Period28/07/1530/07/15

    Fingerprint Dive into the research topics of 'Swapping algorithm and meta-heuristic solutions for combinatorial optimization n-queens problem'. Together they form a unique fingerprint.

    Cite this