能資源的大量使用，造成全球氣候變遷的異常，並且從科學研究的領域，實際成為日常生活影響的因子，2007年所公告的EuP指令到2010年各國探討的焦點哥本哈根會議，兩者的訴求都在探討如何減少降低碳的排放，瞭解與自己活動直接與間接造成碳排放量，才能進行後續減碳規劃。透過生命週期衝擊LCI（Life Cycle Inventory, LCI）與生命週期評估（Life Cycle Assessment, LCA）方法盤查活動所產生的碳排放量，然而在實際盤查前所得的次級資料與實際盤查後所得到原始資料的碳排放相較下有明顯的落差，而在LCI的調查往往又需要耗費大量的人力、物力、成本與時間，所以本研究以網通產品為研究對象利用整數線性規劃為架構帶入途程問題，發展一套最佳化決策模式，利用盤查的LCI資料進行歸納，透過數學模型之目標式與決策變數，計算出各供應商間之最佳成本與路徑，其主要目的為：解決盤查時次級資料與原始資落產生碳落差之規劃使各盤查LCI階段之路徑最佳及效益最大及成本最小之決策方式，節省時間與提昇碳足跡運算效率為目的。期望透過本研究可以最佳化LCI的盤查過程與簡化後端分析評估降低其複雜度，進而發展至其他產業上。

Huge amounts of energy resources usage brings the result of global climate abnormality, it has became a practical factor from science research. Both Eco-Design Requirements for Energy-using Products which was noticed in 2007 and Climate Conference in Copenhagen which involved many countries in 2010 appeal the method of carbon emission deduction. Only if knowing direct and indirect self activities that allows to carry out a follow-up carbon emission deduction. The carbon emission which is produced by activities is measured by LCI（Life Cycle Inventory）and LCA（Life Cycle Assessment）. However, there is a significant difference between the secondary data before actual estimating and the primary data after; furthermore it uses substantial human resources, material, cost and time, therefore networking product here as the research object applys integer linear programming into routing problem and develops a best decision-making model in this dissertation.
Conclude the LCI data results, through goal function and decision variable from mathematical model to figure the lowest cost and the best path between each supplier.
The main purpose is to solve the carbon gap which is caused between secondary data and primary data when examining, moreover, to achieve the best path when checking each step of LCI, the most efficient and the lowest cost decision-making method, a goal of time-saving and carbon footprint calculation efficiency improvement.
It is expected in this research to get the result of optimizing the LCI examination procedure, simplifying the back-end analysis, and reducing the complexity, so that apply to other industries.

摘 要 i
Abstract ii
致謝 iii
目 錄 iv
表目錄 vi
圖目錄 viii
第一章 緒論 1
1.1研究背景與動機 1
1.2研究目的 2
1.3 研究範圍與限制 3
1.3.1研究範圍 3
1.3.2研究限制 3
1.4 研究架構 4
第二章 文獻探討 6
2.1 碳足跡 6
2.1.1 PAS 2050 碳足跡準則定義 7
2.1.1.1 PAS 2050 碳足跡標準規範架構 8
2.1.2 碳足跡標籤 11
2.2 旅行銷售員(Traveling Salesman Problem,TSP) 12
2.3 車輛途程問題(Vehicle Routing Problem，VRP) 14
2.3.1基本車輛途程規劃問題 14
2.3.2車輛途程問題之型態 16
2.3.3 車輛途程問題的歷史 17
第三章 研究方法 21
3.1 問題定義與假設 21
3.2 決策模式流程 22
3.3 數學模式之建構 24
3.4 小規模例題求解 27
3.5 小結 38
第四章 個案分析與敏感度分析 39
4.1 案例描述 39
4.2 資料分析 42
4.2.1 電腦演練環境 42
4.2.2 模式輸入資料 43
4.2.3 模式輸出結果 51
4.2.4 現況盤查與分析結果 55
4.3 敏感度分析與路徑修正 56
4.3.1 敏感度分析 56
4.3.2 路徑模式修正結果 65
4.3.2.1 修正模式輸入資料 65
4.3.2.2 模式修正結果 70
4.4 小結 74
第五章 結論與建議 75
5.1 結論 75
5.2 建議 76
參考文獻 77
附錄A 正常模式 Lingo輸入資料 79
附錄B 修改模式 Lingo輸入資料 116

