| 論文名稱 | 以粒子群演算法求解時效貨品之車輛路線問題 |
| 學位 | 碩士 |
| 年別 | 104 |
| 學校系所 | 交通大學運輸與物流管理學系 |
| 作者 | 艾蘭格 |
| 指導教授 | 黃寬丞 |
| 論文摘要 | In order to solve the problem, an IP Model was developed to get the global optimal solution where the objective is to minimize total distance. Although the optimal solution can be derived by the model, the time for the IP solve to converge can be very long. Because of that, two meta-heuristic algorithms were developed to reduce the computational time and generate an acceptable solution. Particle Swarm Optimization (PSO) and a hybrid PSO with Genetic Algorithm (GA) technique were involved. Both of them have been popular for solving the NP hard problem like OVRP. |
| 附件下載 | (電子檔於106-09-03後開放下載) D03260-全文檔.zip |
| 張貼日 | 2015/11/18 |
| Hashtags |
查看次數:
111