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.

Linked References

  1. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, vol. 5, pp. 4104–4108, IEEE Press, Orlando, Fla, USA, October 1997. View at Publisher · View at Google Scholar
  2. M. Clerc, “The swarm and the queen: towards a deterministic and adaptive particle swarm optimization,” in Proceedings of the IEEE Congress of Evolutionary Computation (CEC '99), vol. 3, Washington, DC, USA, July 1999. View at Publisher · View at Google Scholar
  3. A. Moraglio, C. D. Chio, and R. Poli, “Geometric particle swarm optimization,” in Proceedings of the 10th European Conference Genetic Programming (EuroGP '07), pp. 125–136, Valencia, Spain, April 2007. View at Publisher · View at Google Scholar
  4. T. Gong and A. L. Tuson, “Binary particle swarm optimization: a forma analysis approach,” in Proceedings of 9th Annual Conference on Genetic and Evolutionary Computation (GECCO '07), p. 172, ACM, London, UK, July 2007. View at Publisher · View at Google Scholar
  5. M. F. Tasgetiren, Y.-C. Liang, M. Sevkli, and G. Gencyilmaz, “A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem,” European Journal of Operational Research, vol. 177, no. 3, pp. 1930–1947, 2007. View at Publisher · View at Google Scholar
  6. M. Clerc, Particle Swarm Optimization, ISTE, London, UK, 2006.
  7. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Perth, WA, Australia, November-December 1995. View at Publisher · View at Google Scholar
  8. Y. Shi and R. C. Eberhart, “A modified particle swarm optimizer,” in Proceedings of the IEEE Congress on Evolutionary Computation (ICEC '98), pp. 69–73, IEEE Press, Anchorage, Alaska, USA, May 1998. View at Publisher · View at Google Scholar
  9. Y. Shi and R. C. Eberhart, “Parameter selection in particle swarm optimization,” in Proceedings of the 7th Annual Conference on Evolutionary Programming (EP '98), pp. 591–600, San Diego, Calif, USA, March 1998.
  10. N. J. Radcliffe, “The algebra of genetic algorithms,” Annals of Mathematics and Artificial Intelligence, vol. 10, no. 4, pp. 339–384, 1994. View at Publisher · View at Google Scholar
  11. P. D. Surry, A prescriptive formalism for constructing domain-specific evolutionary algorithm [Ph.D. thesis, University of Edinburgh], Edinburgh, Scotland, UK, 1998.
  12. A. L. Tuson, No optimization without representation: a knowledge based systems view of evolutionary/neighbourhood search optimization [Ph.D. thesis, University of Edinburgh], Edinburgh, Scotland, UK, 1999.
  13. T. Gong and A. L. Tuson, “Formal descriptions of real parameter optimisation,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 2119–2126, IEEE Press, Vancouver, BC, Canada, July 2006. View at Publisher · View at Google Scholar
  14. C. Bierwirth, D. C. Mattfeld, and H. Kopfer, “On permutation representations for scheduling problems,” in Proceedings of the 4th International Conference on Parallel Problem Solving from Nature (PPSN '96), pp. 310–318, Springer, Berlin, Germany, September 1996.
  15. T. Gong and A. L. Tuson, “Enhanced forma analysis of permutation problems,” in Proceedings of 9th Annual Conference on Genetic and Evolutionary Computation (GECCO '07), pp. 923–930, ACM, London, UK, July 2007. View at Publisher · View at Google Scholar
  16. T. Gong and A. L. Tuson, “Differential evolution for binary encoding,” in Proceedings of the 11th Online World Conference on Soft Computing in Industrial Applications (WSC '06), A. Saad, E. Avineri, K. Dahal, M. Sarfraz, and R. Roy, Eds., vol. 39 of Advances in Soft Computing, Springer, September-October 2006.
  17. E. P. K. Tsang, Foundations of Constraint Satisfaction, Academic Press, London, UK, 1993.
  18. T. Bäck, D. B. Fogel, and Z. Michalewicz, Evolutionary Computation 1: Basic Algorithms and Operators, Institute of Physics, Bristol, UK, 2000.
  19. I. M. Oliver, D. J. Smith, and J. R. C. Holland, “A study of permutation crossover operators on the traveling salesman problem,” in Proceedings of the 2nd International Conference on Genetic Algorithms on Genetic Algorithms and Their Application (ICGA '87), J. J. Grefenstette, Ed., Lawrence Erlbaum Associates, Cambridge, Mass, USA, July 1987.
  20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press, Cambridge, Mass, USA, 2nd edition, 2001.
  21. M. DeLeon, “A study of sufficient conditions for hamiltonian cycles,” Department of Mathematics and Computer Science, Seton Hall University, South Orange, NJ, USA, 2000. View at Google Scholar
  22. T. Starkweather, S. McDaniel, K. Mathias, C. Whitley, and D. Whitley, “A comparison of genetic sequencing operators,” in Proceedings of the 4th International Conference on Genetic Algorithms (ICGA '91), R. Belew and L. Booker, Eds., Morgan Kaufmann, San Diego, Calif, USA, July 1991.
  23. L. Steinberg, “The backboard wiring problem: a placement algorithm,” SIAM Rview, vol. 3, no. 1, pp. 37–50, 1961. View at Publisher · View at Google Scholar
  24. A. Elshafei, “Hospital layout as a quadratic assignment problem,” Operational Research Quarterly, vol. 28, no. 1, pp. 167–179, 1977. View at Google Scholar
  25. A. Geoffrion and G. Graves, “Scheduling parallel production lines with changeover costs: practical application of a quadratic assignment/lp approach,” Operations Research, vol. 24, no. 4, pp. 595–610, 1976. View at Google Scholar
  26. T. Stützle and M. Dorigo, “ACO algorithms for the quadratic assignment problem,” in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds., pp. 33–50, McGraw-Hill, London, UK, 1999. View at Google Scholar
  27. R. Battiti and G. Tecchiolli, “The reactive tabu search,” ORSA Journal on Computing, vol. 2, no. 6, pp. 126–140, 1994. View at Google Scholar
  28. R. E. Burkard and F. Rendl, “A thermodynamically motivated simulation procedure for combinatorial optimization problems,” European Journal of Operational Research, vol. 17, no. 2, pp. 169–174, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  29. R. E. Burkard, S. Karisch, and F. Rendl, “QAPLIB-A quadratic assignment problem library,” European Journal of Operational Research, vol. 55, no. 1, pp. 115–119, 1991. View at Publisher · View at Google Scholar
  30. E. D. Taillard, “Comparison of iterative searches for the quadratic assignment problem,” Location Science, vol. 3, no. 2, pp. 87–105, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  31. M.-H. Lim, Y. Yuan, and S. Omatu, “Extensive testing of a hybrid genetic algorithm for solving quadratic assignment problems,” Computational Optimization and Applications, vol. 23, no. 1, pp. 47–64, 2002. View at Publisher · View at Google Scholar · View at MathSciNet