CHAPTER 7 CONCLUSION AND FUTURE WORK
7.2 Future Works
There are two aspects for further research: (1) new PSO designs, and (2) other applications. We described some principles for new PSO designs in chapter 3. In the further research, we can develop new PSO designs by these principles and find out new design principles at the same time.
On the other hand, we can also implement the new PSO designs to other combinatorial optimization problems for example: assignment problems, network problems, multiobject combinatorial optimization problems…etc.
References
Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391-401.
Alcaide, D., Sicilia, J., & Vigo, D. (1997). Heuristic approaches for the minimum makespan open shop problem. Trabajos de Investigación Operativa, 5(2), 283-296.
Allahverdi, A, & Al-Anzi, F.S. (2006). A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application.
Computers and Operations Research, 33(4), 1056-1080.
Angeline, P.J. (1998). Using selection to improve particle swarm optimization.
Proceedings of the IEEE International Conference on Evolutionary Computation, 84–89.
Bagchi, T.P. (1999). Multiobjective scheduling by genetic algorithms. Kluwer Academic Publishers.
Balas, E., & Vazacopoulos, A. (1998). Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44(2), 262-275.
Bean, J. (1994). Genetic algorithms and random keys for sequencing and optimization.
Operations Research Society of America (ORSA) Journal on Computing, 6, 154-160.
Beasley J.E. (1990). OR-Library: distributing test problems by electronic mail.
Journal of the Operational Research Society, 14, 1069-1072.
Blum, C. (2005). Beam-ACO—hybridizing ant colony optimization with beam search:
and application to open shop scheduling. Computers & Operations Research, 32, 1565-1591.
Brucker, P., Hurink, J., Jurisch, B., & Wöstmann, B. (1997). A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76, 43-59.
Chu, P.C., & Beasley, J.E. (1998). A genetic algorithm for the multidimensional knapsack problem. Journal of Heuristic, 4, 63–86.
Colak, S., & Agarwal, A. (2005). Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem. Naval Research Logistics, 52, 631-644.
Davis, L. (1985). Job shop scheduling with genetic algorithm. Proceedings of the first International Conference on Genetic Algorithms, 163-140.
Dorndorf, U., Pesch, E., & Phan-Huy, T. (2001). Solving the open-shop scheduling problem. Journal of scheduling, 4(3), 157-174.
Drexl, A. (1988). A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing, 40, 1–8.
Eberhart R., & Shi Y. (2001). Particle swarm optimization: developments, applications and resources. Proceedings of the 2001 IEEE Congress on Evolutionary Computation, 81-86.
Fisher, H., & Thompson, G.L. (1963). Industrial Scheduling. Englewood Cliffs, NJ:
Prentice-Hall.
French, S. (1982). Sequencing and scheduling: an introduction to the mathematics of the job-shop. UK: Horwood.
Fréville, A. (2004). The multidimensional 0–1 knapsack problem: An overview.
European Journal of Operational Research, 155(1), 1–21.
Fréville, A., & Hanafi, S. (2005). The multidimensional 0-1 knapsack problem — bounds and computational aspects. Annals of Operations Research, 139, 195–227.
Garey, M.R., Johnson, D.S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117-129.
Gen, M., & Cheng, R. (1997). Genetic algorithms and engineering design. New York:
Wiley.
Giffler, J., & Thompson, G.L. (1960). Algorithms for solving production scheduling problems. Operations Research, 8, 487-503.
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533-549.
Glover, F. (1989). Tabu search: Part I. ORSA Journal on Computing, 1, 190-206.
Glover, F. (1990). Tabu search: Part II. ORSA Journal on Computing, 2, 4-32.
Glover, F., & Kochenberger G.A. (1996). Critical event tabu search for multidimensional knapsack problems, in I.H. Osman, and J.P. Kelly, (Eds.), Metaheuristics: The Theory and Applications, Kluwer Academic Publishers,
Dordrecht, pp.407–427.
Goldberg, D.E. (2002). The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Dordrecht.
Gonçalves, J.F., & Beirão, N.C., (1999). Um Algoritmo Genético Baseado em Chaves Aleatórias para Sequenciamento de Operações. Revista Associação Portuguesa de Desenvolvimento e Investigação Operacional 19, 123-137 (in Portuguese).
Gonçalves, J.F., Mendes, J.J. M., & Resende, M.G.C. (2005). A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167(1), 77-95.
Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time.
Journal of the ACM, 23(4), 665-679.
Guéret, C., & Prins, C. (1998). Classical and new heuristics for the open-shop problem: a computational evaluation, European Journal of Operational Research, 107(2), 306-314.
Guéret, C., & Prins, C. (1999). A new lower bound for the open-shop problem. Annals of Operations Research, 92, 165-183.
Hanafi, S., & Fréville, A. (1998). An efficient tabu search approach for the 0-1 multidimensional knapsack problem. European Journal of Operational Research, 106, 659–675.
Jain, A.S., Rangaswamy, B., & Meeran, S. (2000). New and “stronger” job-shop neighbourhoods: a focus on the method of Nowicki and Smutnicki (1996).
Journal of Heuristics, 6, 457-480.
Jin, Y.X., Cheng, H.Z., Yan, J.Y., Zhang, L. (2007). New discrete method for particle swarm optimization and its application in transmission network expansion planning. Electric Power Systems Research, 77(3-4), 227-233.
Kennedy, J., & Eberhart, R.C. (1995). Particle swarm optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks, 4, 1942-1948.
Kennedy, J., & Eberhart, R.C. (1997). A discrete binary version of the particle swarm algorithm. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 5, 4104–4108.
Kobayashi, S., Ono, I., & Yamamura, M. (1995). An efficient genetic algorithm for job shop scheduling problems. Proceedings of the Sixth International
Conference on Genetic Algorithms, 506-511.
Lawrence, S., (1984). Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration (GSIA), Carnegie Mellon University, Pittsburgh, PA.
Li, N., Liu, F., Sun, D., & Huang, C. (2004). Particle Swarm Optimization for Constrained Layout Optimization. Proceedings of Fifth World Congress on Intelligent Control and Automation (WCICA 2004), 3, 2214-2218.
Lian, Z., Gu, X., & Jiao, B. (2006). A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation,175(1), 773-785.
Liao, C.J., Tseng, C.T., & Pin, L. (2007). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers and Operations Research, 34(10), 3099-3111.
Liaw, C-F. (1999a). Applying simulated annealing to the open shop scheduling problem. IIE Transactions, 31, 457-465.
Liaw, C-F. (1999b). A tabu search algorithm for the open shop scheduling problem.
Computers & Operations Research, 26, 109-126.
Liaw, C-F (2000). A hybrid genetic algorithm for the open shop scheduling problem.
European Journal of Operational Research, 124, 28-42.
Lourenço, H.R. (1995). Local optimization and the job-shop scheduling problem.
European Journal of Operational Research, 83, 347-364.
Mattfeld, D.C. (1996). Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling. Physica-Verlag, Heidelberg, Germany.
Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797-813.
Osorio, M.A., Glover, F., & Hammer, P. (2002). Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Annals of Operations Research, 117, 71–93.
Ow, P.S., & Morton, T.E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 297-307.
Pang, W., Wang, K.P., Zhou, C.G.., Dong, L.J., Liu, M., Zhang, H.Y., & Wang, J.Y.
(2004). Modified particle swarm optimization based on space transformation for solving traveling salesman problem. Proceedings of 2004 International Conference on Machine Learning and Cybernetics, 4, 2342-2346.
Pezzella, F., & Merelli, E. (2000). A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research, 120(2), 297-310.
Pirkul, H. (1987). A heuristic solution procedure for the multiconstraint zero-one knapsack problem. Naval Research Logistics, 34, 161–172.
Prins, C. (2000). Competitive genetic algorithms for the open-shop scheduling problem. Mathematical Methods of Operations Research, 52, 389-411.
Rastegar, R., Meybodi, M.R., & Badie, K. (2004). A new discrete binary particle swarm optimization based on learning automata. Proceedings of the IEEE International Conference on Machine Learning and Applications, 456–465.
Salman, A., Ahmad, I., & Al-Madani, S. (2002). Particle swarm optimization for task assignment problem. Microprocessors and Microsystems, 26(8), 363-371.
Sha, D.Y., & C.-Y. Hsu. (2006). “A modified parameterized active schedule generation algorithm for the job shop scheduling problem,” Proceedings of the 36th International Conference on Computers and Industrial Engineering (ICCIE 2006), pp. 702-712, Taiwan, ROC.
Shi Y, & Eberhart R.C. (1998a). Parameter selection in particle swarm optimization.
Proceedings of the 7th International Conference on Evolutionary Programming, 591-600.
Shi Y, & Eberhart R.C. (1998b). A modified particle swarm optimizer. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, 69-73.
Stacey, A., Jancic, M., & Grundy, I. (2003). Particle swarm optimization with mutation. Proceedings of the 2003 IEEE Congress on Evolutionary Computation, 2, 1425-1430.
Sun, D., Batta, R., & Lin, L. (1995). Effective job shop scheduling through active chain manipulation. Computers & Operations Research, 22(2), 159-172.
Taillard, E.D. (1993), Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278-285.
Tasgetiren, M.F., Liang, Y-C., Sevkli, M., & Gencyilmaz, G. (2007). A particle swarm
optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing. European Journal of Operational Research, 177(3), 1930-1947.
Vasquez, M., & Hao, J.K. (2001). A hybrid approach for the 0-1 multidimensional knapsack problem. Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1, 328–333.
Vasquez, M., & Vimont, Y. (2005). Improved results on the 0-1 multidimensional knapsack problem. European Journal of Operational Research, 165, 70–81.
Wang, K.P., Huang, L., Zhou, C.G., & Pang, W. (2003). Particle swarm optimization for traveling salesman problem. Proceedings of International Conference on Machine Learning and Cybernetics, 3, 1583-1585.
Wang, L., & Zheng, D. (2001). An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research, 28, 585-596.
Wu, B., Zhao, Y., Ma Y., Dong, H., & Wang, W. (2004). Particle Swarm Optimization method for Vehicle Routing Problem. Proceedings of Fifth World Congress on Intelligent Control and Automation (WCICA 2004), 3, 2219 – 2221.
Xia, W., & Wu, Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48(2), 409-425.
Yin, P.Y., Yu, S.S., Wang, P.P., & Wang, Y.T. (2007a). Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization.
Applied Mathematics and Computation, 184(2), 407-420.
Yin, P.Y., Yu, S.S., Wang, P.P, & Wang, Y.T. (2007b). Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization. The Journal of Systems & Software, 80(5), 724-735.
Zhang, H., Li, X., Li, H., & Huang, F. (2005). Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construction, 14, 393-404.
Zhang, H., Li, H., & Tam, C.M. (2006). Particle swarm optimization for resource-constrained project scheduling. International Journal of Project Management, 24(1), 83-92.
Zhi, X.H., Xing, X.L., Wang, Q.X., Zhang, L.H., Yang, X.W., Zhou, C.G., & Liang, Y.C. (2004). A discrete PSO method for generalized TSP problem. Proceedings
of 2004 International Conference on Machine Learning and Cybernetics, 4, 2378-2383.
作者簡介 (Biography)
姓名(Name)：徐誠佑 (Cheng-Yu Hsu) 學歷：
專士 明志工專 工業工程與管理科 (80.9~85.7)
學士 台灣科技大學 工業管理系 (88.9~90.7)
碩士 清華大學 工業工程與工程管理學系 (90.9~92.7)
博士 交通大學 工業工程與管理學系 (92.9~96.6)
著作：
一、 已接受之期刊論文
1. D.Y. Sha, C.-Y. Hsu, 2007, “A new particle swarm optimization for the open shop scheduling problem,” Computers and Operations Research (Accepted) (SCI).
2. D.Y. Sha, C.-Y. Hsu, 2006, “A hybrid particle swarm optimization for job shop scheduling problem,” Computers & Industrial Engineering, Vol. 51, No. 4, pp.
791-808 (SCI).
二、 審查中期刊論文
1. D.Y. Sha, C.-Y. Hsu, “A new discrete binary particle swarm optimization for the multidimensional 0-1 knapsack problem,” (submitted to European Journal of Operational Research) (SCI).
三、 研討會論文
1. D.Y. Sha, C.-Y. Hsu, 2006, “A particle swarm optimization with parameterized active schedules for the open shop scheduling problem,” Proceedings of the 2006 CIIE Annual Conference.
2. D.Y. Sha, C.-Y. Hsu, 2006, “A modified parameterized active schedule generation algorithm for the job shop scheduling problem,” Proceedings of the 36th International Conference on Computers and Industrial Engineering (ICCIE 2006), pp. 702-712, Taiwan, ROC.