考量碳排放量的城市物流計劃方法之發展;A planning method of city logistics considerations carbon emissions

NCUIR > School of Management at National Central University > Graduate Institute of Business Administration > Electronic Thesis & Dissertation > Item 987654321/67407

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/67407

Title:	考量碳排放量的城市物流計劃方法之發展;A planning method of city logistics considerations carbon emissions
Authors:	張潔穎;chang,chieh-ying
Contributors:	企業管理學系
Keywords:	動態最小擴張樹;城市物流;容量限制設施選址路徑問題;綠色物流;dynamic minimum spanning tree;city logistics;capacitated location routing problem;green logistics
Date:	2015-03-26
Issue Date:	2015-05-08 15:33:01 (UTC+8)
Publisher:	國立中央大學
Abstract:	環保、永續發展已成全球共識,如何節能減碳成為各國努力目標。過去在城市物流研究中,包含了兩階層的設施選址問題、容量限制車輛路徑問題、時窗性同步城市物流系統等問題,使用啟發式解法對ㄧ二階層分別求解,目標皆以如何有效率地使用車輛、增進載貨效益、降低運輸成本等經濟上考量為主,卻未考慮碳排放量污染對於城市內交通、生活的影響。因此本研究提出一考慮碳排放量的城市物流綠色模型,在此模型下以最低碳排放量為目標求解兩階層架構的城市物流中,第二階層多倉庫容量限制車輛路徑問題 (multidepot capacitated vehicle routing problem, MDCVRP)的問題,不僅考量車輛行駛距離對碳排放量的影響,更將車輛行駛速度納入考慮,將城市中各路段的交通狀況以時間軸表示,動態計算出車輛行駛產生的碳排放量,並可計算出車輛抵達各節點的時間求解方法則以容量限制設施選址路徑問題(capacitated location routing, CLR)模型做修改,發展出動態最小擴張樹,使用劉繼仁(2012)的路段時間軸概念,推算出生成樹邊(路段)碳排放量,樹節點的抵達時間,生成一個具順序性的動態最小擴張樹,求解車輛服務路徑。最後將本研究方法以C語言寫出一程式,以五個數值例做方法驗證,證明方法可行性, 進一步再以六十個例子比較本研究方法與Harks的容量限制設施選址路徑問題(CLR)模型方法求解結果差異,本研究方法達成其綠色目標,在整體碳排放量及平均每英里的碳排放量方面皆達成效,並且在車輛總行駛英里數方面本研究方法優於以行駛距離最小為目標的Harks方法。;Past studies in city logistics to the main economic considerations, but did not consider the carbon emissions for city traffic and pollution. Therefore, this study presents a green model of city logistics takes into account carbon emissions to solve the multidepot capacitated vehicle routing problem. Not only considering the distance of vehicle, but will take into account the vehicle speed. The traffic situation in the various sections of the city to the timeline and calculated carbon emissions generated by vehicle. The method is based on capacitated location routing model,developing a dynamic minimum spanning tree to solve vehicle routing problem. Finally, generating five examples to prove the feasibility of the method and sixty examples to show the solution quality.
Appears in Collections:	[Graduate Institute of Business Administration] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	370	View/Open

社群 sharing

Loading...