A multi-population particle swarm optimization algorithm with random network for solving multi-resource constrained flexible job shop scheduling problems
CSTR:
Author:
Affiliation:

Clc Number:

TP301.6

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Multi-resource constrained flexible job shop scheduling problem (MRC-FJSP) is a kind of complex combinatorial optimization problem. A multi-population particle swarm optimization algorithm with random network (MPSO-RDnet) was proposed for solving MRC-FJSP with the objective to minimize makespan. First, a new decoding method which combines semi-active decoding and heuristic rule decoding was designed. The original solution space was cut out effectively. Second, two neighborhood structures based on the critical path were designed to improve the local search ability of the population, and a multi-population strategy based on the random network structure graph was added to improve the global search ability of the algorithm. A reinitialization strategy for the algorithm search stagnation was proposed to enhance the robustness of the algorithm. Numerical experiments verified the effectiveness and efficiency of proposed algorithm.

    Reference
    Related
    Cited by
Get Citation

崔航浩,张春江,李新宇.基于带随机网络的多种群粒子群优化算法求解多资源受限柔性作业车间调度问题[J].重庆大学学报,2022,45(4):56~66

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 09,2020
  • Revised:
  • Adopted:
  • Online: April 18,2022
  • Published:
Article QR Code