臺灣博碩士論文加值系統

實務物流配銷系統中，大多是根據公司過去經驗，分開考量運輸路徑成本與相關存貨成本來進行規劃，但實際上必須同時考慮運輸路徑成本及相關存貨成本，才能有效規劃出符合經濟效益的路線及降低總體物流成本。另外學術研究上，以實務為研究對象的研究並不多，加上近年來環保意識提升，除了要考慮路徑成本與相關存貨成本外，還必須納入碳成本，才能規劃出符合實務及環保效益的最佳路線，因此將存貨途程問題加入碳成本，並與實務規劃與理論研究相結合，是本文主要的研究方向。本研究針對國內某物流業者的現況，建立綠色同時收送貨存貨途程問題的數學模式(GIRPSPD)，以節省法求得起始解，再以標靶插入法及交換法改善起始解，求得最佳經濟訂購量、再訂購點、服務水準及規劃最適路線與存貨路徑總成本，並針對此模式發展一決策支援系，可供決策者進行各種敏感度分析。最後本研究提出的之模式求得解與業者現行路線、節省法所得路線規劃做相關距離成本與存貨路徑成本的總成本比較時，皆顯示本研究發展的標靶交換啟發式演算法求得解較好，再將演算法所規劃路線以Web顯示，除了相關數據可供決策者參考外，也可將路徑呈現於Google Map上提供貨運人員做為運送路線的參考。

Most publishing logistics firms in Taiwan decide their distributed routes by considering the inventory related cost and transportation cost independently based on their past intuitive experiences. In fact, by concerning both of them, it is more likely to plan the delivered routes economically and efficiently. Due to the increasing environmental concern by the whole world, this total inventorty routing cost better accounts for Greenhouse gas emission cost regarding global warming.
Most literatures of Inventory-Routing problems find the solutions by simulation, rather than solve the real case problem of logistics firms. Furthermore, few of them consider pickup and delivery problems at the same time. Due to environmental awareness, carbon emission cost is also incorporated into the model by considering the interrelationship between the transportation cost and Greenhouse gas emission level. Therefore, this research develops a decision support system to the Green Inventory Routing Problem with Simultaneous Pickup and Delivery (GIRPSPD) and to show the planned routes on GoogleMap.
The mathematical model for GIRPSPD is first constructed, then Savings method is applied to obtain the initial feasible solution, finally implement Target insert heuristic method and Target exchange heuristic method to find the optimal solution. The numerical examples will be illustrated by applying this publishing logistics firm’s actual operating data to acquire the optimal delivery routes, and the related economic order quantities, the optimal reorder points and customer service levels of the retail stores located in those proposed routes. Furthermore, the performance of two proposed Target heuristic methods will be compared with Savings method and current routing planning implemented by this specific logistics company. Finally, sensitivity analyses are also conducted based on the parameters including truck loading capacity, inventory carrying cost percentages, unit shortage costs, unit ordering costs, unit ordering costs, and unit transport costs to simulate the optimal distribution system design regarding the total inventoy routing cost and GHG emission level.
Consequently, the outcomes of this proposed decision support system to GIRPSPD not only have important theoretical contribution, but also provide pratical application applications for the proposed logistics publishing firm’s distribution system design.

