scholarly journals An improved immune algorithm for simple assembly line balancing problem of type 1

2017 ◽  
Vol 11 (4) ◽  
pp. 317-326 ◽  
Author(s):  
Han-ye Zhang
Keyword(s):  
Assembly Line ◽  
Assembly Line Balancing ◽  
Immune Algorithm ◽  
Line Balancing ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly

An immune genetic algorithm for simple assembly line balancing problem of type 1

2019 ◽  
Vol 39 (1) ◽  
pp. 113-123 ◽  
Author(s):  
Han-ye Zhang
Keyword(s):  
Genetic Algorithm ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Immune Genetic Algorithm ◽  
Content Type ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly ◽  
First Time

Purpose The purpose of this study is to develop an immune genetic algorithm (IGA) to solve the simple assembly line balancing problem of type 1 (SALBP-1). The objective is to minimize the number of workstations and workstation load for a given cycle time of the assembly line. Design/methodology/approach This paper develops a new solution method for SALBP-1, and a user-defined function named ψ(·) is proposed to convert all the individuals to satisfy the precedence relationships during the operation of IGA. Findings Computational experiments suggest that the proposed method is efficient. Originality/value An IGA is proposed to solve the SALBP-1 for the first time.

An Improved Ant Colony Optimization for Large-Scale Simple Assembly Line Balancing Problem of Type-1

2012 ◽  
Vol 159 ◽  
pp. 51-55 ◽  
Author(s):  
Qiao Xian Zheng ◽  
Yuan Xiang Li ◽  
Ming Li ◽  
Qiu Hua Tang
Keyword(s):  
Ant Colony Optimization ◽  
Assembly Line ◽  
Assembly Line Balancing ◽  
Ant Colony ◽  
Line Balancing ◽  
Test Problems ◽  
Selection Mechanism ◽  
Assembly Line Balancing Problem ◽  
Simple Assembly

An improvement ant colony optimization(ACO) is proposed to solve the simple assembly line balancing problem of type-1 (SALBP-1) which aims to minimize the number of workstations for a given cycle time of assembly line. In the algorithm, three heuristic factors and two pheromones: (1) the pheromone between task and station, (2) the pheromone among tasks, are introduced to design the selection mechanism which is used to select task for station. The task assignment mechanism is proposed to assign suitable tasks to station. Ants select task based on selection mechanism, and then assign suitable one to station according to assignment mechanism. The result of literature test problems indicates the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document