Advertisement

PSO with Improved Strategy and Topology for Job Shop Scheduling

  • Kun Tu
  • Zhifeng Hao
  • Ming Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4222)

Abstract

Particle swarm optimization (PSO) has proven to be a promising heuristic algorithm for solving combinatorial optimization problems. However, N-P hard problems such as Job Shop Scheduling (JSSP) are difficult for most heuristic algorithms to solve. In this paper, two effective strategies are proposed to enhance the searching ability of the PSO. An alternate topology is introduced to gather better information from the neighborhood of an individual. Benchmarks of JSSP are used to test the approaches. The experiment results indicate that the improved Particle Swarm has a good performance with a faster searching speed in the search space of JSSP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Simulated Annealing Oper. Res. 40, 113–125 (1992)Google Scholar
  2. 2.
    Yin, A., Huang, W.: A stochastic strategy for solving job shop scheduling problem. In: Proceeding of the First International Conference of Machine Learning and Cybernetics (2002)Google Scholar
  3. 3.
    Zhang, H., Li, X., Zhou, P.: A Job Shop Oriented Virus Genetic Algorithm. In: Proceeding of the 5th World Congress on Intelligent Control and Automation (June 2004)Google Scholar
  4. 4.
    Kennedy, J., Mendes, R.: Population Structure and Particle Swarm Performance. In: IEEE 2002 (2002)Google Scholar
  5. 5.
    Kennedy, J.: Small Worlds and Mega-Minds: Effects of Neighborhood Topology on Particle Swarm Performance. In: IEEE 1999 (1999)Google Scholar
  6. 6.
    Kennedy, J., Neves, J.: The Fully Informed Particle Swarm: Simpler, Maybe Better. IEEE Transactions on Evolutionary Computation 8(3) (June 2004)Google Scholar
  7. 7.
    French, S.: Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop. John Wiley & Sons, Inc., New York (1982)zbMATHGoogle Scholar
  8. 8.
    Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th Symp. MicroMachine and Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  9. 9.
    Yang, C., Simon, D.: A new particle swarm optimization technique. In: 18th International Conference on Systems Engineering, ICSEng 2005, August 16-18, 2005, pp. 164–169 (2005)Google Scholar
  10. 10.
    Dorndorf, Pesch, E.: Evolution based learning in a job-shop environment. Computers and Operations Research 22, 25–40 (1995)zbMATHCrossRefGoogle Scholar
  11. 11.
    Bean: Genetic algorithms and Random Keys for sequencing and optimization. ORSA J. Computing 6, 154–160 (1994)zbMATHGoogle Scholar
  12. 12.
    Bierwirth: A generalized permutation approach to job-shop scheduling with genetic algorithms. OR SPEKTRUM 17(2-3), 870–892 (1995)Google Scholar
  13. 13.
    Hong-Fang, Z., Xiao-Ping, L., Pin, Z.: A job shop oriented virus genetic algorithm. In: Intelligent Control and Automation, WCICA 2004, Fifth World Congress, June 15-19, 2004, vol. 3, pp. 2132–2136 (2004)Google Scholar
  14. 14.
    Watanabe, M., Ida, K., Gen, M.: Active solution space and search on job-shop scheduling problem. Electrical Engineering in Japan 154(4), 61–67 (2006)CrossRefGoogle Scholar
  15. 15.
    Ling, W.: Shop Scheduling with Genetic Algorithm. Tsinghua University Press (2003)Google Scholar
  16. 16.
    Mattfeld, D.C., Vaessens, R.J.M.: OR-Library, http://mscmga.ms.ic.ac.uk/jeb/orlib/jobshopinfo.html
  17. 17.
    Wei-jun, X., Zhi-ming, W.: A hybrid particle swarm optimization approach for the job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 1433–3015 (2005)Google Scholar
  18. 18.
    Liu, B., Wang, L., Yi-Hui, J.: An effective hybrid particle swarm optimization for no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 1433–3015 (January 2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kun Tu
    • 1
    • 2
  • Zhifeng Hao
    • 1
    • 3
  • Ming Chen
    • 3
  1. 1.College of Computer Science and EngineeringSouth China University of TechnologyGuangzhouP.R. China
  2. 2.College of Mathematical ScienceSouth China University of TechnologyGuangzhouP.R. China
  3. 3.National Mobile Communications Research LaboratorySoutheast UniversityNanjingP.R. China

Personalised recommendations