Solving N-Queen Problem Using Repository Particle Swarm Optimization Algorithms

• Main Authors: Jane-Jang Wu, 吳建漳
• Other Authors: 邱昭彰
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/13722748794647121269

碩士 === 元智大學 === 資訊管理學系 === 95 === This research studies a storage grain of PSO algorithm method (Reposition PSO) to be called (RPSO), through RPSO the heuristic method and the storage empirical value memory way, makes PSO to solve in the question on has the efficiency, this article then processes each particle individual penetration dimension transformation matrix way the N-Queen Problem, through this method construction model to deal with the N-Queen Problem issue, simultaneously stores up the granule by the array method the discrete state and provides the calculating method to feed into the use, the reasonable application in the N-Queen Problem, this article by RPSO with other type of Algorithm method and the Gas Algorithm method (Genetic Algorithms, Ga) will confirm RPSO the potency to surpass other algorithm method, and confirmed the RPSO algorithm to compare has the validity and the uniformity.