Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study

Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 79; pp. 78 - 93
Main Authors: Li, Zixiang, Tang, Qiuhua, Zhang, LiPing
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.03.2017
Pergamon Press Inc
Subjects:
Algorithms
Assembly line balancing
Assembly lines
Heuristic
Iterated greedy
Local search
Metaheuristics
Studies
Two-sided assembly line
Two-sided assembly line
Local search
Assembly line balancing
Iterated greedy
Metaheuristics
ISSN:0305-0548, 1873-765X, 0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have been proposed, leading to the different performances of these algorithms and unfair comparison. In this paper, two new decoding schemes with reduced search space are developed to balance the workload within a mated-station and reduce sequence-depended idle time. Then, graded objectives are employed to preserve the minor improvements on the solutions. Finally, a simple iterated greedy algorithm is extended for the two-sided assembly line balancing problem and modified NEH-based heuristic is introduced to obtain a high quality initial solution. And an improved local search with referenced permutation and reduced insert operators is developed to accelerate the search process. Computational results on benchmark problems prove the efficiency of the proposed decoding schemes and the new graded objectives. A comprehensive computational comparison among 14 meta-heuristics is carried out to demonstrate the efficiency of the improved iterated greedy algorithm. •Two new decoding schemes are developed and compared with existed ones.•Graded objectives are developed to preserve the tiny improvements•A simple and effective iterated greedy algorithm is applied and evaluated.•New local search is developed to reduce repeated insert operators.•All optimal solutions are obtained for the first time.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2016.10.006