A Construction of Vehicle Routing System with Time-Varying Travel Times

• Main Authors: Chen-lung Chiang, 蔣杰龍
• Other Authors: ShanHuen Huang
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/11818407250900714402

碩士 === 國立高雄第一科技大學 === 運輸倉儲營運所 === 93 === The system of logistics distribution is one of the key functions of distribution center. Operation, the major source of D.C. and the operation in D.C. stressed the things that how to use the vehicles effectively and decided the figure of the most economics driving line. Let production send the right quantity to the right position for satisfying the customer’s demand to reach the perfect order. Nowadays the traffic in Taiwan metropolis is heavily and driving, parking and loading are difficultly, which make the complexity of delivering problems more deeply. This study analyzes a different case of the Vehicle Routing Problem (VRP), which is including the time-varying link weight. In real world, a link travel time of a network is changing time to time. That means different departure time of the same route will generate different travel time. How to dispatch vehicles to serve customers and decide the order of services are needed to reconsider under this situation. Moreover, most traditional VRP assume straight-line connection between any two nodes rather than talk about the path selection. In this research, it is also discussed. A heuristic algorithm, which is greedy algorithm, is introduced for solving this VRP. The concept of greedy algorithm is trying to serve as more customers as one vehicle can. In addition, an application is made to illustrate the solution of this algorithm. This application demonstrates a user interface (UI) of solving VRP and using the map of Taipei city as study object.