An Effective Tabu Search for Vehicle Routing Problem with Pickup and Delivery Service
The vehicle routing problem with delivery and pick-up service was considered in this paper. A tabu search was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.
Qi Luo and Yuanzhi Wang
Y. Y. Li and C. S. Liu, "An Effective Tabu Search for Vehicle Routing Problem with Pickup and Delivery Service", Advanced Materials Research, Vols. 181-182, pp. 760-764, 2011