| DC 欄位 |
值 |
語言 |
| DC.contributor | 企業管理學系 | zh_TW |
| DC.creator | 張哲瑋 | zh_TW |
| DC.creator | Che-wei Chang | en_US |
| dc.date.accessioned | 2014-7-24T07:39:07Z | |
| dc.date.available | 2014-7-24T07:39:07Z | |
| dc.date.issued | 2014 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=101421056 | |
| dc.contributor.department | 企業管理學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 環境污染和石油危機一直是人們關注的議題之一，近年來，為了達到新的環境保護標準，部分物流業者正準備將傳統燃料車隊改換成碳排放極低的電動車隊。在這篇論文中，以區域物流的範疇為主軸，和Erdoğan and Miller-Hooks (2012)所提出的綠色車輛途程問題(GVRP)為雛型，發展一個新的電動車途程規劃模型(E-VRP)來克服現實中電動車最大里程數不足及充電站設置短缺的問題，並提出一個新的演算法來進行問題求解。在情境模擬時，將車輛容量、送貨時間限制、和電動車相關因素等條件考慮進去，目標除了最小化路線總距離以外，亦期望每台車輛之送貨時間能平均，以避免傳統VRP因途程趟數限制所造成的車輛閒置。最後，本論文以德國法蘭克福地圖為實例展示演算法的路線規劃成果。 | zh_TW |
| dc.description.abstract | In this paper, an electric vehicles-vehicle routing problem (E-VRP) is defined and formulated for simulating the goods distribution by using electric vehicles in region logistics. The E-VRP seeks to find a set of minimum-cost routes that can serve the delivery tasks in a given graph, subject to the vehicle capacity, maximum delivery time, and driving range. A mathematical model and a heuristics algorithm are developed to solve E-VRP. At last, a case in Germany, Frankfurt is applied to demonstrate the proposed algorithm, and the possible
improvement are discussed.
| en_US |
| DC.subject | 區域物流 | zh_TW |
| DC.subject | 電動載具 | zh_TW |
| DC.subject | Region Logistics | en_US |
| DC.subject | Electric Vehicles | en_US |
| DC.title | 區域物流架構下使用電動載具的商品配送方法之發展 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | A distribution method for the region logistics using electric vehicles | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |