A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem

2018 ◽  
Vol 29 (4) ◽  
pp. 453
Author(s):  
Jose Bernal ◽  
John Willmer Escobar ◽  
Juan Camilo Paz ◽  
Rodrigo Linfati ◽  
Gustavo Gatica
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

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.

scholarly journals Rancang Bangun Vehicle Routing Problem Menggunakan Algoritma Tabu Search

2015 ◽  
Vol 4 (2) ◽  
pp. 113 ◽  
Author(s):  
Sulistiono Sulistiono ◽  
Noor Saif Muhammad Mussafi
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Nearest Neighbor ◽  
Initial Solution ◽  
Routing Problem ◽  
Tabu List ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Pendistribusian produk berperan penting dalam dunia industri. Salah satu usaha yang dapat dilakukan perusahaan untuk mengoptimalkan pendistribusian produk adalah meminimalkan biaya tranportasi melalui penentuan rute optimal kendaraan yang disebut dengan VRP (Vehicle Routing Problem). Tujuan dari VRP adalah menentukan rute optimal yaitu rute dengan jarak minimum untuk mendistribusikan produk kepada konsumen. Salah satu variasi VRP adalah Capacitated Vehicle Routing Problem (CVRP), yaitu VRP dengan kendala kapasitas kendaraan. Kasus CVRP tersebut dapat diselesaikan dengan menggunakan Algoritma Tabu Search. Cara kerja Algoritma Tabu Search dimulai dengan penentuan initial solution menggunakan Nearest Neighbor,  evaluasi move menggunakan metode 2-Opt, Relocated, dan Exchange, update Tabu List,  kemudian apabila kriteria pemberhentian terpenuhi maka proses Algoritma Tabu Search berhenti jika tidak, maka kembali pada evaluasi move. Proses perhitungan Algoritma Tabu Search dilakukan secara manual dan rancang bangun menggunakan MATLAB pada PT Sinergi Bio Natural. Berdasarkan proses perhitungan manual dan rancang bangun diperoleh dua solusi optimal yaitu rute dengan jarak terpendek dengan total jarak optimal sebesar 101,1 km.

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.

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