Ant colony optimization for the single machine early or tardy problem with distinct ready times

被引：0
|
作者：
Song, Yang [1 ]
Zhang, Zhihai [1 ]
Zheng, Li [1 ]
机构：
[1] Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
来源：
Qinghua Daxue Xuebao/Journal of Tsinghua University | 2005年 / 45卷 / 11期
关键词：
Algorithms; -; Applications; Bionics; Optimization; Testing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Single machine scheduling problems with distinct ready times and due dates are usually solved using heuristic algorithms. An ant colony optimization (ACO) algorithm was used to minimize the total weighted early and tardy penalties and to analyze the applicability of bionic algorithms. The adjacent pairwise interchange (API) method was used for a local search to improve the solution quality with idle times optimally inserted into each solution. The results of 90 tests made using the ACO algorithm compare well with results of the Branch and Bound method and the Tabu search method.
引用
收藏
页码：1577 / 1580
相关论文
共 50 条
12345