Hybrid meta-heuristic algorithms for U-shaped assembly line balancing problem with equipment and worker allocations

被引:7
作者
Khorram, Morteza [1 ]
Eghtesadifard, Mahmood [1 ]
Niroomand, Sadegh [2 ]
机构
[1] Shiraz Univ Technol, Dept Ind Engn, Shiraz, Iran
[2] Firouzabad Inst Higher Educ, Dept Ind Engn, Firouzabad, Fars, Iran
关键词
U-shaped assembly line balancing; Meta-heuristic algorithm; Worker assignment; NP-hard problem; Equipment assignment; MULTIOBJECTIVE GENETIC ALGORITHM; SIMULATED ANNEALING ALGORITHM; MIGRATING BIRDS OPTIMIZATION; SETUP TIMES; MODEL; STRAIGHT; LAYOUT; NETWORK; DESIGN; BRANCH;
D O I
10.1007/s00500-021-06472-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a new U-shaped assembly line balancing problem is studied. For the first time, the criteria such as equipment cost, number of stations and activity performing quality level are considered to be optimized simultaneously by activity to station and worker to station decisions. For this aim, a multi-objective nonlinear formulation is proposed and its linearized version is also presented. Since, according to the literature, the U-shaped assembly line balancing problem with equipment requirements is an NP-hard problem, the problem of this study is NP-hard too. Because of this complexity, the classical algorithms like simulated annealing, variable neighborhood search, and classical genetic algorithm with a novel encoding/decoding scheme are used as solution approaches. As an extension, two hybrid versions of the proposed classical algorithms are proposed according to the characteristics of the problem. In order to evaluate the proposed meta-heuristics, because the problem is new, some test problems are generated randomly. Computational study of the paper, including sensitivity analysis of the proposed meta-heuristics and final experiments on the test problems, proves the superiority of the hybrid versions of the classical algorithms.
引用
收藏
页码:2241 / 2258
页数:18
相关论文
共 57 条
[1]   Two-sided U-type assembly line balancing problem [J].
Agpak, Kursad ;
Yeguel, M. Fatih ;
Gokcen, Hadi .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (18) :5035-5047
[2]   A parametric procedure for multicriterion sequence scheduling for Just-In-Time mixed-model assembly lines [J].
Aigbedo, H ;
Monden, Y .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1997, 35 (09) :2543-2564
[3]   Applying genetic algorithms to the U-shaped assembly line balancing problem [J].
Ajenblit, DA ;
Wainwright, RL .
1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :96-101
[4]   Modified genetic algorithm for simple straight and U-shaped assembly line balancing with fuzzy processing times [J].
Alavidoost, M. H. ;
Zarandi, M. H. Fazel ;
Tarimoradi, Mosahar ;
Nemati, Yaser .
JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (02) :313-336
[5]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[6]   Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems [J].
Baykasoglu, A .
JOURNAL OF INTELLIGENT MANUFACTURING, 2006, 17 (02) :217-232
[7]   Modeling supermarket re-layout from the owner's perspective [J].
Boros, Peter ;
Feher, Orsolya ;
Lakner, Zoltan ;
Niroomand, Sadegh ;
Vizvari, Bela .
ANNALS OF OPERATIONS RESEARCH, 2016, 238 (1-2) :27-40
[8]   An advanced multiobjective genetic algorithm design for the time and space assembly line balancing problem [J].
Chica, Manuel ;
Cordon, Oscar ;
Damas, Sergio .
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (01) :103-117
[9]   Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm [J].
Delice, Yilmaz ;
Aydogan, Emel Kizilkaya ;
Ozcan, Ugur ;
Ilkay, Mehmet Sitki .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2017, 15 (01) :37-66
[10]   Balancing of U-type assembly systems using simulated annealing [J].
Erel, E ;
Sabuncuoglu, I ;
Aksu, BA .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2001, 39 (13) :3003-3015