英文摘要 |
Logistics management has been one of the most important elements in supply chain management. Major daily operation issues in distribution centers are routing and scheduling of trucks. The problem to optimize vehicle routes is called the vehicle routing problem (VRP). The dynamic vehicle routing problem (DVRP) is an extension of VRP aiming to consider possible variations of travel times in the network. In this research, a two-stage framework for solving the dynamic vehicle routing problem is proposed. In this framework, the dynamic vehicle routing problem is divided into two stages, namely, vehicle assignment and vehicle routing improvement. In the first stage, a well-known approach, the sweep method, is conducted in vehicle assignment. In the second stage, a tabu search algorithm is implemented to improve route searching with real-time information. A heuristic approach is then applied in an evaluation framework in which assigning and routing operations could be simulated in a realistic traffic environment. The simulation-assignment model, Dyna TAIWAN is applied to evaluate assigning and routing strategies in a traffic network. Numerical experiments are conducted to illustrate the framework and possible benefits. |