Future of Information and Communication Conference (FICC) 2025
28-29 April 2025
Publication Links
IJACSA
Special Issues
Future of Information and Communication Conference (FICC)
Computing Conference
Intelligent Systems Conference (IntelliSys)
Future Technologies Conference (FTC)
International Journal of Advanced Computer Science and Applications(IJACSA), Volume 7 Issue 10, 2016.
Abstract: Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dynamic Inertia Weight Particle Swarm Optimization (DIW-PSO). We propose the DIW-PSO to optimize a problem of finding a solution for Nonograms Puzzle. The experimental results demonstrate the suitability of DIW-PSO approach for solving Nonograms puzzles. The outcome results show that the proposed DIW-PSO approach is a good promising DIW-PSO for NP-Complete puzzles.
Habes Alkhraisat and Hasan Rashaideh, “Dynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles” International Journal of Advanced Computer Science and Applications(IJACSA), 7(10), 2016. http://dx.doi.org/10.14569/IJACSA.2016.071037
@article{Alkhraisat2016,
title = {Dynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2016.071037},
url = {http://dx.doi.org/10.14569/IJACSA.2016.071037},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {10},
author = {Habes Alkhraisat and Hasan Rashaideh}
}
Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.