Solving the Dynamic Pickup and Delivery Problem with Soft Time Windows using Tabu Search

• Main Authors: Pu-Yun Lu, 盧步雲
• Other Authors: Fu-Kwun Wang
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/27242111502255278694

碩士 === 中原大學 === 工業工程研究所 === 90 === Recently, the improvement of both telecommunication and network technologies require quick respond toward the vehicle dispatching decision-making. In the past, the studies vehicle routing problems mainly focused on the static problems instead of dynamic problems. However, the new trend has moved the focal points from the static to the dynamic arena. Some profound studies using general heuristic algorithms, such Tabu search in solving dynamic vehicle problems (DVRP). This study first argues that although the approach can produce satisfactory results most of time, the general heuristics, by natural, cannot respond to the fast change environment well. Therefore, this study proposes a stepwise approach including simply heuristics, such Insertion algorithm, K-opt algorithm and Best Fit algorithm, and general heuristic, e.g. Tabu search. In the stepwise approach, the simple heuristics react the change quickly while the general heuristic is responsible for improving the solution when needed. The momentum value caused by the event change will determine when is the time Tabu search should be triggered. The standard problem form Solomon will be used for illustration.