| Summary: | 碩士 === 國立中正大學 === 數學研究所 === 90 === Abstract
Planning the route of school bus requires a great amount of time and effort. As evidence shows that the sum of students in each area constantly changes every year , the original planned-route can’t annually promise the most benefit. Thus, “ Simmulated Annealing” can be an attempt to solve the Vehicle Routing Problem with Soft Time Window and to reach the goal of it quickly.
Firstly, saving method is helpful to seek an initial solution , Secondly, simmulated annealing can modify the result. In the process of using simulated annealing, we are constantly looking for neighborhood solution, which can be acquired in various ways. Also, we have to judge whether it is a current solution or not . This study aims at more appropriate ways to match and attempts to find a better way for searching a neighborhood solution . Besides, this study cooperates with simmulated annealing to solve a real routing problem of school bus. Consequently,the result proves to be better than the original route.
|
|---|
