This paper raises a novel two-phase heuristic method to solve vehicle routing problems with backhauls. Differing from other vehicle routing problems, we consider the travel speed of vehicle to be time dependent, which will be used for the model of rush hour in an urban city. In the first phase, the original solution is generated by extending traditional heuristic methods and in the second phase, the reactive tabu search algorithm is used to optimize the original solution. We verified that this algorithm is efficient in a number of standard test cases. After comparison with the closest neighboring search algorithm, we found that the results of two-phase heuristic methods are more reasonable. © 2008 Elsevier Ltd. All rights reserved.
https://doi.org/10.1016/j.camwa.2008.10.045Cite as:
@article{Wang_2009,
doi = {10.1016/j.camwa.2008.10.045},
url = {https://doi.org/10.1016%2Fj.camwa.2008.10.045},
year = 2009,
month = {jun},
publisher = {Elsevier {BV}},
volume = {57},
number = {11-12},
pages = {1923--1928},
author = {Zhiwu Wang and Zhengguo Wang},
title = {A novel two-phase heuristic method for vehicle routing problem with backhauls},
journal = {Computers {&}amp$mathsemicolon$ Mathematics with Applications}
}