scholarly journals Hybrid genetic–tabu search algorithm to optimize the route for capacitated vehicle routing problem with time window

2020 ◽  
Vol 1 (1) ◽  
pp. 15 ◽  
Author(s):  
Mohammad Deni Akbar ◽  
Rio Aurachmana
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Algorithm ◽  
Search Algorithm ◽  
Optimum Number ◽  
Tabu Search Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Optimization of transportation and distribution costs is one of the important issues in the supply chain management area. It is caused by their large contribution to the logistics costs that can reach up to 40%. Thus, choosing the right route is one of the efforts that can be done to resolve the issue. This study aims to optimize the capacitated vehicle routing problem with time windows (CVRPTW) for mineral water company distributor with pick-up and delivery problem. To achieve the aim, this study used hybrid algorithm, Genetic Algorithm (GA) and Tabu Search Algorithm (TS). The selection of this hybrid algorithm is due to its capability in minimizing travel distance. The result of this study shows that not only the algorithm has successfully reduced the existing route but also predicted the optimum number of homogenous fleet. By running the algorithm, this study concludes that the number of the optimum routes for this study can be reduced for up to 15.99% than the existing route.

New Tabu Search Algorithm with Applied Technology for Capacitated Vehicle Routing Problem

2013 ◽  
Vol 859 ◽  
pp. 395-398
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Insertion Method ◽  
Applied Technology ◽  
Capacitated Vehicle

This paper studies the vehicle routing problem. According to the characteristics of model, new tabu search algorithm is used to get the optimization solution. It applies newly improved insertion method to construct initial solution, to improve the feasibility of the solution; designs dual layered random operation to construct its neighborhood; applies auto adaptive tabu length to control the searching capability dynamically. At last, it uses simulated experiments to prove the effectiveness and feasibility of this algorithm, and provides clues for massively solving practical problems.

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.

Fast Tabu Search Algorithm for Capacitated Vehicle Routing Problem

2013 ◽  
Vol 760-762 ◽  
pp. 1790-1793 ◽  
Author(s):  
Chun Yu Ren
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Standard Test ◽  
Test Problems ◽  
Tabu Search Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

This paper studies the capacitated vehicle routing problem. According to the characteristics of model, fast tabu search algorithm is used to get the optimization solution from the overall situation. Firstly, it designs three operations for fastening the speed of convergence and efficiency. Finally, the good performance of this algorithm can be proved through a set of standard test problems.

scholarly journals Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA)

2018 ◽  
Vol 31 (2) ◽  
pp. 199
Author(s):  
Omar Ibrahim Obaid
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Search Space ◽  
Program Execution ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Set Up ◽  
Capacitated Vehicle

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal algorithm. The structure of the algorithm is planned with the goal that the program does not require a substantial database to store the data, which accelerates the usage of the program execution to acquire the solution. The algorithm has demonstrated its accomplishment in resolving the issue and finds a most limited route.

Sign in / Sign up

Export Citation Format

Share Document