A hybrid ant colony algorithm for Job Shop Scheduling Problem

被引：0

作者：

Chen, Xuefang ^{[1
]}

Zhu, Qiong ^{[1
]}

Zhang, Jie ^{[1
]}

机构：

[1] Suzhou Vocat Univ, Dept Elect Mech Engn, Suzhou 215104, Jiangsu, Peoples R China

来源：

PROCEEDING OF THE SEVENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES | 2008年 / 7卷

关键词：

ant system; max-min Ant System; elitist strategy; dynamic parameter control; job shop scheduling;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Job Shop Scheduling Problem (JSSP) is one of the NP-hard problems. JSSP has been investigated from a variety of perspectives resulting in several techniques combining heuristic as well as problem specific strategies. A hybrid Ant Colony Algorithm (HACA) is proposed which is derived from the existing methods, in the mean time, dynamic parameter control mechanism is adopted with a dividable parameter 8 which gives a new variable to control the computational rate of ant algorithm. The procedure of using HACA to solve JSSP can be divided into 3 phases, i.e. prophase, metaphase and anaphase- Each phase adopts special pheromone release method and transition probability expression. The results obtained from experimental evaluation oil JSSP shows that HACA strongly enhance the computational and convergent rate of basic Ant System algorithm.

引用

页码：575 / 579

页数：5

共 50 条

[41] A novel algorithm for solving job-shop scheduling problem [J].

Muthiah, A. ;

Rajkumar, R. .

MECHANIKA, 2017, 23 (04) :610-616

[42] Application of data mining algorithm in job shop scheduling problem [J].

Wang Y. ;

Zhao Y. ;

Liu W. .

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2024, 30 (02) :520-536

[43] Genetic algorithm applications on Job Shop Scheduling Problem: A Review [J].

Bhatt, Nisha ;

Chauhan, Nathi Ram .

2015 INTERNATIONAL CONFERENCE ON SOFT COMPUTING TECHNIQUES AND IMPLEMENTATIONS (ICSCTI), 2015,

[44] Genetic Algorithm for Solving Job-Shop Scheduling Problem [J].

Li XiaoBo .

2011 INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND NEURAL COMPUTING (FSNC 2011), VOL IV, 2011, :296-298

[45] An efficient memetic algorithm for solving the job shop scheduling problem [J].

Gao, Liang ;

Zhang, Guohui ;

Zhang, Liping ;

Li, Xinyu .

COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (04) :699-705

[46] Hybrid Algorithm Based on Obstacle Graph Model and Tabu Search for Job Shop Scheduling Problem [J].

Huang L. ;

Zhao S. ;

Huang S. .

Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2023, 59 (16) :435-444and426

[47] A Hybrid Differential Evolution Algorithm for Job Shop Scheduling Problem to Minimize the Total Weighted Tardiness [J].

Wang Wei-ling ;

Yin Jing .

2013 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE AND ENGINEERING (ICMSE), 2013, :294-300

[48] Hybrid algorithm considering workload balance for solving the distributed heterogeneous job shop scheduling problem [J].

Fang Z.-C. ;

Li X.-Y. ;

Gao L. .

Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2024, 41 (06) :977-989

[49] Application Research for Multiobjective Low-Carbon Flexible Job-Shop Scheduling Problem Based on Hybrid Artificial Bee Colony Algorithm [J].

Gu, Xiaolin .

IEEE ACCESS, 2021, 9 :135899-135914

[50] Dynamic balance adaptive colony algorithm solving Job-Shop scheduling [J].

Wang, Yan-Hong ;

Wang, Wen-Xia ;

Yu, Hong-Xia ;

Chen, Li .

Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2013, 19 (10) :2521-2527

← 1 2 3 4 5 →