在线咨询
中国工业与应用数学学会会刊
主管：中华人民共和国教育部
主办：西安交通大学
ISSN 1005-3085  CN 61-1269/O1
工程数学学报

工程数学学报

• • 上一篇    下一篇

混合花朵授粉算法在作业车间调度中的应用

唐丽君,   彭石燕   

  1. 柳州铁道职业技术学院，柳州 545616
  • 出版日期:2022-12-15 发布日期:2022-12-15
  • 通讯作者: 彭石燕 E-mail: 237296281@qq.com
  • 基金资助:
    广西职业教育教学改革研究项目 (GXGZJG2019B157).

Hybrid Flower Pollination Algorithm for Job Shop Scheduling Problem

TANG Lijun,   PENG Shiyan   

  1. Liuzhou Railway Vocational Technical College, Liuzhou 545616
  • Online:2022-12-15 Published:2022-12-15
  • Contact: S. Peng. E-mail address: 237296281@qq.com
  • Supported by:
    The Research Project for Guangxi Vocational Education Teaching Reform (GXGZJG 2019B157).

PDF (PC)

254

摘要：

对最大完工时间最短的作业车间调度问题进行了研究，总结了当前求解作业车间调度问题的研究现状，提出一种花朵授粉算法与遗传算法的混合算法。混合算法以花朵授粉算法为基础，重新定义其全局搜索和局部搜索迭代公式，在同化操作过程中融入遗传算法的选择、优先交叉和变异操作，进一步增强算法的勘探能力。通过26个经典的基准算例仿真实验，并与近5年的其他算法比较，结果表明所提算法在求解作业车间调度问题具有一定优势。

关键词: 花朵授粉算法, 遗传算法, 作业车间调度, 最大完工时间

Abstract:

The job shop scheduling problem with the shortest maximum completion time is studied, and the current research status for the solution of the job shop scheduling problem is reviewed. A hybrid algorithm combining flower pollination algorithm with genetic algorithm is proposed. Based on the flower pollination algorithm, the iterative formula of global search and local search are redefined, and the selection, priority crossover and mutation operations of genetic algorithm are integrated into the assimilation operation, so as to further enhance the exploration ability of the proposed algorithm. Numerical testing on the 26 classic benchmark scheduling problems and comparison with other algorithms in recent 5 years show the proposed algorithm's advantages in solving job-shop scheduling problems.

Key words: flower pollination algorithm, genetic algorithm, job-shop scheduling problem, maximum completion time

中图分类号: