A modified artificial bee colony for N-Queens problem

https://doi.org/10.65136/jati.v6i1.156
Artificial Bee Colony ABC N-Queens Parameter Complexity Time taken Success rate

Authors

  • De Long Sia School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Kong Zee Xin Emerson School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Sheng Jian Lim School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Jin Han Ling School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
  • Zailan Arabee bin Abdul Salam
    zailan@apu.edu.my
    School of Computing Asia Pacific University of Technology and Innovation (APU) Kuala Lumpur, Malaysia
Vol. 6 No. 1 (2022)
Original Research
January 16, 2026

Downloads

This paper is to solve the N-Queen problems with the implementation of the Artificial Bee Colony Algorithm. A modified Artificial Bee Colony algorithm is introduced in this paper to improve the efficiency and the effectiveness of solving the 64-Queens problem. In this paper, a few parameters of the algorithm are changed and compared to each other during the solving of the N-Queens problem, which leads to a better result. Parameters changed include colony population, trial limit, and shuffle range, which directly affect the algorithm; hence a best parameter combination is found for a 64-Queens problem with improvement.