摘要 i
ABSTRACT ii
誌謝 iv
目錄 v
表目錄 vii
圖目錄 ix
第一章　前言 1
1.1 研究背景與動機 1
1.2 研究目的 3
1.3 研究流程 3
1.4 研究重點 5
第二章　文獻探討 6
2.1 物流產業發展趨勢 6
2.2 碳足跡與綠色物流 7
2.3 巴黎氣候協議 9
2.4 國際碳市場 10
2.5 車輛途程問題 11
2.6 具時窗限制車輛途程問題 16
2.7 存貨途程問題 18
2.8 同時收送貨之車輛途程問題 19
2.9 解決路徑規劃問題相關演算法 22
2.9.1 禁忌搜尋法（Tabu Search, TS） 22
2.9.2 模擬退火法（Simulate Anneal Arithmetic，SAA） 23
2.9.3 基因演算法（Genetic Algorithm, GA） 23
2.9.4 免疫演算法(Immune Algorithm, IA) 24
2.9.5 粒子群演算法（particle swarm optimization, PSO） 25
2.9.6 演算法總結 27
2.10 決策支援系統 28
2.10.1 決策性質分類 28
2.10.2 各類決策系統分析 29
2.10.3 決策支援系統架構 30
第三章　綠色物流配銷決策支援系統模型建構 32
3.1 問題描述 32
3.2 決策支援系統架構與流程 32
3.2.1 決策支援系統架構說明 32
3.2.2 決策支援系統流程 33
3.2.3 決策支援系統架構 34
3.3 研究限制與假設 38
3.4 符號說明與定義 39
3.4.1 已知變數與輔助變數 39
3.4.2 決策變數 40
3.5 綠色同時收送貨存貨途程數學模式 40
3.5.1 限制式之說明 41
3.5.2 目標函數的使用成本項目 42
第四章　同時考慮收送貨存貨途程模式求解步驟 46
4.1 節省法步驟說明 46
4.2 標靶插入啟發式演算法步驟說明 48
4.3 標靶交換啟發式演算法步驟說明 48
第五章　實例驗證與分析 50
5.1 研究案例之背景描述 50
5.1.1 運輸路線的規劃問題 50
5.1.2 門市點存貨數量問題 50
5.1.3 門市點退貨數量問題 51
5.1.4 考量碳排放量 51
5.2 參數設定 51
5.3 同時收送貨存貨途程成本分析 53
5.3.1 演算法比較分析 53
5.4 敏感度分析 55
5.4.1 車載重分析 55
5.4.2 退貨成本比較分析 60
5.4.3 缺貨成本比較分析 65
5.4.4 訂貨成本比較分析 70
5.5 演算法及演算時間比較 74
第六章　總結 77
6.1 結論 77
6.2 貢獻 78
6.3 未來發展 78
參考文獻 79
附錄 90

