Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Solving N-queen Problem Using Genetic Algorithm by Advance Mutation Operator

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 8 No. 6 (2018)

DOI
10.11591/ijece.v8i6.pp4519-4523
ISSN
2088-8708, 2088-8708
Terbit
2018-12-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-nc/4.0

Abstrak

N-queen problem represents a class of constraint problems. It belongs to set of NP-Hard problems. It is applicable in many areas of science and engineering. In this paper N-queen problem is solved using genetic algorithm. A new genetic algoerithm is proposed which uses greedy mutation operator. This new mutation operator solves the N-queen problem very quickly. The proposed algorithm is applied on some instances of N-queen problem and results outperforms the previous findings.

Jaringan kolaborasi para penulis

2 penulis · 1 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • MVN University
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Solving N-queen Problem Using Genetic Algorithm by Advance Mutation Operator</dc:title><dc:creator>Jain, Vinod</dc:creator><dc:creator>Prasad, Jay Shankar</dc:creator><dc:description>&lt;jats:p&gt;N-queen problem represents a class of constraint problems. It belongs to set of NP-Hard problems. It is applicable in many areas of science and engineering. In this paper N-queen problem is solved using genetic algorithm. A new genetic algoerithm is proposed which uses greedy mutation operator. This new mutation operator solves the N-queen problem very quickly. The proposed algorithm is applied on some instances of N-queen problem and results outperforms the previous findings.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2018-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v8i6.pp4519-4523</dc:identifier><dc:identifier>10.11591/ijece.v8i6.pp4519-4523</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 8 No 6 (2018); 4519</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/9604/11278</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>