| Summary: | 碩士 === 國立臺灣科技大學 === 機械工程系 === 91 === In the past, the arrangement of the optimum delivery sequence always depended on human experiences. However, it is too complicated to do and takes too much time; besides, the efficiency of planning of a good sequence by human is never guaranteed. This research uses the simulated annealing algorithm that can find the global optimum and solve the TSP easily as the frame stone for an applied program of solving dispatching sequence problems. The simulated annealing algorithm, the shortest path algorithm, and the geographical information system will be firstly introduced. After that, the integration of the above elements into a complete software system will be described. Because the program combines the geographical information system, it can input, calculate, solve the problem, output in real-time and manage the data easily. Owing to the above characteristics, the degrees of ease of use and convenience for users and program managers are greatly increased.
|
|---|
