scholarly journals Transportation Path Optimization of Modern Logistics Distribution considering Hybrid Tabu Search Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Jinjin Guo ◽  
Huiying Zhang ◽  
Guie Sun

The optimization of transportation path for distribution vehicles, which is about the mixed tabu search method, can not only reduce the cost but also improve the optimization of the vehicle transportation path. This algorithm first studies the current situation of the logistics distribution vehicle transportation path and then uses the hybrid tabu search method to calculate the vehicle transportation path. According to the real case analysis, it can be proved that the hybrid tabu search calculation method can improve the efficiency, the proposed modern logistics distribution vehicle transportation path is also the best method, and the transportation cost is greatly reduced.

2011 ◽  
Vol 62 (1) ◽  
pp. 11-18 ◽  
Author(s):  
C. Christober ◽  
Asir Rajan

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. Numerical results are shown comparing the cost solutions and computation time obtained by using the evolutionary programming method and other conventional methods like dynamic programming, lagrangian relaxation.


2019 ◽  
Vol 8 (2) ◽  
pp. 1050-1056

One of the well-known property of graph is graph coloring. Any two vertices of a graph are different colors such that they are adjacent to each other. The objective of this paper is to analyse the behavioral performance of Tabu Search method through serial and parallel implementations. We explore both parallel and serial Tabu search algorithm for graph coloring with arbitrary number of nodes.


Author(s):  
Yustina Ngatilah ◽  
Anasyah Septiara ◽  
Caecilia Pujiastuti ◽  
Desak Ayu Clara Dewanti

Distribution is activity of delivering goods or services from producers to consumers. CV. Artha BuanaMandiri is a company engaged in Agricultural Industrial Chemicals. The products produced by CV. Artha Buana Mandiri are pesticides. With a large area distribution, the company's distribution process is still considered to be less optimal because there is no fixed distribution route due to the large number of routes used for the East Java distribution area, causing delays in the distribution process of pesticide products. The purpose of this study is to minimize the distance to obtain the optimal distribution route. Optimal route determination is included in the problem of Traveling Salesman Problem (TSP). One solution to solve TSP problems is to use the Tabu Search Algorithm. Tabu Search is a metaheuristic method based on local search. The process of performance moves from one solution to the next by choosing the best solution. The main purpose of this method is to prevent the search process from re-searching the space of the solution that has been traced. From the calculation it can be seen that the optimal route of the Tabu Search method is better than the company route with an optimum route of 251.3 km.


2006 ◽  
Vol 106 (6) ◽  
pp. 1406-1412 ◽  
Author(s):  
T. Rusu ◽  
V. Bulacovschi

Sign in / Sign up

Export Citation Format

Share Document