| Summary: | 碩士 === 國立成功大學 === 交通管理學系碩博士班 === 95 === As the development of logistics, transportation and/or delivering cost, which accounts for substantial proportion of overall cost, could be reduced to enhance the competitiveness of the enterprise. Due to the advancement of Intelligent Transportation Systems (ITS), dispatching centers can get real-time information, real-time requests, and commercial vehicle routes according to electron, communication, and real-time information technology. The application of ITS technologies can improve deliver/pick-up services; however, the critical question is how to solve the Online Vehicle Routing Problems (Online VRP) under real-time information and real-time requests.
The Vehicle Routing Problems, one of the NP-hard problems, cannot not be solved efficiently by mathematical programming techniques. Although the heuristic approaches do not guarantee to obtain the optimal solution, they can solve the VRP problem more efficiently.
Online VRP consider realistic issues, such as real-time traffic conditions and new requests. This research proposes a heuristic approach to resolve on-line issues, such as real-time travel cost and real-time requests. In the heuristic approach, the Petals method is deployed to build the initial route for commercial vehicle, and the Tabu Search is used to update routes. In order to consider possible new requests, a rolling-horizon approach is implemented to react to real situations. Numerical experiments based on DynaTAIWAN are conducted for a test network and a real network－ Tainan City network to illustrate the proposed algorithm.
|
|---|
