Solving the LRPTW Based on Tabu Search Algorithm
暂无分享,去创建一个
The object of this paper is to research the multiple-depot location routing problem with time windows. This paper establishes a math model of the location routing problem with time-windows by adding the time constraint to the basic location routing problem, and validates checks the correctness of this math model in a small-scaled problem using Lingo software. This paper designs a tabu search algorithm to solve LRPTW (Location Routing Problem with Time Windows) for large-scaled problems, and uses data of different scales to test the designed algorithm. The results indicate that the proposed algorithm is valid and feasible, being able to solve the problem steadily with high speed.
[1] Edwin von Böventer,et al. THE RELATIONSHIP BETWEEN TRANSPORTATION COSTS AND LOCATION RENT IN TRANSPORTATION PROBLEMS , 1961 .
[2] G. Laporte,et al. An exact algorithm for solving a capacitated location-routing problem , 1986 .
[3] Paolo Toth,et al. Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..