Abstract
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.
Highlights
Due to the increase of oil price, the cost of logistics and transportation has exceeded the budget, and there are contradictions and defects between goods distribution-related services and intercity transportation [1,2,3]. erefore, the current logistics distribution vehicle transportation path optimization is an important work of the entire logistics industry. e logistics distribution vehicle transportation path optimization problem is related to the logistics transportation cost, efficiency, and distribution speed. erefore, it is an important work of the logistics research industry to choose which path optimization to quickly deliver goods to users
We study the transportation path of logistics distribution vehicles and establish a digital model of distribution vehicle transportation. e digital model uses the hybrid tabu search calculation method to find the best transportation path of distribution vehicles
Taking the actual case analysis, it can be proved that the hybrid tabu search method can find OTPDV method the fastest and is the best calculation method
Summary
Y Output optimal path and number of vehicles Figure 1: Flow chart of vehicle transportation route optimization. For TSP and OPTPDV, the potential energy field ant colony algorithm can only obtain the best access order of global path points Instead of path, it cannot meet the requirements of mobile wheeled logistics vehicle volume selection path plan. In the process of planning the global path of logistics vehicles through 3D reconstruction technology, set the OPEN table and CLOSE table; during initialization, the initial point is appended to the OPEN table. Take the terminal point as the starting point ui and trace back to the initial point from the parent node to obtain the shortest route selected for the batch of logistics vehicles (2) If ui is an inaccessible point, skip the point (3) If ui is, skip the point (4) If ui is not in either of the OPEN table or the CLOSE table, it will be added to the OPEN table as the parent node of ui (5) If ui is, find out the g value of the new path and judge whether it is the smallest.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
