Study on the Tabu Search Algorthm for Vehicle Routing Problem
HU Si-ji
Abstract
HU Si-ji
Abstract
On the basis of describing the vehicle routing problem briefly,this paper presents a new solution indicating method then builds a new tabu search algorithm for the problem and make some experimental computations.The computational results demonstrates that the high quality solutions to the vehicle routing problem can be obtained by using the new tabu search algorithm,and the new algorithm is also efficient and robust.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
On the basis of describing the vehicle routing problem briefly,this paper presents a new solution indicating method then builds a new tabu search algorithm for the problem and make some experimental computations.The computational results demonstrates that the high quality solutions to the vehicle routing problem can be obtained by using the new tabu search algorithm,and the new algorithm is also efficient and robust.
Key concepts: Tabu search, Vehicle routing problem, Guided Local Search, Computer science, Mathematical optimization, Routing (electronic design automation), Computation, Hill climbing