China Mechanical Engineering

Previous Articles     Next Articles

An Improved Ant Colony Algorithm for Solving Single Machine Total Weighted Delay Scheduling Problem

QIAO Dongping1,2;PEI Jie1,2;WEN Xiaoyu1,2;XIAO Yanqiu1,2;JIAO Jianqiang1,2   

  1. 1.College of Mechanical and Electrical Engineering, Zhengzhou University of Light Industry, Zhengzhou, 450002
    2.Henan Key Laboratory of Intelligent Manufacturing of Mechanical Equipment, Zhengzhou, 450002
  • Online:2018-11-25 Published:2018-11-27

[车间调度]一种求解单机总加权延迟调度问题的改进蚁群算法

乔东平1,2;裴杰1,2;文笑雨1,2;肖艳秋1,2;焦建强1,2   

  1. 1. 郑州轻工业学院机电工程学院,郑州,450002
    2.河南省机械装备智能制造重点实验室,郑州,450002
  • 基金资助:
    国家自然科学基金资助项目(51775517)

Abstract: A single machine scheduling problem under minimized total weighted tardiness was studied, and an improved ant colony algorithm was proposed herein based on pheromone updating differently. The algorithm used a coding method which was based on job sequence, and improved the setting of heuristic information by priority rule of modified due date. The pheromone between nodes was updated adaptively and differently by the positive and negative feedback mechanism. A pairwise exchange strategy was used for local search to further improve the quality of scheduling scheme. Finally, simulations on multiple benchmark instances in OR-Library show that the proposed algorithm is feasible and effective.

Key words: ant colony algorithm, single machine scheduling, heuristic information, local optimization.

摘要: 针对极小化总加权延迟指标下的单机调度问题研究,提出一种基于信息素差异更新的改进蚁群算法。采用基于工件序列的编码方式,并结合修正交货期优先规则改进了启发式信息的设定;引入正负反馈机制来自适应地差异化更新各节点间信息素,同时将成对交换策略用于局部搜索,以进一步改善调度方案质量。结合OR-Library中多个基准实例的仿真验证了该算法的可行性和有效性。

关键词: 蚁群算法, 单机调度, 启发式信息, 局部优化

CLC Number: