Dynamic Inertia Weight Particle Swarm Optimization for Solving Nonogram Puzzles
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2016, Vol 7, Issue 10
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.
Authors and Affiliations
Habes Alkhraisat, Hasan Rashaideh
Keywords
Related Articles
- EP ID EP96428
- DOI 10.14569/IJACSA.2016.071037
- Views 67
- Downloads 0
Classification based on Clustering Model for Predicting Main Outcomes of Breast Cancer using Hyper-Parameters Optimization
Breast cancer is a deadly disease in women. Predicting the breast cancer outcomes is very useful in determining the efficient treatment plan for the new breast cancer patients. Predicting the breast cancer outcomes (also...
An Efficient Deep Learning Model for Olive Diseases Detection
Worldwide, plant diseases adversely influence both the quality and quantity of crop production. Thus, the early detection of such diseases proves efficient in enhancing the crop quality and reducing the production loss....
Smart Or BAC
The emergence of the Internet of Things (IoT) paradigm, provides a huge scope for more streamlined living through an increase of smart services but this coincides with an increase in security and privacy concerns, theref...
Correlated Topic Model for Web Services Ranking
With the increasing number of published Web services providing similar functionalities, it’s very tedious for a service consumer to make decision to select the appropriate one according to her/his needs. In this paper, w...
TGRP: A New Hybrid Grid-based Routing Approach for Manets
Most existing grid-based routing protocols use reactive mechanisms to build routing paths. In this paper, we propose a new hybrid approach for grid-based routing in MANETs which uses a combination of reactive and proacti...