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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE Int. Conf. on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)
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)
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)
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)
Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering 48, 409–425 (2005)
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)
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)
Gonzalez, T., Sahni, S.: Open-shop scheduling to minimize finish time. Journal of the Association for Computing Machinery 23(4), 665–679 (1976)
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)
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)
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)
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)
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)
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)
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)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: International Conference on Systems, Man, and Cybernetics (1997)
Clerc, M.: Discrete Particle Swarm Optimization: A Fuzzy Combinatorial Black Box, http://clerc.maurice.free.fr/pso/Fuzzy_Discrete_PSO/Fuzzy_DPSO.htm
Clerc, M.: Discrete particle swarm optimization, illustrated by the Traveling Salesman Problem. In: New Optimization Techniques in Engineering, Heidelberg, Germany, pp. 219–239 (2004)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(13), 671–680 (1983)
Mladenovic, N., Hansen, P.: Variable Neighborhood Search. Computer and Operations Research 24, 1097–1100 (1997)
Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operations Research 64, 278–285 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, Q., Sun, J., Zhang, J., Wang, C. (2006). A Hybrid Discrete Particle Swarm Algorithm for Open-Shop Problems. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_21
Download citation
DOI: https://doi.org/10.1007/11903697_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47331-2
Online ISBN: 978-3-540-47332-9
eBook Packages: Computer ScienceComputer Science (R0)