Advertisement

A Hybrid Discrete Particle Swarm Algorithm for Open-Shop Problems

  • Qingyun Yang
  • Jigui Sun
  • Juyang Zhang
  • Chunjie Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)

Abstract

A hybrid discrete particle swarm algorithm is presented in this paper to solve open-shop problems. The operations are redefined in the discrete particle swarm algorithm. To improve the performance the simulated annealing algorithm is combined with discrete particle swarm. We use SA to enhance the results of local best positions instead of current positions. The experimental results show that our hybrid discrete particle swarm algorithm is effective and efficient to solve open-shop problems.

Keywords

Particle Swarm Optimization Schedule Problem Particle Swarm Simulated Annealing Algorithm Open Shop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 382–390. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Tasgetiren, M.F., Sevkli, M., Liang, Y.-C., Gencyilmaz, G.: Particle Swarm Optimization Algorithm for Single Machine Total Weighted Tardiness Problem. In: Proc. of the 2004 Congress on Evolutionary Computation (CEC 2004), Portland, Oregon, June 20-23, 2004, pp. 1412–1419 (2004)Google Scholar
  4. 4.
    Tasgetiren, M.F., Liang, Y.-C., Sevkli, M., Gencyilmaz, G.: Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem. In: Proc. of the 4th International Symposium on Intelligent Manufacturing Systems (IMS 2004), Sakarya, Turkey, September 6-8, 2004, pp. 431–441 (2004)Google Scholar
  5. 5.
    Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering 48, 409–425 (2005)CrossRefGoogle Scholar
  6. 6.
    Ai-ling, C., Gen-ke, Y., Zhi-ming, W.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University SCIENCE A 7(4), 607–614 (2006)CrossRefGoogle Scholar
  7. 7.
    Rameshkumar, K., Suresh, R.K., Mohanasundaram, K.M.: Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makspan. In: Wang, L., Chen, K., Ong, Y.S. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 572–581. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Gonzalez, T., Sahni, S.: Open-shop scheduling to minimize finish time. Journal of the Association for Computing Machinery 23(4), 665–679 (1976)MATHMathSciNetGoogle Scholar
  9. 9.
    Guret, C., Jussien, N.: Combining AI/OR techniques for solving Open Shop problems. In: Workshop on Integration of Operations Research and Artifical Intelligence techniques in Constraint Programming (CP-AI-OR) (1999)Google Scholar
  10. 10.
    Guret, C., Jussien, N., Prins, C.: Using intelligent backtracking to improve branch-and bound methods: An application to Open-Shop problems. European Journal of Operational Research 127, 344–354 (2000)CrossRefGoogle Scholar
  11. 11.
    Dorndorf, U., Pesch, E., Phan-Huy, T.: Constraint Propagation in Open Shop Scheduling. In: Proc. of the 7th International Workshop on Project Management and Scheduling, pp. 111–113 (2000)Google Scholar
  12. 12.
    Alcaide, D., Sicilia, J., Vigo, D.: A Tabu Search Algorithm for the Open Shop Problem. TOP (Trabajos de Investigacin Operativa) 5(2), 283–296 (1997)MATHMathSciNetGoogle Scholar
  13. 13.
    Khuri, S., Miryala, S.R.: Genetic algorithms for solving open shop scheduling problems. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 10–18. Springer, Heidelberg (1996)Google Scholar
  14. 14.
    Fang, H.-L., Ross, P., Corne, D.: A promising genetic algorithm approach to job-shop scheduling, re-scheduling, and open-shop scheduling problems. In: Proc. of the 5th International Conference on Genetic Algorithms, San Mateo, CA, USA, pp. 375–382 (1993)Google Scholar
  15. 15.
    Xu, Z., Louis, S.J.: Genetic algorithms for open shop scheduling and re-scheduling. In: Proc. of the ISCA 11th International Conference on Computers and Their Applications, Raleigh, NC, USA, pp. 99–102 (1996)Google Scholar
  16. 16.
    Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: International Conference on Systems, Man, and Cybernetics (1997)Google Scholar
  17. 17.
    Clerc, M.: Discrete Particle Swarm Optimization: A Fuzzy Combinatorial Black Box, http://clerc.maurice.free.fr/pso/Fuzzy_Discrete_PSO/Fuzzy_DPSO.htm
  18. 18.
    Clerc, M.: Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem. In: New Optimization Techniques in Engineering, Heidelberg, Germany, pp. 219–239 (2004)Google Scholar
  19. 19.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(13), 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computer and Operations Research 24, 1097–1100 (1997)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operations Research 64, 278–285 (1993)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Qingyun Yang
    • 1
    • 2
  • Jigui Sun
    • 1
    • 2
    • 3
  • Juyang Zhang
    • 1
    • 2
  • Chunjie Wang
    • 4
  1. 1.College of Computer Science and TechnologyJilin UniversityChangchunChina
  2. 2.Key Laboratory for Symbolic Computation and Knowledge, Engineering of Ministry of EducationJilin UniversityChangchunChina
  3. 3.Open Laboratory for Intelligence Information ProcessingFudan UniversityShanghaiChina
  4. 4.Basic Sciences of ChangChun University of TechnologyChangChun University of TechnologyChangchunChina

Personalised recommendations