A Dual Tabu Search Algorithm for Vehicle Routing Problem
Tao Wang
Abstract
Open-access reader
Tao Wang
Abstract
Open-access reader
In this paper, vehicle routing problem as the background, the traditional tabu search algorithm is proposed based on a set of methods to build the initial solution and its integration to achieve the dual tabu search algorithm for vehicle routing problem.A new algorithm to avoid the shortcomings of the traditional tabu search algorithm is too dependent on the initial solution, the simulation tests to verify the feasibility and effectiveness of the algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, vehicle routing problem as the background, the traditional tabu search algorithm is proposed based on a set of methods to build the initial solution and its integration to achieve the dual tabu search algorithm for vehicle routing problem.A new algorithm to avoid the shortcomings of the traditional tabu search algorithm is too dependent on the initial solution, the simulation tests to verify the feasibility and effectiveness of the algorithm.
Key concepts: Tabu search, Computer science, Vehicle routing problem, Dual (grammatical number), Guided Local Search, Algorithm, Routing (electronic design automation), Mathematical optimization