Table of Contents
Journal of Artificial Evolution and Applications
Volume 2008, Article ID 587309, 16 pages
http://dx.doi.org/10.1155/2008/587309
Research Article

Forma Analysis of Particle Swarm Optimisation for Permutation Problems

Department of Computing, City University, London EC1V 0HB, UK

Received 20 July 2007; Revised 20 January 2008; Accepted 1 April 2008

Academic Editor: Riccardo Poli

Copyright © 2008 Tao Gong and Andrew L. Tuson. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [4 citations]

The following is the list of published articles that have cited the current article.

  • Pavel Kromer, Jan Janousek, and Jan Platos, “Random Key Self–Organizing Migrating Algorithm for Permutation Problems,” 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 2878–2885, . View at Publisher · View at Google Scholar
  • Jianxian Zhang, Duan Zhou, and Yintang Yang, “System Reliability-Aware Energy Optimization for Network-on-Chip with Voltage-Frequency Islands,” 2013 International Conference on Information Science and Cloud Computing Companion, pp. 117–122, . View at Publisher · View at Google Scholar
  • Colin G. Johnson, “A design framework for metaheuristics,” Artificial Intelligence Review, vol. 29, no. 2, pp. 163–178, 2009. View at Publisher · View at Google Scholar
  • Chin-Chia Wu, Shang-Chia Liu, Chuanli Zhao, Sheng-Zhi Wang, and Win-Chin Lin, “A Multi-Machine Order Scheduling with Learning Using the Genetic Algorithm and Particle Swarm Optimization,” The Computer Journal, pp. 1–18, 2017. View at Publisher · View at Google Scholar