| Summary: | 碩士 === 朝陽科技大學 === 建築及都市設計研究所 === 93 === Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. In this paper, we study a variant of the general VRP, VRP with time windows (VRPTW), which is utilized to the applications of recreational itinerary planning problems. Time constrained routing is relevant for applications where a schedule has to be followed. Although VRPTW is a relaxation of the VRP with time windows, the problem does not become easier to solve, and is still NP-hard. In this work, we propose a solution method with LINDO program for solving the recreational itinerary planning models structured as a VRPTW form. VRPTW is NP-hard problem and best solved to near optimum by heuristics. In the vehicle routing problem, a set of geographically dispersed customers (tourists) with known demands and predefined time windows are to be served by a fleet of vehicles with limited capacity. The optimized routines for each vehicle are scheduled as to achieve the minimal total cost without violating the capacity and time windows constraints.
|
|---|
