Jiumei Chen, Xumei Zhang, Hanguang Qiu
Abstract
A hybrid tabu search algorithm, which generates initial solution by genetic algorithm, is proposed here to solve the vehicle routing problems with time windows (VRPTW). Experimental result shows that this algorithm is better than the other known algorithms.
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.
A hybrid tabu search algorithm, which generates initial solution by genetic algorithm, is proposed here to solve the vehicle routing problems with time windows (VRPTW). Experimental result shows that this algorithm is better than the other known algorithms.
Key concepts: Tabu search, Vehicle routing problem, Algorithm, Computer science, Guided Local Search, Hybrid algorithm (constraint satisfaction), Mathematical optimization, Genetic algorithm