A particle swarm optimization algorithm is extended for multi-objective optimization problems using new pbestlist and gbest list to store non-dominated solutions and it is applied to Multi-Objective Flexible Job Shop Scheduling Problems.Flexible Job Shop Scheduling Problem is an extension of Job Shop Scheduling Problems. To get better diversity and convergence,new approach to extract good information from pbest list and gbest list and new coding method specialized to Flexible Job ShopScheduling Problems are proposed. The computational results have shown that the proposed method could get betterperformance.
展开▼