Study on the model and tabu search algorithm for delivery and pickup vehicle routing problem with time windows

This paper studies the delivery and pickup vehicle routing problem with time windows. The vehicle routing problems with delivery and pickup are divided into five categories. The existing papers studied mainly the anterior four categories and this paper studies the fifth category. In the problem, each customer has two time windows and the pickup and delivery at each customer can be fulfilled by being visited once or twice. On the basis of describing the problem and the pickup and delivery integrated tactics, the delivery and pickup vehicle routing problem with time windows is modeled. A tabu search algorithm for the problem is designed by using a new solution indicating method. It is shown that the tabu search algorithm gives a better solution to this problem in a short computation time and the results are stable.This electronic document is a ´live´ template. The various components of your paper [title, text, heads, etc.] are already defined on the style sheet, as illustrated by the portions given in this document.