1.王朝慶(2010)，研究兩階段禁忌搜尋法於物流管理中具接駁式轉運之車輛運途問題，碩士論文，國立臺灣科技大學工業管理系碩士班，台北。
2.王豪山(2009)，運用類免疫演算法求解都市交通貨物運輸問題，碩士論文，國立成功大學交通管理學系碩士班，台南。
3.白健志(2010)，利用分組基因遺傳演算法解決多旅行推銷員的問題，碩士論文，南華大學資訊管理學系碩士班，嘉義。
4.何俊德(2011)，同時收送貨存貨途程配銷模式之研究─以混合免疫禁忌演算法求解，碩士論文，龍華科技大學資訊管理所，桃園。
5.余進彬(2007)，考量權重策略下之即時性存貨途程問題，碩士論文，私立大葉大學工業工程研究所，彰化。
6.吳宗祐(2007)，改良型螞蟻演算法結合模擬退火法於車輛途程問題之應用，碩士論文，華梵大學資訊管理學系碩士班，台北。
7.吳淑妍(2014)，物流產業的發展趨勢及我廠商面臨之商機與挑戰，經濟部電子報第 251 期，中華經濟研究院　第二所助研究員
8.吳淑妍(2014)，物流產業的發展趨勢及我廠商面臨之商機與挑戰，經濟部電子報(http://twbusiness.nat.gov.tw/epaperArticle.do?id=248512514)。
9.吳琮璠,謝清佳(1996)，資訊管理理論與實務增訂版，松崗書局經銷，台北。
10.吳達彥(2014)，應用人工免疫演算法求解集群路線車輛規劃問題－以機場接送服務為例，碩士論文，國立成功大學，台南。
11.吳鈴淳(2008)，以兩階段基因免疫演算法改良生存策略求解流程型排程問題，碩士論文，元智大學工業工程與管理學系碩士班，桃園。
12.呂志航(2007)，自動販賣機補貨配送作業問題之研究，國立高雄第一科技大學-運籌管理研究所碩士論文。
13.李其霖(2007)，考慮時間窗限制之卡車拖車路線問題，國立台南成功大學工業與資訊管理學系碩士論文。
14.李洪鑫(2000)，含時間窗車輛途程問題各演算法適用範圍之探討，碩士論文，東海大學工業工程研究所，台中。
15.李盈鋒(2009)，在考量尖峰時間下之同時收送貨的車輛途程問題，碩士論文，雲林科技大學全球運籌管理研究所碩士班，雲林。
16.李浩瑋(2010)，以混合免疫基因演算法探討文化行銷物流公司配銷系統之途程存貨問題，碩士論文，龍華科技大學資訊管理所，桃園。
17.李國村(2006)，以群蟻演算法求解動態車輛途程規劃，碩士論文，朝陽工業工程與管理研究所，台中。
18.李順斌(2002)，物流配銷系統下整合區位途程與存貨問題之研究，碩士論文，國立屏東科枝大學資訊管理研究所，屏東。
19.林大為(2008)，結合模擬退火之改良粒子群演算法於結構最佳化設計的研究，碩士論文，國立中央大學，桃園。
20.林孝禹(2014)，以變動鄰域搜尋法求解可調式多載具之車輛途程問題，碩士論文，國立台灣科技大學，台北。
21.林修竹(1999)，包容性啟發式解法在VRPTW問題上之應用，碩士論文，國立交通大學，新竹。
22.林依潔(2003)，整合模糊理論與螞蟻演算法於含時窗限制之車輛途程問題，國立台北科技大學生產系統工程與管理研究所碩士論文。
23.林信宇(2013)，以模擬退火法求解同時收送貨之區位途程問題，國立臺灣科技大學工業管理系碩士論文。
24.林美吟(2003)，可同時收送貨物網路下車輛巡行與收送計畫的多期排程，碩士論文，國立高雄第一科技大學運輸倉儲營運所，高雄。
25.邱仕銘(2006)，同時收送貨車輛配送問題之研究，碩士論文，長榮大學經營管理研究所，台南。
26.邱美姿(2008)，應用改良式遺傳演算法於資訊系統專案排程改善之研究，碩士論文，東吳大學資訊管理學系碩士班，台北。
27.俞慧蓮(2008)，以動態排課策略因素及禁忌搜尋法求解自動排課問題，碩士論文，屏東科技大學資訊管理系所，屏東。
28.夏祖文(2006)，應用模擬退火法於限制性經費之車輛途程問題，碩士論文，華梵大學資訊管理學系碩士班，台北。
29.殷敏修(2007)，應用基因演算法求解卡車拖車途程問題，碩士論文，國立高雄第一科技大學運籌管理研究所，高雄。
30.張哲旗(2008)，以混合啟發式演算法求解具模糊時窗限制車輛途程問題，碩士論文，龍華科技大學商學與管理研究所，桃園。
31.張潔穎(2015)，考量碳排放量的城市物流計劃方法之發展，碩士論文，國立中央大學，桃園。
32.莊英林(2012)，研究兩階段人工免疫系統演算法於物流管理中具接駁式轉運之車輛運途問題，國立臺灣科技大學工業管理系碩士論文。
33.許哲斌(2007)，在需求變動下具有軟時窗限制之同時收送貨車輛途程問題，碩士論文，雲林科技大學工業工程與管理研究所碩士班，雲林。
34.陳岸佐(2009)，週期性存貨途程問題彈性規劃模式與模式解之研究，碩士論文，屏東科技大學資訊管理所，屏東。
35.陳怡菁(2010)，考慮同時收送貨之自有車隊與委外貨運的車輛途程問題，碩士論文，雲林科技大學工業工程與管理研究所碩士班，雲林。
36.陳俊瑞(2008)，二階層供應鏈下整合定價與存貨途程問題之研究，碩士論文，屏東科技大學資訊管理所，屏東。
37.陳勇霖(2011)，考量產品時效成本整合生產排序與車輛途程規劃的總成本最小化問題，國立雲林科技大學工業工程與管理系碩士論文。
38.陳威甫(2011)，應用類免疫演算法於國民中學排課問題，國立臺北教育大學資訊科學系碩士論文。
39.黃玫珍(2009)，和弦搜尋演算法應用於同時收送貨之旅行推銷員問題，碩士論文，元智大學工業工程與管理學系碩士班，桃園。
40.黃俊傑(2009)，應用原罪遺傳演算法於運動賽事旅行成本最小化問題，碩士論文，輔仁大學資訊管理學系碩士班，台北。
41.黃信穎(2005)，同時處理收貨與送貨業務之配送路線規劃，碩士論文，立德管理學院應用資訊研究所，台南。
42.黃浩維(2015)，在不同運作模式下具容量限制的車輛途程問題之比較研究，碩士論文，朝陽科技大學資訊工程，台中。
43.楊子其(2010)，Web-Based 動態車隊管理系統之路徑規劃單元，碩士論文，國立台灣海洋大學電機工程學系，基隆。
44.楊明仁(2011)，模擬退火法結合禁忌搜尋法求解車輛回程途徑問題，華梵大學資訊管理學系碩士論文。
45.楊明仁(2010)，模擬退火法結合禁忌搜尋法求解車輛回程途徑問題，碩士論文，華梵大學資訊管理學系碩士班，台北。
46.楊思駿(2006)，應用免以演算法於逆物流存貨模式之研究，南台科技大學工業管理研究所碩士論文。
47.楊勝印(2006)，應用免疫演算法與行車操控模組於捷運系統電聯車排程最佳化之研究，碩士論文，國立高雄應用科技大學電機工程系碩士班，高雄。
48.劉芸希(2013)，接駁式轉運環境下具同時收送貨之車輛途程問題，碩士論文，雲林科技大學，雲林。
49.劉曄(2004)，整合同時收送貨與選擇貨運公司服務之車輛途程問題，碩士論文，國立臺灣海洋大學航運管理學系碩士班，基隆。
50.劉選泓(2010)，二階供應鏈聯合補貨策略下週期性車輛途程問題之規劃，碩士論文，雲林科技大學工業工程與管理研究所碩士班，雲林。
51.劉璧禎(2014)，台灣觀光碳排放的評估 四種碳排責任架構之應用，國立台南成功大學 交通管理科學系碩士論文。
52.劉璧禎(2015)，台灣觀光碳排放的評估四種碳排責任架構之應用，碩士論文，國立成功大學，台南。
53.劉繼仁(2012)，一個以車輛途程規劃為基礎之綠色物流配送計劃方法之發展，碩士論文，國立中央大學，桃園。
54.蔡元皓(2015)，考量分批送貨之多品項存貨途程問題，碩士論文，國立雲林科技大學，雲林。
55.鄧宗倫(2010)，應用人工智慧法於最佳消毒作業之時窗限制車輛途程問題，虎尾科技大學工業工程與管理研究所碩士論文 P1 – 122。
56.鄭雁嬬(2008)，混合式演算法應用於同時收送貨之車輛途程問題，碩士論文，元智大學工業工程與管理學系碩士班，桃園。
57.蕭賀元(2010)，含時窗限制之旅行銷售員相關問題之研究，東海大學資訊管理學系碩士論文。
58.Andreas Bortfeldt. (2012),“A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints”, Computers & Operations Research 39,2248–2257.
59.Benjamin K. Sovacool, Marilyn A.Brown(2010), “Twelve metropolitan carbon footprints: A preliminary comparative global assessment”, Energy Policy, Volume 38, Issue 9, Pages 4856-4869.
60.Bodin L, Golden B(1983), "A ssad A and Ball M. Routing and Scheduling of Vehicles and Crews: The State of the Arts.” Computers & Operations Research, 1983, 10: 62～ 212.
61.Bodin, L. and Golden, B.L. (1981), “Classification in vehicle routing and scheduling”, Networks, 11, 2, 97-108.
62.Canhong Lin, K.L. Choy, G.T.S. Ho, S.H.Chung and H.Y.Lam(2014), "Survey of Green Vehicle Routing Problem: Past and future trends", Expert Systems with Applications, Volume 41, Issue 4, Part 1, March 2014, Pages 1118-1138.
63.CASCO, D., B. GOLDEN and E. WASIL (1988), “Vehicle Routing with Backhauls: Models”, Algorithms and Case Studies, in Vehicle Routing: Methods and Studies, (B.L. Golden, A.A. Assad, eds.), North-Holland, Amsterdam, 127–147.
64.Casco, Daniel O., Bruce L. Golden, and Edward A. Wasil. (1988), "Vehicle routing with backhauls: models, algorithms and case studies", Vehicle routing: Methods and studies 16: 127-147.
65.Christofides, N. and Eilon, S. (1969), “An Algorithm for Vehicle Dispatching Problem ”, Operational Research Quarterly, 20(3), 309-318.
66.Clarke, G. and Wright, J. W. (1969), “Scheduling of vehicles from a Central Depot to a Number of delivery points”, Operations Research, 12, 4, 568-581(1964).
67.Dantzig, G.B. and Ramser, J.H. (1959), “The Truck Dispatching Problem”, Management Science, 6, 1, 80–91.
68.Devika Kannana, Ali Diabat, Mahmoud Alrefaei, Kannan Govindan and Geng Yong (2012), "A carbon footprint based reverse logistics network design model", Resources, Conservation and Recycling , Volume 67, October 2012, Pages 75-79.
69.Du, T.C., Li, E.Y. and Chou, D. (2005), “Dynamic vehicle routing for online B2C delivery”, Omega, 33, 1, 33-45.
70.E.N. Ntabe, L. LeBel, A.D. Munson, and L.A. Santa-Eulalia (2015), “A systematic literature review of the supply chain operations reference (SCOR) model application with special attention to environmental issues”, International Journal of Production Economics Volume 169,310-332.
71.Easton, K., Nemhauser, G. and Trick, M.A. (2001), “The traveling tournament problem: Description & benchmarks, Principles & Practice of Constraint Programming –CP”, Lecture Notes in Computer Science, Volume 2239, 580-584.
72.Fareeduddin, Adnan Hassan, M.N. Syed and S.Z. Selim. (2015), “The Impact of Carbon Policies on Closed-loop Supply Chain Network Design”, 12th Global Conference on Sustainable Manufacturing – Emerging Potentials, 335-340.
73.Farzad Niakan and Mohammad Rahimi (2015), "A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach", Transportation Research Part E: Logistics and Transportation Review, Volume 80, August 2015, Pages 74-94.
74.Federgruen (1984), A. and Zipkin, P. “A Combined Vehicle Routing and Inventory Allocation Problem”, Operations Research, 32, 5, 1019-1036.
75.Fisher, M. L. and Jaikumar R. (1981), “A Generalize Assignment Heuristic for Vehicle Routing Problems”, Networks, 11, 2, 109-124.
76.Fred W. Glover(1986), "Future paths for integer programming and links to artificial intelligence", Computers & Operations Research, Volume 13, Issue 5, 1986, Pages 533-549.
77.G. Nilay Yücenur and Nihan Çetin Demirel. (2011), "A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem", Expert Systems with Applications, Volume 38, Issue 9, September 2011, Pages 11859-11865.
78.Gillett, B. E. and Miller, L. R. (1974), “A heuristic algorithm for the vehicle-dispatch problem”, Operations Research, 22, 2340-349.
79.Golden B, Assad A.and Dahl R. (1984), “Analysis of a Large Scale Vehicle Routing Problem with an Inventory Component”, Large Scale System, 7, 2-3, 181-190.
80.Gunther Eysenbach (2015), “Adoption of Clinical Decision Support in Multimorbidity: A Systematic Review”, JMIR Medical Informatics, ISSN 2291-9694.
81.Ibrahim Hassan Osman (1993), “Metastrategy simulated annealing and tabu search algorithm for the vehicle routing problem”, Annals of Operations Research, 41,421-451.
82.IlKyeong Moon, Jeong-Hun Lee and June Seong (2012). “Vehicle routing problem with time windows considering overtime and outsourcing vehicles”, Expert Systems with Applications 39, 13202–13213.
83.Ismail Karaoglan, Fulya Altiparmak, ImdatKara and BernaDengiz (2011), "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery",European Journal of Operational Research, Volume 211, Issue 2, 1 June 2011, Pages 318-332.
84.J. Kennedy and R. C. Eberhart (1995), “Particle swarm optimization,” Proc. IEEE Int. Conf. on Neural Networks, Perth, Australia, vol. 4, pp. 1942-1948
85.Jaillet, P., Bard, J. F., Hung, L. and Dror, M. (2002), “Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework”, Transportation science, 36, 3, 292-300.
86.Moore, J. H., & Chang, M. G. (1980). “Design of decision support systems”. ACM SIGOA Newsletter, 1(4-5), 8-14.
87.Gonzalez‐Feliu, J., & Salanova Grau, J. M. (2015). “VRP algorithms for decision support systems to evaluate collaborative urban freight transport systems”. Enterprise Interoperability, 196-201.
88.John D. C. Little (1970), "Models and Managers: The Concept of a Decision Calculus", Management Science, Volume 16, Issue 8, Published Online: April 1, 1970, Page Range: B-466 - B-485.
89.José Brandão (2011), "A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem", Computers & Operations Research, Volume 38, Issue 1, January 2011, Pages 140-151.
90.Jose Carlos Molina, Ignacio Eguia, Jesus Racero, Fernando Guerrero (2014),” Multi-objective Vehicle Routing Problem with Cost and Emission Functions”, Procedia - Social and Behavioral Sciences, Volume 160, 19 December 2014, Pages 254-263.
91.Kleywegt, A., Nori, V., and Savelsbergh, M (2002)., “The Stochastic Inventory Routing Problem with Direct Deliveries”, Transportation Science, Vol. 29, No. 3.
92.P. C. Yellow. (1970), “A Computational Modification to the Savings Method of Vehicle Scheduling”, Operation Research Quarterly, 281-283.
93.Kunpeng Li, Bin Chen, Appa Iyer Sivakumar (2014), Yong Wu, "An inventory–routing problem with the objective of travel time minimization", European Journal of Operational Research, Volume 236, Issue 3, 1 August 2014, Pages 936-945.
94.Krolak, P., Felts, W., & Marble, G. (1971). “A man-machine approach toward solving the traveling salesman problem.” Communications of the ACM, 14(5), 327-334.
95.Lin, S(1965). “Computer solutions of the traveling salesman problem,” Bell System Technology Journal, 44, 1, 2245-2269.
96.Lin, S., & Kernighan, B. W. (1973). “An effective heuristic algorithm for the traveling-salesman problem”. Operations research, 21(2), 498-516.
97.Dror, M., Ball, M., & Golden, B. (1985).“A computational comparison of algorithms for the inventory routing problem”. Annals of Operations Research, 4(1), 1-23.
98.Bolduc, M. C., Laporte, G., Renaud, J., & Boctor, F. F. (2010). “A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars”. European Journal of Operational Research, 202(1), 122-130.
99.Savelsbergh, M., & Song, J. H. (2008). “An optimization algorithm for the inventory routing problem with continuous moves”. Computers & operations research, 35(7), 2266-2282.
100.Zarandi, M. H. F., Hemmati, A., & Davari, S. (2011). “The multi-depot capacitated location-routing problem with fuzzy travel times”. Expert Systems with Applications, 38(8), 10075-10084.
101.Dror, M., & Ball, M. (1987). “Inventory/routing: Reduction from an annual to a short‐period problem”. Naval Research Logistics (NRL), 34(6), 891-905.
102.Eberhart, R., & Kennedy, J. (1995, October). “A new optimizer using particle swarm theory”. In Micro Machine and Human Science, 1995. MHS'95., Proceedings of the Sixth International Symposium on (pp. 39-43). IEEE.
103.Ren Qing-dao-er-ji, Yuping Wang (2013), "Inventory Based Bi-Objective Flow Shop Scheduling Model and Its Hybrid Genetic Algorithm", Mathematical Problems in Engineering . 2013, p1-7. 7p.
104.Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. science, 220(4598), 671-680.
105.S.M.J. Mirzapour Al-e-hashem, Yacine Rekik (2014),"Multi-product multi-period Inventory Routing Problem with a transshipment option: A green approach", International Journal of Production Economics ,Volume 157, November 2014, Pages 80-88.
106.Salhi, S. and G. Nagy (1999), “A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling”, Journal of the Operational Research Society, 50, 1034-1042.
107.Sascha Wohlgemuth, Richard Oloruntoba and Uwe Clausen(2012). “Dynamic vehicle routing with anticipation in disaster relief”, Socio-Economic Planning Sciences 46,261-271.
108.Shaolong Tang, Wenjie Wang, Hong Yan, Gang Hao(2015), “Low carbon logistics: Reducing shipment frequency to cut carbon emissions”, International Journal of Production Economics Volume 164,339-350.
109.Solomon M, Desrosiers J (1988), "Time Window Constrained Routing and Scheduling Problems : A Survey”. Trans sportation Science, 1988, 22 (1): 1～11.
110.Sprague, R.H., Jr and Carlson, E.D(1982). “Building Effective Decision Support Systems”, Englewood Cliffs, NJ: Prentice Hall.
111.Steven L. Alter (1980), “Decision support systems: Current practice and continuing challenges”. Reading, Massachusetts: Addison-Wesley Publishing Co., 316 pp.
112.Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, Christian Prins (2013), "A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows", Computers & Operations Research, Volume 40, Issue 1, January 2013, Pages 475-489.
113.Thompson, P. M. and Psaraftis, H (1993). “Cyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems”, Operations Research, 41, 5, 935-946.
114.Thoo Ai Chin, Huam Hon Tat, Zuraidah Sulaiman (2015),” Green Supply Chain Management, Environmental Collaboration and Sustainability Performance”, 12th Global Conference on Sustainable Manufacturing – Emerging Potentials,695-699.
115.Trisha L.C. Moore, William F. Hunt (2013),”Predicting the carbon footprint of urban stormwater infrastructure”, Ecological Engineering, Volume 58,44-51.
116.V.Černý (1985), "A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm", Journal on Optimization Theory and Applications 45, 41-51. [155].
117.Vinicius W.C. Morais, Geraldo R. Mateus, Thiago F. Noronha (2014), "Iterated local search heuristics for the Vehicle Routing Problem with Cross-Docking", Expert Systems with Applications, Volume 41, Issue 16, 15 November 2014, Pages 7495-7506.
118.Jiang-qing, W., & Xiao-nian, T. (2009, August). Web-based vehicle routing system using wireless communication techniques. In Computing, Communication, Control, and Management, 2009. CCCM 2009. ISECS International Colloquium on (Vol. 4, pp. 498-500). IEEE.
119.Shi, Y., & Eberhart, R. (1998). “A modified particle swarm optimizer”. In Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on (pp. 69-73). IEEE.
120.Yan Li, Wenru Tan, Ruili Sha (2016), “The empirical study on the optimal distribution route of minimum carbon footprint of the retail industry”, Journal of Cleaner Production, Volume 112, Part 5,4237-4246.
121.Yiannis A. Koskosidis, Warren B. Powell, Marius M. Solomon (1992), "An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints", Transportation Science, Volume 26, Issue 2, Page Range: 69 – 85.
122.Zhanbiao Bao, Jianjun Wu, Tong Zhen, and Hongyi Ge(2010). “A Decision Support System Based on GIS for Grain Logistics Vehicle Routing Problem”, 6th International Conference on Intelligent Computing, 564-570.
123.Palmer, A. (2007). “The development of an integrated routing and carbon dioxide emissions model for goods vehicles.” , PhD Thesis, School of Management, Cranfield University.