A New Multi-objective Fully-Informed Particle Swarm Algorithm for Flexible Job-Shop Scheduling Problems

A novel Pareto-based multi-objective fully-informed particle swarm algorithm (FIPS) is proposed to solve flexible job-shop problems in this paper. Firstly, the population is ranked based on Pareto optimal concept. And the neighborhood topology used in FIPS is based on the Pareto rank. Secondly, the crowding distance of individuals is computed in the same Pareto level for the secondary rank. Thirdly, addressing the problem of trapping into the local optimal, the mutation operators based on the coding mechanism are introduced into our algorithm. Finally, the performance of the proposed algorithm is demonstrated by applying it to several benchmark instances and comparing the experimental results.

[1]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[2]  Shiyou Yang,et al.  A particle swarm optimization-based method for multiobjective design optimizations , 2005, IEEE Transactions on Magnetics.

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

[4]  Mauro Birattari,et al.  Swarm Intelligence , 2012, Lecture Notes in Computer Science.

[5]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

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

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

[8]  James Kennedy,et al.  Dynamic-probabilistic particle swarms , 2005, GECCO '05.