scholarly journals Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 598 ◽  
Author(s):  
Zhiping Zuo ◽  
Yanhui Li ◽  
Jing Fu ◽  
Jianlin Wu
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Search Algorithm ◽  
Time Windows ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Service Personnel ◽  
The Stability

In situations where an organization has limited human resources and a lack of multi-skilled employees, organizations pay more and more attention to cost control and personnel arrangements. Based on the consideration of the service personnel scheduling as well as the routing arrangement, service personnel of different skills were divided into different types according to their multiple skills. A mathematical programming model was developed to reduce the actual cost of organization. Then, a hybrid meta heuristic that combines a tabu search algorithm with a simulated annealing was designed to solve the problem. This meta heuristic employs several neighborhood search operators and integrates the advantages of both the tabu search algorithm and the simulated annealing algorithm. Finally, the stability and validity of the algorithm were validated by the tests of several kinds of examples.

Study on Mechanical Bearing Capacity with Tabu Search Algorithm for Multi-Vehicle and Multi-Cargo Loading Problem

2013 ◽  
Vol 345 ◽  
pp. 3-6
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Bearing Capacity ◽  
Simulated Annealing Algorithm ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Neighborhood Structure ◽  
Loading Problem ◽  
Annealing Algorithm

This paper studies multi-vehicle and multi-cargo loading problem under the limited mechanical bearing capacity. 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. Firstly, for the operation, 1-move and 2-opt were applied. Secondly, through utilizing Boltzmann mechanism of simulated annealing algorithm, 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 the mechanical engineering examples.

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.

An augmented Tabu search algorithm for the green inventory-routing problem with time windows

2021 ◽  
Vol 60 ◽  
pp. 100802
Author(s):  
Mahdi Alinaghian ◽  
Erfan Babaee Tirkolaee ◽  
Zahra Kaviani Dezaki ◽  
Seyed Reza Hejazi ◽  
Weiping Ding
Keyword(s):  
Tabu Search ◽  
Search Algorithm ◽  
Time Windows ◽  
Tabu Search Algorithm ◽  
Inventory Routing ◽  
Routing Problem ◽  
Inventory Routing Problem

scholarly journals Pengembangan Algoritma Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS) untuk penyelesaian kasus Vehicle Routing Problem with Time Windows (VRPTW)

2017 ◽  
Vol 6 (1) ◽  
pp. 49
Author(s):  
Titi Iswari
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Simulated Annealing Algorithm ◽  
Time Windows ◽  
Heuristic Method ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Time Required

<p><em>Determining the vehicle routing is one of the important components in existing logistics systems. It is because the vehicle route problem has some effect on transportation costs and time required in the logistics system. In determining the vehicle routes, there are some restrictions faced, such as the maximum capacity of the vehicle and a time limit in which depot or customer has a limited or spesific opening hours (time windows). This problem referred to Vehicle Routing Problem with Time Windows (VRPTW). To solve the VRPTW, this study developed a meta-heuristic method called Hybrid Restart Simulated Annealing with Variable Neighborhood Search (HRSA-VNS). HRSA-VNS algorithm is a modification of Simulated Annealing algorithm by adding a restart strategy and using the VNS algorithm scheme in the stage of finding neighborhood solutions (neighborhood search phase). Testing the performance of HRSA-VNS algorithm is done by comparing the results of the algorithm to the Best Known Solution (BKS) and the usual SA algorithm without modification. From the results obtained, it is known that the algorithm perform well enough in resolving the VRPTW case with the average differences are -2.0% with BKS from Solomon website, 1.83% with BKS from Alvarenga, and -2.2% with usual SA algorithm without any modifications.</em></p><p><em>Keywords : vehicle routing problem, time windows, simulated annealing, VNS, restart</em></p>

Sign in / Sign up

Export Citation Format

Share Document