scholarly journals An Order Effect of Neighborhood Structures in Variable Neighborhood Search Algorithm for Minimizing the Makespan in an Identical Parallel Machine Scheduling

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Ibrahim Alharkan ◽  
Khaled Bamatraf ◽  
Mohammed A. Noman ◽  
Husam Kaid ◽  
Emad S. Abouel Nasr ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Order Effect ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Neighborhood Structure ◽  
Identical Parallel Machine ◽  
Neighborhood Structures

Variable neighborhood search (VNS) algorithm is proposed for scheduling identical parallel machine. The objective is to study the effect of adding a new neighborhood structure and changing the order of the neighborhood structures on minimizing the makespan. To enhance the quality of the final solution, a machine based encoding method and five neighborhood structures are used in VNS. Two initial solution methods which were used in two versions of improved VNS (IVNS) are employed, namely, longest processing time (LPT) initial solution, denoted as HIVNS, and random initial solution, denoted as RIVNS. The proposed versions are compared with LPT, simulated annealing (SA), genetic algorithm (GA), modified variable neighborhood search (MVNS), and improved variable neighborhood search (IVNS) algorithms from the literature. Computational results show that changing the order of neighborhood structures and adding a new neighborhood structure can yield a better solution in terms of average makespan.

Study on Tabu Search Algorithm for Multi-Cargo Loading Problem

2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Initial Solution ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Loading Problem

The paper is focused on the Multi-cargo Loading Problem (MCLP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the construct initial solution to construct neighborhood structure. For the operation, 1-move and 2-opt were applied, it can also fasten the speed of convergence, and boost the search efficiency. Finally, the good performance of this algorithm can be proved by experiment calculation and concrete examples.

scholarly journals Buffer Allocation via Bottleneck-Based Variable Neighborhood Search

2020 ◽  
Vol 10 (23) ◽  
pp. 8569
Author(s):  
Sixiao Gao ◽  
Toshimitsu Higashi ◽  
Toyokazu Kobayashi ◽  
Kosuke Taneda ◽  
Jose I. U. Rubrico ◽  
...  
Keyword(s):  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Computation Time ◽  
State Probability ◽  
Neighborhood Search ◽  
Buffer Allocation ◽  
Neighborhood Structure ◽  
Production Lines ◽  
Solution Quality ◽  
Acceptable Solution

This study addresses the challenging problem of efficient buffer allocation in production lines. Suitable locations for buffer allocation are determined to satisfy the desired throughput, while a suitable balance between solution quality and computation time is achieved. A throughput calculation approach that yields the state probability of production lines is adopted to evaluate the effectiveness of candidate buffer allocation solutions. To generate candidate buffer allocation solutions, an active probability index based on state probability is proposed to rapidly detect suitable locations of buffer allocations. A variable neighborhood search algorithm is used to maintain acceptable solution quality; an additional neighborhood structure is used in the case where no satisfactory solution is generated in the initial neighborhood structure. Extensive numerical experiments demonstrate the efficacy of the proposed approach. The proposed approach can facilitate agile design of production lines in industry by rapidly estimating production line topologies.

Sign in / Sign up

Export Citation Format

Share Document