A Study on the Adaptive Tabu Algorithm for the Dynamic Vehicle Routing Problem
Hsien-ming Chiu
Abstract
Open-access reader
Hsien-ming Chiu
Abstract
Open-access reader
In this paper, a five-phase solution procedure based on the Tabu search is proposed to solve the dynamic vehicle routing problem with real time demand information.A series of case studies with different characteristics such as demand density, demand size are used to test the solution capability of the proposed 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, a five-phase solution procedure based on the Tabu search is proposed to solve the dynamic vehicle routing problem with real time demand information.A series of case studies with different characteristics such as demand density, demand size are used to test the solution capability of the proposed algorithm.
Key concepts: Tabu search, Vehicle routing problem, Computer science, Routing (electronic design automation), Adaptive routing, Algorithm, Mathematical optimization, Algorithm design