1. 莊智淵，生命週期評估應用於產品概念設計階段之研究。國立成功大學電機工程學系，碩士論文，2004。
2. 行政院環保署，http://greenliving.epa.gov.tw/GreenLife/
3. 張楊乾，低碳生活的24堂課, 朱雀文化，2005。
4. 王順生，應用模糊理論求解動態車輛途程規劃，朝陽科技大學工業工程與管理系，碩士論文，2006。
5. 王琬舒，PAS2050碳足跡標準規範之永續產品設計研發節能效益分析與評估，大葉大學設計藝術學院，碩士論文，2009。
6. 柯佳君，結合生命週期評估與生態效益之研究，朝陽科技大學環境工程與管理系，碩士論文，2006。
7. 郭惠梋，物流派車管理之研究，靜宜大學資訊管理學系，碩士論文，2004。
8. 王彬墀、李育明、陳秋揚，PAS 2050產品與服務生命週期溫室氣體排放評估規劃之探討，永續性產品與產業管理研討會論文集，2009。
9. 余國頌，臺北縣國小五年級學童碳足跡相關概念認知與態度之研究，台北市教育大學自然科學系，碩士論文，2010。
10. 逢甲大學物流系統規劃實驗室，物流管理，http://140.134.72.87/main/mbie/logistic.htm，2004。
11. Bodin, L., Golden, B., Assad, A. and Ball, M., “Routing andscheduling of vehicles and crews: the state of the art,” Computers and Operations Research, Vol.10, pp.63-211, 1983.
12. BSI British Standards(2008),PUBLICLY AVAILABLE SPECIFICATION-PAS 2050:2008,Specification for the assessment of the life cycle greenhouse gas emissions of goods and services.
13. BSI British Standards(2008),Guide to PAS 2050,How to assess the carbon footprint of goods and services.
14. Dantzig, G. B. and Ramser, J., “The Truck Dispatching Problem,” Management Science, Vol.5 , pp. 81-91, 1959.
15. De CT Gomes, L., Von Zuben, F.J., “A Neuro-Fuzzy Approach to the Capacitated Vehicle Routing Problem”, Proceeding of the 2002 International Joint Conference on Neural Networks, Volume: 2, Pages: 1930-1935.
16. Flood, M. M., “The Traveling Salesman Problem,” Operations Research, Vol.4, pp.61-75, 1955.
17. Held, M., Karp, R. M., “A dynamic programming approach to sequencing problems,” Journal of Society Industrial and Applied Mathematics, Vol.10, pp.196-210, 1962.
18. Ibaraki, T., Kubo, M., Masuda, T., Uno, T., and Yagiurs, M., “Effective local search algorithms for the vehicle routing problem with general time windows,” Working paper, Department of Applied Mathematics and Physics, Kyoto University, Japan, 2001.
19. Kulkarni, R. V. and Bhave, P. R. , “Integer Programming Formulations of Vehicle Routing Problem,” European Journal of Operational Research, Vol.20, pp. 58-67, 1985.
20. Miroslaw, M., Mohan, G. and Mihir, P., “Serial and parallel simulated annealing and tabu search algorithms for the Traveling Salesman Problem,” Annals of Operations Research, Vol.21, pp.59-84, 1989.
21. Teodorovic. D. and Lucic. P., “Intelligent Vehicle Routing System”, Intelligent Transportation Systems Conference Proceedings, 2000 IEEE, October 1-3, Pages: 482-487.