scholarly journals Optimal Route Planning for Truck–Drone Delivery Using Variable Neighborhood Tabu Search Algorithm

2022 ◽  
Vol 12 (1) ◽  
pp. 529
Author(s):  
Bao Tong ◽  
Jianwei Wang ◽  
Xue Wang ◽  
Feihao Zhou ◽  
Xinhua Mao ◽  
...  
Keyword(s):  
Tabu Search ◽  
Programming Model ◽  
Search Algorithm ◽  
Mixed Integer ◽  
Tabu Search Algorithm ◽  
Delivery Time ◽  
Neighborhood Structure ◽  
Search Range ◽  
Wide Range ◽  
Delivery Route

The optimal delivery route problem for truck–drone delivery is defined as a traveling salesman problem with drone (TSP-D), which has been studied in a wide range of previous literature. However, most of the existing studies ignore truck waiting time at rendezvous points. To fill this gap, this paper builds a mixed integer nonlinear programming model subject to time constraints and route constraints, aiming to minimize the total delivery time. Since the TSP-D is non-deterministic polynomial-time hard (NP-hard), the proposed model is solved by the variable neighborhood tabu search algorithm, where the neighborhood structure is changed by point exchange and link exchange to expand the tabu search range. A delivery network with 1 warehouse and 23 customer points are employed as a case study to verify the effectiveness of the model and algorithm. The 23 customer points are visited by three truck–drones. The results indicate that truck–drone delivery can effectively reduce the total delivery time by 20.1% compared with traditional pure-truck delivery. Sensitivity analysis of different parameters shows that increasing the number of truck–drones can effectively save the total delivery time, but gradually reduce the marginal benefits. Only increasing either the truck speed or drone speed can reduce the total delivery time, but not to the greatest extent. Bilateral increase of truck speed and drone speed can minimize the delivery time. It can clearly be seen that the proposed method can effectively optimize the truck–drone delivery route and improve the delivery efficiency.

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.

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.

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 Tabu Search Algorithm for Min-Max Vehicle Routing Problem

2011 ◽  
Vol 63-64 ◽  
pp. 160-163
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Routing Problem

The paper is focused on the Min-Max Vehicle Routing Problem (MMVRP). Tabu search algorithm is an algorithm based on neighborhood search. According to the features of the problem, the essay centered the longest route 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.

Study on Improved Tabu Search Algorithm for Min-Max Vehicle Routing Problem

2011 ◽  
Vol 87 ◽  
pp. 178-181 ◽  
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Search Efficiency ◽  
Speed Of Convergence ◽  
Neighborhood Structure ◽  
Routing Problem

The paper is focused on the Min-Max Vehicle Routing Problem. And solve this type of problems utilizing improved tabu search algorithm from the overall situation. According to the features of the problem, the essay centered the longest route to construct neighborhood structure. For the operation, 1-exchange 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.

Tabu Search Algorithm for for Capacitated Vehicle Routing Problem

2013 ◽  
Vol 753-755 ◽  
pp. 3060-3063
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Neighborhood Structure ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

The paper is focused on the capacitated vehicle routing problem. 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 build 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.

Sign in / Sign up

Export Citation Format

Share Document