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 条
  • [41] Deep Reinforcement Learning Algorithm for Permutation Flow Shop Scheduling Problem
    Yang, Yuanyuan
    Qian, Bin
    Hu, Rong
    Zhang, Dacheng
    INTELLIGENT COMPUTING METHODOLOGIES, PT III, 2022, 13395 : 473 - 483
  • [42] Improved Hormone Algorithm for Solving the Permutation Flow Shop Scheduling Problem
    Zheng K.
    Lian Z.
    Wang Y.
    Zhu C.
    Gu X.
    Liu X.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2022, 51 (06): : 890 - 903
  • [43] A Plant Growth Simulation Algorithm for Permutation Flow Shop Scheduling Problem
    He, Zhenhong
    Li, Yueguang
    PROCEEDINGS OF THE 2015 INTERNATIONAL SYMPOSIUM ON COMPUTERS & INFORMATICS, 2015, 13 : 1444 - 1451
  • [44] Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
    Luo, Qifang
    Zhou, Yongquan
    Xie, Jian
    Ma, Mingzhi
    Li, Liangliang
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [45] A Genetic Algorithm for the Permutation Flow Shop-Problem: A parametric study
    Kouki, Samia
    Guenaoui, Manel
    Jemni, Mohamed
    2016 INTERNATIONAL SYMPOSIUM ON NETWORKS, COMPUTERS AND COMMUNICATIONS (ISNCC), 2016,
  • [46] A discrete Jaya algorithm for permutation flow-shop scheduling problem
    Mishra, Aseem K.
    Pandey, Divya
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2020, 11 (03) : 415 - 428
  • [47] Modified Cuckoo Search Algorithm for Solving Permutation Flow Shop Problem
    Zheng, Hong-Qing
    Zhou, Yong-Quan
    Xie, Cong
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 714 - 721
  • [48] Ant colony optimization for multi-objective flow shop scheduling problem
    Yagmahan, Betul
    Yenisey, Mehmet Mutlu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (03) : 411 - 420
  • [49] An Effective Ant Colony Optimization-Based Algorithm for Flow Shop Scheduling
    Chen, Ruey-Maw
    Lo, Shih-Tang
    Wu, Chung-Lun
    Lin, Tsung-Hung
    2008 IEEE CONFERENCE ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS SMCIA/08, 2009, : 101 - +
  • [50] Ant Colony Search Algorithm for the Optimal Power Flow Problem
    Soares, J.
    Sousa, T.
    Vale, Z. A.
    Morais, H.
    Faria, P.
    2011 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING, 2011,
12345