THE VEHICLE ROUTING PROBLEM WITH BACKHAULS AND INVENTORY
The purpose of this paper is to determine the route of the vehicle routing problem with backhauls (VRPB), delivering new items and picking up the reused items or wastes, and resolve the inventory control decision problem simultaneously since the regular VRPB does not. Both the vehicle routing decision for delivery and pickup, and the inventory control decision affect each other and must be considered together. Hence, a mathematical model of vehicle routing problem with backhauls and inventory (VRPBI) is proposed. Since finding the optimal solution(s) for VRPBI is a NP-hard problem, this paper proposes a heuristic method, variable neighborhood tabu search (VNTS), adopting six neighborhood searching approaches to obtain the optimal solution. Moreover, this paper compares the proposed heuristic method with two other existing heuristic methods. The experimental results indicate that the proposed method is better than the two other methods in terms of average logistic cost (transportation cost and inventory cost).
vehicle routing problem with backhauls (VRPB) vehicle routing problem with backhauls and inventory (VRPBI) heuristic method NP-hard variable neighborhood tabu search (VNTS)
S.C. Liu C.H. Chung
Department of Management Information Systems National Pingtung University of Science and Technology Department of Management Information SystemsNational Pingtung University of Science and TechnologyPi
国际会议
上海
英文
1-6
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）