Ant colony optimisation with elitist ant for sequencing problem in a mixed model assembly line

被引:13
|
作者
Zhu, Qiong [1 ]
Zhang, Jie [1 ]
机构
[1] Shanghai Jiao Tong Univ, Inst Comp Integrated Mfg, Sch Mech Engn, Shanghai 200240, Peoples R China
基金
美国国家科学基金会; 国家高技术研究发展计划(863计划);
关键词
mixed model assembly line; sequencing; ant colony optimisation algorithm; elitist strategy; TABU SEARCH; HEURISTIC METHOD; ALGORITHM; TIME; SYSTEM; LEVEL;
D O I
10.1080/00207543.2010.493534
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Optimised sequencing in the Mixed Model Assembly Line (MMAL) is a major factor to effectively balance the rate at which raw materials are used for production. In this paper we present an Ant Colony Optimisation with Elitist Ant (ACOEA) algorithm on the basis of the basic Ant Colony Optimisation (ACO) algorithm. An ACOEA algorithm with the taboo search and elitist strategy is proposed to form an optimal sequence of multi-product models which can minimise deviation between the ideal material usage rate and the practical material usage rate. In this paper we compare applications of the ACOEA, ACO, and two other commonly applied algorithms (Genetic Algorithm and Goal Chasing Algorithm) to benchmark, stochastic problems and practical problems, and demonstrate that the use of the ACOEA algorithm minimised the deviation between the ideal material consumption rate and the practical material consumption rate under various critical parameters about multi-product models. We also demonstrate that the convergence rate for the ACOEA algorithm is significantly more than that for all the others considered.
引用
收藏
页码:4605 / 4626
页数:22
相关论文
共 50 条
  • [31] Dynamic Ant Colony Optimisation
    Daniel Angus
    Tim Hendtlass
    Applied Intelligence, 2005, 23 : 33 - 38
  • [32] Adaptive Dynamic Probabilistic Elitist Ant Colony Optimization in Traveling Salesman Problem
    Chatterjee A.
    Kim E.
    Reza H.
    SN Computer Science, 2020, 1 (2)
  • [33] Ant colony optimization for assembly lines design problem
    Chehade, H.
    Yalaoui, F.
    Amodeo, L.
    De Guglielmo, P.
    COMPUTATIONAL INTELLIGENCE IN DECISION AND CONTROL, 2008, 1 : 1135 - 1140
  • [34] Heuristics for ant colony optimisation using the generalised assignment problem
    Randall, M
    CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1916 - 1923
  • [35] Application with a hybrid ant colony optimisation in motif detecting problem
    Zhang, Yi
    Zhang, Meng
    Pei, Zhili
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2012, 44 (02) : 88 - 93
  • [36] Spiking neural P ant optimisation: a novel approach for ant colony optimisation
    Ramachandranpillai, R.
    Arock, M.
    ELECTRONICS LETTERS, 2020, 56 (24) : 1320 - 1322
  • [37] Accelerating ant colony optimisation for the travelling salesman problem on the GPU
    Uchida, Akihiro
    Ito, Yasuaki
    Nakano, Koji
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2014, 29 (04) : 401 - 420
  • [38] NetLogo implementation of an ant colony optimisation solution to the traffic problem
    Jerry, Kponyo
    Kuang Yujun
    Kwasi, Opare
    Enzhan, Zhang
    Parfait, Tebe
    IET INTELLIGENT TRANSPORT SYSTEMS, 2015, 9 (09) : 862 - 869
  • [39] Collection line optimisation in wind farms using improved ant colony optimisation
    Wu, Yi-wen
    Wang, Yong
    WIND ENGINEERING, 2021, 45 (03) : 589 - 600
  • [40] Route Optimisation by Ant Colony Optimisation Technique
    Ramtake, Dhammpal
    Kumar, Sanjay
    Patle, V. K.
    2ND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING, COMMUNICATION & CONVERGENCE, ICCC 2016, 2016, 92 : 48 - 55