Abstract
A novel algorithm, Multi-Agent Evolutionary Algorithm for n-Queen Problem (MAEAqueen), is proposed. In MAEAqueen, all agents live in a latticelike environment, with each agent fixed on a lattice-point. In order to increase energies, they compete with their neighbors, and they can also use knowledge. Theoretical analyses show that MAEAqueen has a linear space complexity. In the experiments, a comparison is made between MAEAqueen and the existing method based on agents. The results show that MAEAqueen outperforms the other method. Furthermore, to study the time complexity of MAEAqueen, the 104~107-queen problems are used. The results show that MAEAqueen has a linear time complexity. Even for 107-queen problems, it can find the exact solutions only by 150 seconds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sosič, R., Gu, J.: Efficient Local Search with Conflict Minimization: a Case Study of the n-queen Problem. IEEE Trans. on Knowledge and Data Engineering 6(5), 661–668 (1994)
Liu, J., Han, J., Tang, Y.Y.: Multi-agent Oriented Constraint Satisfaction. Artificial Intelligence 136(1), 101–144 (2002)
Liu, J.: Autonomous Agents and Multi-agent Systems: Explorations in Learning, Self-organization, and Adaptive Computation. World Scientific, Singapore (2001)
Homaifar, A., Turner, J., Ali, S.: The N-queens Problem and Genetic Algorithms. In: Proceedings of IEEE Southeastcon, Birmingham, USA, pp. 262–267 (1992)
Zhong, W., Liu, J., Xue, M., Jiao, L.: A Multiagent Genetic Algorithm for Global Numerical Optimization. IEEE Trans. Syst., Man, and Cybern. B 34(2), 1128–1141 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhong, W., Liu, J., Jiao, L. (2005). Evolutionary Agents for n-Queen Problems. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_44
Download citation
DOI: https://doi.org/10.1007/11539902_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)