Improved multi-objective particle swarm optimization algorithm for service-workflows scheduling

Time-cost optimization problem in service-workflows is a hard to solve and widely existing problem in practical systems. In this paper, a improved multi-objective PSO method is proposed. By constructing discrete particles, Outside Population and Meshing method based on Niche Technique are introduced to obtain an evenly distributed Pareto set, Experimental results show that the proposed algorithm is effective and efficient for the considered problem. Many evenly distributed Pareto sets with high quality are obtained for various characteristic instances.

[1]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[2]  Tong Heng Lee,et al.  Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization , 2001, IEEE Trans. Evol. Comput..

[3]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[4]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[5]  Yuan Yingchun.  Hybrid particle swarm optimization algorithm for cost minimization in service-workflows with due dates , 2008 .

[6]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[7]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[8]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[9]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[10]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[11]  A. Neubauer.  THEORY OF GENETIC ALGORITHMS WITH α-SELECTION , 2008 .

[12]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[13]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[14]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[15]  Lothar M. Schmitt,et al.  Theory of genetic algorithms , 2001, Theor. Comput. Sci..

[16]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..