| Summary: | 碩士 === 國立臺灣科技大學 === 工業管理系 === 98 === Abstract
This research considers the vehicle routing problem with refueling (VRPR), a new variant of the well-known vehicle routing problem (VRP). The objectives of this study are clearly defining the problem, constructing a mathematical programming model for the problem, and developing an effective heuristic algorithm for solving the problem. Since VRP belongs to the class of NP-hard problems, it is difficult to find an optimal solution for the problem, except for small-scale instances. Therefore, medium- and large-scale instances are often tackled by heuristic algorithms. The VRPR considered in this research is even more difficult to solve than the VRP since it also considers constraints on refueling, in addition to those constraints in the VRP. Thus, this research not only constructs a VRPR model, which can be used to solve small-scale VRPR instances, but also develops a two-stage heuristic based on Tabu Search to solve medium- and large-scale VRPR instances.
|
|---|
