It can aid transportation Company solving the trip planning problem via Genetic Algorithm method.

• Main Authors: Shih-Tsung Hsieh, 謝世宗
• Other Authors: Huey-Der Chu
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/49541138181600661745

碩士 === 德明財經科技大學 === 資訊科技與管理研究所 === 98 === Recently, car trip planning operations of domestic transportation companies remain in human planning practice that it not only wastes labor cost but is error-prone. This situation has been presumed to be m-TSPTW’s problem which is a problem in route planning by the study which makes an analysis of planning for car trips for transportation companies. The routing problem is a very classic problem, and there are many related topics, but most of them are all academic research, in other words, those really take action to implement the system possess relatively minority. There are many ways to solve the problem in route planning, and a recently mature method, genetic algorithm has been selected to be the solution to the problem in this study. After the question of car trips planning has been analyzed, we established a solution framework by applying the genetic algorithm. And then, we implemented this system by using Microsoft Excel which has a powerful calculating capability while working with Evolver, the commercial-of-the-shelf software for genetic algorithm. While the system has been developed, we input the raw data of car trips those provided by a transportation company to verify this system can generate a recommended dispatching plan for car trips. This plan will improve the competitiveness of that company because it can reduce the fuel and labor cost and the number of artificial error.