An improved preference-based variable neighborhood search algorithm with ar-dominance for assembly line balancing considering preventive maintenance scenarios

2022 ◽  
Vol 109 ◽  
pp. 104593
Author(s):  
Lianpeng Zhao ◽  
Qiuhua Tang ◽  
Zikai Zhang
Keyword(s):  
Preventive Maintenance ◽  
Variable Neighborhood Search ◽  
Assembly Line ◽  
Search Algorithm ◽  
Assembly Line Balancing ◽  
Line Balancing ◽  
Neighborhood Search ◽  
Neighborhood Search Algorithm

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.

A variable neighborhood search algorithm for optimal protection coordination of power systems

2021 ◽  
Author(s):  
H. R. E. H. Bouchekara ◽  
M. S. Shahriar ◽  
M. S. Javaid ◽  
Y. A. Sha’aban ◽  
M. Zellagui ◽  
...  
Keyword(s):  
Power Systems ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Neighborhood Search Algorithm ◽  
Optimal Protection

scholarly journals Two meta-heuristics for solving the multi-vehicle multi-covering tour problem with a constraint on the number of vertices

2020 ◽  
pp. 14-14
Author(s):  
Manel Kammoun ◽  
Houda Derbel ◽  
Bassem Jarboui
Keyword(s):  
Genetic Algorithm ◽  
Local Search ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Descent Method ◽  
Computational Experiments ◽  
Neighborhood Search ◽  
Variable Neighborhood Descent ◽  
Covering Tour Problem ◽  
Neighborhood Search Algorithm

In this work we deal with a generalized variant of the multi-vehicle covering tour problem (m-CTP). The m-CTP consists of minimizing the total routing cost and satisfying the entire demand of all customers, without the restriction of visiting them all, so that each customer not included in any route is covered. In the m-CTP, only a subset of customers is visited to fulfill the total demand, but a restriction is put on the length of each route and the number of vertices that it contains. This paper tackles a generalized variant of the m-CTP, called the multi-vehicle multi-covering Tour Problem (mm-CTP), where a vertex must be covered several times instead of once. We study a particular case of the mm-CTP considering only the restriction on the number of vertices in each route and relaxing the constraint on the length (mm-CTP-p). A hybrid metaheuristic is developet by combining Genetic Algorithm (GA), Variable Neighborhood Descent method (VND), and a General Variable Neighborhood Search algorithm (GVNS) to solve the problem. Computational experiments show that our approaches are competitive with the Evolutionary Local Search (ELS) and Genetic Algorithm (GA), the methods proposed in the literature.

Sign in / Sign up

Export Citation Format

Share Document