Low Cost Journal,International Peer Reviewed and Refereed Journals,Fast Paper Publication approved journal IJEDR(ISSN 2321-9939) apply for ugc care approved journal, UGC Approved Journal, ugc approved journal, ugc approved list of journal, ugc care journal, care journal, UGC-CARE list, New UGC-CARE Reference List, UGC CARE Journals, ugc care list of journal, ugc care list 2020, ugc care approved journal, ugc care list 2020, new ugc approved journal in 2020, Low cost research journal, Online international research journal, Peer-reviewed, and Refereed Journals, scholarly journals, impact factor 7.37 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool)
INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH
(International Peer Reviewed,Refereed, Indexed, Citation Open Access Journal)
ISSN: 2321-9939 | ESTD Year: 2013

Current Issue

Call For Papers
January 2023

Volume 11 | Issue 1
Last Date : 29 January 2023
Review Results: Within 12-20 Days

For Authors

Archives

Indexing Partner

Research Area

LICENSE

Paper Details
Paper Title
N-QUEENS PROBLEM OPTIMIZATION USING VARIOUS MEMETIC ALGORITHMS
Authors
  Vishal Khanna,  Abhishek Bhardwaj,  Sarvesh Chopra

Abstract
NP hard problems like N-Queens problem are non-polynomial time problems. In this research study, we use the Simulated Annealing local search based MA (SALSMA), Genetic Algorithm(GA) and Hill-Climbing local search based MA (HCLSMA) to optimize N-Queens problem and make complexity analysis on the parameters viz. optimal solutions, time and convergence rate with respect to number of iterations. The MA is a hybrid algorithm, being a combination of the Genetic Algorithm (GA) and a local search algorithm. The performance of the MA is found to be superior to that of a solitary algorithm like GA. The MA solves the N-Queens in two stages. In the first stage, the randomly generated solutions are evolved till they become feasible (i.e., the hard constraints are satisfied) and in the second stage, these solutions are further evolved so as to minimize the violations of the soft constraints. In the final stage, the MA produces optimal solutions in which the hard as well as the soft constraints are completely satisfied.

Keywords- Queens, N-Queens, 8 Queens, Genetic Algorithm, Chromosome, Mutation, Selection, Crossover, Recombination, GA, MA, HCLSMA, SALSMA, Hill-Climbing, Simulated Annealing
Publication Details
Unique Identification Number - IJEDR1702196
Page Number(s) - 1206-1214
Pubished in - Volume 5 | Issue 2 | May 2017
DOI (Digital Object Identifier) -   
Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Vishal Khanna,  Abhishek Bhardwaj,  Sarvesh Chopra,   "N-QUEENS PROBLEM OPTIMIZATION USING VARIOUS MEMETIC ALGORITHMS", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.5, Issue 2, pp.1206-1214, May 2017, Available at :http://www.ijedr.org/papers/IJEDR1702196.pdf
Share This Article


Article Preview

ISSN Details




DOI Details



Providing A digital object identifier by DOI
How to get DOI?

For Reviewer /Referral (RMS)

Important Links

NEWS & Conference

Digital Library

Our Social Link

© Copyright 2023 IJEDR.ORG All rights reserved