scholarly journals A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 279 ◽  
Author(s):  
Lining Xing ◽  
Yuanyuan Liu ◽  
Haiyan Li ◽  
Chin-Chia Wu ◽  
Win-Chin Lin ◽  
...  

In this paper, we propose a novel tabu search (NTS) algorithm that improves the efficiencies of picking goods of automated guided vehicles (AGVs) in an automatic warehouse by solving the conflicts that happen when multiple AGVs work at the same time. Relocation and exchanging operations are designed for the neighborhood searching process based on each pickup-point’s location in the warehouse, along with the initial solution generation and the termination condition in the proposed algorithm. The experimental results show that the tabu search algorithm can effectively optimize the order of pickup points, which could further reduce the total travel distance and improve the efficiencies of AGVs in automatic warehouses.


2019 ◽  
Vol 3 (01) ◽  
pp. 6-14
Author(s):  
Citra Septi Brilliane ◽  
Ari Yanuar Ridwan ◽  
Rio Aurachman

XYZ is a pasteurization milk processing company that produce milk drink from pure cow milk. PT. XYZ don’t sell their product directly to end user, instead they distribute their product to many companies which serve milk for their employees or operators in lunch time. So, their customer is mostly a manufacture company from various kinds of industry. They have about 40 customers and most of them are outside Bandung. However, the delivery may not be done as planned. The average on time delivery is around 96%. it is below PT. XYZ target which is 98%. The impact of the delay itself is vary between customers. Because when delay occur, each customer has their own regulation that has been settled in agreement contract. Based on the delay recapitulation above, there are several factors that caused this problem. Delay in departure is the most influential factors. It is because PT. XYZ don’t have fixed schedule of delivery and they miscalculate the departure time because of improper route determination that also leads to longer travel time. This case is categorized as Vehicle Routing Problem with Heterogeneous Fleet and Time Window (VRPHFTW) that will be solved using one of meta-heuristics algorithm which is Two Phase Tabu Search Algorithm to minimize travel distance. In the end, the travel distance can be minimized 19.48%. Keywords—Vehicle Routing Problem with Heterogenous Fleet and Time Window (VRPHFTW), Meta-Heuristics, Two Phase Tabu Search Algorithm.



2012 ◽  
Vol 178-181 ◽  
pp. 1802-1805
Author(s):  
Chun Yu Ren

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.



2021 ◽  
Vol 60 ◽  
pp. 100802
Author(s):  
Mahdi Alinaghian ◽  
Erfan Babaee Tirkolaee ◽  
Zahra Kaviani Dezaki ◽  
Seyed Reza Hejazi ◽  
Weiping Ding


2012 ◽  
Vol 39 (4) ◽  
pp. 4233-4239 ◽  
Author(s):  
C.D. Tarantilis ◽  
F. Stavropoulou ◽  
P.P. Repoussis


2013 ◽  
Vol 859 ◽  
pp. 395-398
Author(s):  
Chun Yu Ren

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.



Sign in / Sign up

Export Citation Format

Share Document