scholarly journals The Packing Heuristic For Assembly Line Balancing Problems

2011 ◽  
Vol 3 (3) ◽  
pp. 122 ◽  
Author(s):  
Francis J. Nourie ◽  
Enrique R. Venta
Keyword(s):  
Assembly Line ◽  
Heuristic Method ◽  
Assembly Line Balancing ◽  
Computational Effort ◽  
Line Balancing ◽  
Heuristic Methods ◽  
Computational Results ◽  
Simple Heuristic

This paper describes the packing principle for assembly line balancing problems, develops a simple heuristic method based on the principle, and explores the implications of the principle for other methods. Computational results shows that the proposed method compares favorably with two well-known heuristic methods and that the principle can be applied to improve these two methods with small additional computational effort.

Assembly Line Balancing Type-2 Using Unequal Multiple Operators

2013 ◽  
Vol 816-817 ◽  
pp. 1169-1173
Author(s):  
Usman Attique ◽  
Abdul Ghafoor ◽  
Riaz Ahmed ◽  
Shahid Ikramullah
Keyword(s):  
Cycle Time ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Computational Effort ◽  
Line Balancing ◽  
Heuristic Methods ◽  
Novel Approach ◽  
Assembly Line Balancing Problem

Various exact and heuristic methods have been proposed for assembly line balancing problem (ALBP) but unequal multiple operators have not been considered much. In this paper we present a novel approach of assembly line balancing Type-2 with unequal multiple operators by using an already developed code in Matlab (Tomlab modeling platform). The adopted approach can be applied at line balancing problems ranging from few to hundreds of work elements to achieve minimum cycle time with very less computational effort.

An Effective Grouping Evolution Strategy Algorithm Enhanced with Heuristic Methods for Assembly Line Balancing Problem

2019 ◽  
Vol 18 (03) ◽  
pp. 487-509
Author(s):  
Mazyar Ghadiri Nejad ◽  
Ali Husseinzadeh Kashan
Keyword(s):  
Assembly Line ◽  
Group Structure ◽  
Heuristic Method ◽  
Assembly Line Balancing ◽  
Evolution Strategy ◽  
Line Balancing ◽  
Test Problems ◽  
Production Volume ◽  
Assembly Line Balancing Problem ◽  
Positional Weight

Assembly line balancing problem (ALBP) is an allocation of given tasks to the workstations in a way that the number of workstations or the idle times of workstations get minimized. ALBP is a well-known problem in mass-production systems with high production volume and low diversity. In division and grouping allocation problems like ALBP, metaheuristic algorithms based on group structure, i.e. grouping genetic algorithm, are more efficient. The aim of this study is developing a new solution procedure to minimize the number of workstations for a given cycle time based on grouping evolution strategy. A modification of the ranked positional weight method is proposed to construct the initial solution, and a new heuristic method based on a modified version of the COMSOAL method is provided to tighten the solution after performing the mutation operator. Different strategies based on line efficiency and line smoothness indexes are considered to select the best result and transfer it to the next generation. Moreover, to evaluate the performance of proposed algorithms, some well-known standard test problems are utilized. Computational results indicate that the proposed solution algorithm performs efficiently and can obtain the optimal global solution in most of the high dimensional problems.

Optimization of a multi-constraint two-sided assembly line balancing problem using an improved imperialist competitive algorithm

2019 ◽  
Vol 40 (2) ◽  
pp. 273-282
Author(s):  
Mingshun Yang ◽  
Li Ba ◽  
Erbao Xu ◽  
Yan Li ◽  
Yong Liu ◽  
...  
Keyword(s):  
Development Strategy ◽  
Assembly Line ◽  
Heuristic Method ◽  
Assembly Line Balancing ◽  
Imperialist Competitive Algorithm ◽  
Hill Climbing ◽  
Line Balancing ◽  
Content Type ◽  
Competitive Algorithm ◽  
Assembly Line Balancing Problem

Purpose Assembly is the last step in manufacturing processes. The two-sided assembly line balancing problem (TALBP) is a typical research focus in the field of combinatorial optimization. This paper aims to study a multi-constraint TALBP-I (MC-TALBP-I) that involves positional constraints, zoning constraints and synchronism constraints to make TALBP more in line with real production. For enhancing quality of assembly solution, an improved imperialist competitive algorithm (ICA) is designed for solving the problem. Design/methodology/approach A mathematical model for minimizing the weighted sum of the number of mated-stations and stations is established. An improved ICA is designed based on a priority value encoding structure for solving MC-TALBP-I. Findings The proposed ICA was tested by several benchmarks involving positional constraints, zoning constraints and synchronism constraints. This algorithm was compared with the late acceptance hill-climbing (LAHC) algorithm in several instances. The results demonstrated that the ICA provides much better performance than the LAHC algorithm. Practical implications The best solution obtained by solving MC-TALBP-I is more feasible for determining the real assembly solution than the best solution obtained by solving based TALBP-I only. Originality/value A novel ICA based on priority value encoding is proposed in this paper. Initial countries are generated by a heuristic method. An imperialist development strategy is designed to improve the qualities of countries. The effectiveness of the ICA is indicated through a set of benchmarks.

Sign in / Sign up

Export Citation Format

Share Document