An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints

被引:0
作者
Mellouli, Ahmed [1 ,4 ]
Mellouli, Racem [2 ]
Triki, Hager [3 ,4 ]
Masmoudi, Faouzi [4 ]
机构
[1] Univ Sousse, Natl Engn Sch Sousse ENISO, Sousse 4023, Tunisia
[2] Univ Sfax, Fac Econ & Management FSEGS, Lab Modeling & Optimizat Decis Ind & Logist Syst M, Sfax 3018, Tunisia
[3] Univ Sfax, Technopole Sfax, Higher Inst Ind Management ISGIS, Sfax 3021, Tunisia
[4] Univ Sfax, Natl Engn Sch Sfax ENIS, Lab Mech Modeling & Prod LA2MP, Sfax 1173, Tunisia
关键词
Assembly line balancing problem; Ant colony; Genetic algorithm; Cycle time; Productivity; Metaheuristics; DEPENDENT SETUP TIMES; FIXED NUMBER; BEAM SEARCH; MODEL; HEURISTICS; SOLVE; ASSIGNMENT; DESIGN; ACO;
D O I
10.1007/s10479-024-06071-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This study presents a particular case of type II assembly line balancing problem with task restrictions (TRALBP-2) in which the assembly tasks have to be assigned to workstations under precedence and zoning constraints. The objective is to minimize the cycle time for a fixed number of workstations. For a quick and efficient solution approach of this problem variant, we have developed a hybridization of two metaheuristics: the ant colony optimization and the genetic algorithm. This was motivated by the potential gain of merging the performances and strength levers of the two methods in terms of diversification and intensification to better escape convergence in local optima. The effectiveness of this approach was determined through various set of instances including those randomly generated, retrieved from the literature, and taken from a real-case study of an automotive cable company. The computational results reveal that the proposed method outperforms within reasonable time the existing solutions found in the literature.
引用
收藏
页码:903 / 935
页数:33
相关论文
共 93 条
[1]   Modeling and solving mixed-model assembly line balancing problem with setups. Part II: A multiple colony hybrid bees algorithm [J].
Akpinar, Sener ;
Baykasoglu, Adil .
JOURNAL OF MANUFACTURING SYSTEMS, 2014, 33 (04) :445-461
[2]   Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model [J].
Akpinar, Sener ;
Baykasoglu, Adil .
JOURNAL OF MANUFACTURING SYSTEMS, 2014, 33 (01) :177-187
[3]   Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks [J].
Akpinar, Sener ;
Bayhan, G. Mirac ;
Baykasoglu, Adil .
APPLIED SOFT COMPUTING, 2013, 13 (01) :574-589
[4]   A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints [J].
Akpinar, Sener ;
Bayhan, G. Mirac .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2011, 24 (03) :449-457
[5]   On the complexity of assembly line balancing problems [J].
Alvarez-Miranda, Eduardo ;
Pereira, Jordi .
COMPUTERS & OPERATIONS RESEARCH, 2019, 108 :182-186
[6]  
Anderson E. J., 1994, ORSA Journal on Computing, V6, P161, DOI 10.1287/ijoc.6.2.161
[7]   A taxonomy of line balancing problems and their solution approaches [J].
Battaia, Olga ;
Dolgui, Alexandre .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 142 (02) :259-277
[8]   Ant algorithms for a time and space constrained assembly line balancing problem [J].
Bautista, Joaquin ;
Pereira, Jordi .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) :2016-2032
[9]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[10]   Beam-ACO for Simple Assembly Line Balancing [J].
Blum, Christian .
INFORMS JOURNAL ON COMPUTING, 2008, 20 (04) :618-627