Balancing large assembly lines by a new heuristic based on differential evolution method

Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing

“…The versions of SALBP could be complemented by a secondary objective which consists of smoothing station loads (SALBP-SX ), i.e., equalizing the station times [10,11].…”

Large neighbourhood search algorithm for type-II assembly line balancing problem

“…In this sub-section, we have directly compared the proposed LNS algorithm to 15 formerly developed SALBP-II methods, 3 versions of genetic algorithm (pGA [48], rGA_prb and rGA_rks [49]), 4 versions of differential evaluation algorithm (DE-prb and DE_rks [27], IDEA_rd2 and IDEA_opt [28]), 3 petri net based heuristics (PNA_for, PNA_back and PNA_bid [15]), 4 versions of particle swarm optimization (PSO1, PSO2, PSO3 and PSO4 [26]) and iterated beam search (IBS [29]). The proposed LNS algorithm was coded in Matlab 7.9 and then the results were obtained by running the coded LNS on a Core(TM) i7-2640 CPU 2.80 GHz personal computer.…”

“…Another heuristic method that starts an initial solution and realizes trade, and transfer procedures to improve this solution was proposed in [16]. Genetic algorithms [17]- [19], tabu search procedures [20], [21], simulated annealing algorithms [22], [23], ant colony optimization algorithms [24], [25], particle swarm optimization algorithm [26], differential evolution algorithm [27], [28], beam search algorithm [28]- [30] and variable neighbourhood search [31], [32] were also used to solve SALBP-II. In this paper, we propose a large neighbourhood search (LNS) algorithm for solving the SALBP-II.…”

A population-based algorithm for the bi-objective assembly line worker assignment and balancing problem

“…Moreover, in our representation scheme, the sequence 3, 2, 1, 4 denotes that worker 3 should be assigned to station 1, worker 2 should be assigned to station 2, worker 1 to station 3 and worker 4 to station 4. Considering now the 'Tasks' part, after applying the topological order method (see Nearchou (2007) for details on this method) in accordance to the DAG of Fig. 1 we have the tasks sequence for assembly 1,2,4,6,3,5,7,8,9,10.…”

“…This mapping is as follows: for the first m genes the well-known random-keys technique (Bean, 1994) is applied to create a unique permutation of the integers 1,2,…,m. For the next n genes, the priority based encoding method is applied (Nearchou, 2007(Nearchou, , 2011 which takes into account the relative priorities imposed by the alleles and the constraints defined by the precedence graph for the ALBP under consideration.…”