An Ant Colony Algorithm for Permutation Flow Shop Problem

被引：0
|
作者：
Shang, Ke [1 ]
Feng, Zuren [1 ]
Ke, Liangjun [1 ]
机构：
[1] Xi An Jiao Tong Univ, State Key Lab Mfg Syst Engn, Xian 710049, Peoples R China
来源：
PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012) | 2012年
基金：
国家教育部博士点专项基金资助;
关键词：
ant colony algorithm; finite grade pheromone; permutation flow shop problem; HEURISTIC METHOD;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, a new ant colony optimization algorithm, called finite grade ant colony optimization, is proposed to solve permutation flow shop problem, its main characteristic is that the updated quantities of pheromone trails are independent of objective function values, and the heuristic information provide by Moccellin is adopted. The developed algorithm has been applied to the benchmark problems given by Taillard, Comparison results demonstrate that the performance of the proposed algorithm is promising.
引用
收藏
页码：596 / 600
页数：5
相关论文
共 50 条
  • [21] Multiple colony ant algorithm for job-shop scheduling problem
    Udomsakdigool, A.
    Kachitvichyanukul, V.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (15) : 4155 - 4175
  • [22] A new ant colony algorithm for makespan minimization in permutation flow shops
    Ahmadizar, Fardin
    COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 63 (02) : 355 - 361
  • [23] Improved ant colony optimization algorithm for job shop scheduling problem
    Zhang, Zhi-Qiang
    Zhang, Jing
    Zhang, Xiang
    Li, Shu-Juan
    Yingyong Kexue Xuebao/Journal of Applied Sciences, 2010, 28 (02): : 182 - 188
  • [24] Application of Ant Colony Algorithm to Job-Shop Scheduling Problem
    Cao, Yan
    Lei, Lei
    Fang, Yadong
    PRECISION ENGINEERING AND NON-TRADITIONAL MACHINING, 2012, 411 : 407 - 410
  • [25] EFFICIENT ALGORITHM FOR LOT PERMUTATION FLOW SHOP SCHEDULING PROBLEM
    Dodu, Cristina Elena
    Ancau, Mircea
    PROCEEDINGS OF THE ROMANIAN ACADEMY SERIES A-MATHEMATICS PHYSICS TECHNICAL SCIENCES INFORMATION SCIENCE, 2021, 22 (03): : 231 - 238
  • [26] Heuristic Algorithm for Uncertain Permutation Flow-shop Problem
    Jozefczyk, Jerzy
    Cwik, Michal
    PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON COMPLEX INFORMATION SYSTEMS (COMPLEXIS), 2016, : 119 - 127
  • [27] A distributed algorithm for the Permutation Flow Shop Problem - An empirical analysis
    Kouki, Samia
    Jemni, Mohamed
    Ladhari, Talel
    PARALLEL COMPUTING: ACCELERATING COMPUTATIONAL SCIENCE AND ENGINEERING (CSE), 2014, 25 : 451 - 460
  • [28] A Hybrid Algorithm for a Robust Permutation Flow Shop Scheduling Problem
    Ni, Zhengbin
    Wang, Bing
    Wu, Bo
    PROCEEDINGS OF THE 32ND 2020 CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2020), 2020, : 3802 - 3807
  • [29] A Parallel Distributed Algorithm for the Permutation Flow Shop Scheduling Problem
    Kouki, Samia
    Ladhari, Talel
    Jemni, Mohamed
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 2, PROCEEDINGS, 2010, 6082 : 328 - +
  • [30] An efficient tabu search algorithm for the permutation flow shop problem
    Dong, Xingye
    Huang, Houktian
    Chen, Ping
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 499 - 504
12345