Variable neighborhood search for the second type of two-sided assembly line balancing problem

2016 ◽  
Vol 72 ◽  
pp. 183-188 ◽  
Author(s):  
Deming Lei ◽  
Xiuping Guo
Keyword(s):  
Variable Neighborhood Search ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Neighborhood Search ◽  
Assembly Line Balancing Problem

scholarly journals An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem

2019 ◽  
Vol 37 (2) ◽  
pp. 501-521 ◽  
Author(s):  
Masood Fathi ◽  
Amir Nourmohammadi ◽  
Amos H.C. Ng ◽  
Anna Syberfeldt ◽  
Hamidreza Eskandari
Keyword(s):  
Genetic Algorithm ◽  
Variable Neighborhood Search ◽  
Assembly Line ◽  
Real Life ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Neighborhood Search ◽  
Improved Genetic Algorithm ◽  
Content Type ◽  
Assembly Line Balancing Problem

Purpose This study aims to propose an efficient optimization algorithm to solve the assembly line balancing problem (ALBP). The ALBP arises in high-volume, lean production systems when decision-makers aim to design an efficient assembly line while satisfying a set of constraints. Design/methodology/approach An improved genetic algorithm (IGA) is proposed in this study to deal with ALBP to optimize the number of stations and the workload smoothness. Findings To evaluate the performance of the IGA, it is used to solve a set of well-known benchmark problems and a real-life problem faced by an automobile manufacturer. The solutions obtained are compared against two existing algorithms in the literature and the basic genetic algorithm. The comparisons show the high efficiency and effectiveness of the IGA in dealing with ALBPs. Originality/value The proposed IGA benefits from a novel generation transfer mechanism that improves the diversification capability of the algorithm by allowing population transfer between different generations. In addition, an effective variable neighborhood search is used in the IGA to enhance its local search capability.

scholarly journals Assembly Line Balancing the Comparison of COMSOAL and MSNSH Technique in Motorcycle Manufacturing Company

2012 ◽  
Vol 605-607 ◽  
pp. 166-174
Author(s):  
Areeda Lerttira ◽  
Prasad K.D.V. Yarlagadda
Keyword(s):  
Cycle Time ◽  
Manufacturing Systems ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Idle Time ◽  
Line Balancing ◽  
Neighborhood Search ◽  
Manufacturing Company ◽  
Assembly Line Balancing Problem

Today’s highly competitive market influences the manufacturing industry to improve their production systems to become the optimal system in the shortest cycle time as possible. One of most common problems in manufacturing systems is the assembly line balancing problem. The assembly line balancing problem involves task assignments to workstations with optimum line efficiency The most common purposes of Computer Method for Sequencing Operations for Assembly Line (COMSOAL) are to minimise idle time, optimise production line efficiency, and minimise the number of workstations. Therefore, this paper leads to implement COMSOAL to balance an assembly line in the motorcycle industry. The new solution by COMSOAL will be used to compare with the previous solution that was developed by Multi‐Started Neighborhood Search Heuristic (MSNSH), which will result in five aspects including cycle time, total idle time, line efficiency, average daily productivity rate, and the workload balance. The journal name “Optimising and simulating the assembly line balancing problem in a motorcycle manufacturing company: a case study” will be used as the case study for this project.

Sign in / Sign up

Export Citation Format

Share Document