Hybrid Genetic Algorithm for Solving Assembly Line Balancing Problem in Footwear Industry

2014 ◽  
Vol 939 ◽  
pp. 623-629 ◽  
Author(s):  
James C. Chen ◽  
Chien Wei Wu ◽  
Tran Dinh Duy Thao ◽  
Ling Huey Su ◽  
Wen Haiung Hsieh ◽  
...  

This research develops a heuristic algorithm for assembly line balancing problem (ALBP) of stitching lines in footwear industry. The proposed algorithm can help to design the stitching line with workstations, machines and operators for the production of every new product model. Rank-positional-weighted heuristics and hybrid genetic algorithms are proposed to solve ALBP. First, the heuristics assign tasks and machines to workstations. This solution is then used as an initiative population for hybrid genetic algorithm for further improvement. Real data from footwear manufacturers and experimental designs are used to verify the performance of the proposed algorithm, comparing with one existing bidirectional heuristic. Results indicate that when the size and shape of shoes increase, the proposed genetic algorithm achieves better solution quality than existing heuristics.Production managers can use the research results to quickly design stitching lines for short production cycle time and high labor utilization.

Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2157
Author(s):  
Eduardo Álvarez-Miranda ◽  
Jordi Pereira ◽  
Harold Torrez-Meruvia ◽  
Mariona Vilà

The assembly line balancing problem is a classical optimisation problem whose objective is to assign each production task to one of the stations on the assembly line so that the total efficiency of the line is maximized. This study proposes a novel hybrid method to solve the simple version of the problem in which the number of stations is fixed, a problem known as SALBP-2. The hybrid differs from previous approaches by encoding individuals of a genetic algorithm as instances of a modified problem that contains only a subset of the solutions to the original formulation. These individuals are decoded to feasible solutions of the original problem during fitness evaluation in which the resolution of the modified problem is conducted using a dynamic programming based approach that uses new bounds to reduce its state space. Computational experiments show the efficiency of the method as it is able to obtain several new best-known solutions for some of the benchmark instances used in the literature for comparison purposes.


Sign in / Sign up

Export Citation Format

Share Document