臺灣博碩士論文加值系統

車輛途程已是經過許多學者研究之問題，傳統車輛途程問題是由旅行銷售員問題(Travel Salesman Problem, TSP)所延伸之研究議題，其較旅行銷售員問題更貼近實務面，然而在考量實務上的因素時，往往忽略車輛途程中一項重要的實務因素，即車輛配送過程中燃料耗盡之問題，在現實狀況中，車輛燃料耗盡後是無法繼續行駛的，因此需在配送途中進行燃料補給，設置燃料站來解決此問題。
近年來空氣汙染嚴重，造成全球暖化，氣候變化極端，全球環保意識抬頭，運輸業已無法像往日的方式運作，為了達到節能減碳的目的，應想辦法節省所需的燃料，本研究針對此問題將車輛途程加入燃料站之因素，來解決配送過程中燃料不足的問題，使得配送車輛能有足夠的燃料至需求點服務或返回場站，並將碳排放量納入成本考量，達到節能減碳之目標，求解過程分為兩個階段，第一階段運用節省法來建構初始解，第二階段以果蠅最優化演算法對初始解進行改善，並利用Visual Studio 2010程式語言撰寫求解程式，規劃出最佳之配送途程，使車輛在燃料足夠的情況下滿足顧客需求及達到節能減碳，目標為總成本最小化。

In this study, we focus on the part of gasoline in the Vehicle Routing Problem. The VRP is very popular for research because it’s nearer practical than TSP. More researchers joined to research the VRP, and proposed some varied VRP. In VRP, the vehicle fuel consumption is a very important factor in practice. Therefore, we should set the fuel station en route. It could solve the problem of fuel shortage.
In the past years, air pollution is very serious in our environment, especially greenhouse gas emissions. Therefore, Logistics companies must be planed the effective vehicle route to reduce carbon emissions. In this study, we investigate the problem of vehicle fuel shortage and carbon emissions. First, we construct a mathematical model which minimizes total cost as its objective. Following, a Fruit Fly Optimization Algorithm is presented to solve this problem. The expected results of this study include: (1) Plan an optimal transport routes, (2) reduce the total cost of vehicle travel, (3) reduce amount of carbon emitted, (4) solve the problem of fuel shortage.

摘要 i
ABSTRACT ii
誌謝 iii
目錄 iv
表目錄 v
圖目錄 vi
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 2
1.3 研究範圍與限制 2
1.4 研究架構及流程 3
第二章 文獻探討 5
2.1 車輛途程問題 5
2.2 考慮燃料消耗之車輛途程問題 9
2.3 汙染路徑問題 11
2.4 求解車輛途程相關演算法 13
2.5 小結 19
第三章 研究方法 20
3.1 問題描述 20
3.2 數學模式之建構 22
3.3 數學模型之驗證 25
3.4 演算法建構 27
第四章 例題驗證與分析 34
4.1 測試例題說明 34
4.2 果蠅演算法之參數設計 36
4.3 測試例題求解 38
4.4 敏感度分析 39
第五章 結論及未來研究方向 43
5.1 結論 43
5.2 未來研究方向 44
參考文獻 45

1. 林子越，(2010)，考慮燃料的車輛途程問題之研究，(碩士)，國立雲林科技大學，雲林縣。
2. 林奕隆，(2011)，應用蜂群最佳化演算法求解撥召問題－以復康巴士為例，(碩士)，國立中央大學，桃園縣。
3. 洪銘駿，(2015)，多車種之可分批收送車輛途程規劃，(碩士)，國立雲林科技大學，雲林縣。
4. 胡智維，(2013)，粒子群演算法應用於多車種固定車隊之車輛途程問題，(碩士)，元智大學，桃園縣。
5. 喻奉天，林宗漢，盧宗成，(2011)，應用蟻群系統求解卡車與拖車途程問題. 運輸學刊，23(2), 199-218。
6. 蔡易達，(2012)，考量增設單一場站位址及碳排放量之車輛路徑規劃，(碩士)，國立雲林科技大學，雲林縣。
7. 盧柏翔，(2008)，考慮混合分批送貨和取貨之車輛途程問題，(碩士)，國立雲林科技大學，雲林縣。
8. 行政院環保署網站 http://www.epa.gov.tw/mp.asp?mp=epa
9. Ai, T. J., & Kachitvichyanukul, V. (2009). Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering, 56(1), 380-387.
10. Bektaş, T., & Laporte, G. (2011). The Pollution-Routing Problem. Transportation Research Part B: Methodological, 45(8), 1232-1250.
11. Demir, E., Bektaş, T., & Laporte, G. (2011). A comparative analysis of several vehicle emission models for road freight transportation. Transportation Research Part D: Transport and Environment, 16(5), 347-357.
12. Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 141-145.
13. Erdoğan, S., & Miller-Hooks, E. (2012). A Green Vehicle Routing Problem. Transportation Research Part E: Logistics and Transportation Review, 48(1),100-114.
14. Figliozzi, M. (2010). Vehicle routing problem for emissions minimization. Transportation Research Record: Journal of the Transportation Research Board(2197), 1-7.
15. Ichimori, T., Ishii, H., & Nishida, T. (1983). Two routing problems with the limitation of fuel. Discrete Applied Mathematics, 6(1), 85-89.
16. Koc, C., Bektaş, T., Jabali, O., & Laporte, G. (2014). The fleet size and mix pollution-routing problem. Transportation Research Part B: Methodological, 70, 239-254.
17. Lang, Z., Yao, E., Hu, W., & Pan, Z. (2014). A Vehicle Routing Problem Solution Considering Alternative Stop Points. Procedia - Social and Behavioral Sciences, 138, 584-591.
18. Lin, C., Choy, K. L., Ho, G. T., Chung, S., & Lam, H. (2014). Survey of green vehicle routing problem: Past and future trends. Expert Systems with Applications, 41(4), 1118-1138.
19. Lin, Y., Li, W., Qiu, F., & Xu, H. (2012). Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia-Social and Behavioral Sciences, 43, 494-502.
20. Marinakis, Y., Marinaki, M., & Dounias, G. (2010). A hybrid particle swarm optimization algorithm for the vehicle routing problem. Engineering Applications of Artificial Intelligence, 23(4), 463-472.
21. Nagy, G., & Salhi, S. d. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126-141.
22. Xiao, Y., Zhao, Q., Kaku, I., & Xu, Y. (2012). Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Computers & Operations Research, 39(7), 1419-1431.
23. Zhang, J., Zhao, Y., Xue, W., & Li, J. (2015). Vehicle routing problem with fuel consumption and carbon emission. International Journal of Production Economics, 170, Part A, 234-242.
24. Zheng, X.-l., Wang, L., & Wang, S.-y. (2014). A novel fruit fly optimization algorithm for the semiconductor final testing scheduling problem. Knowledge-Based Systems, 57, 95-103.