區域物流架構下使用電動載具的商品配送方法之發展

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：10

、訪客IP：18.220.102.112

姓名

張哲瑋(Che-wei Chang) 查詢紙本館藏

畢業系所

企業管理學系

論文名稱

區域物流架構下使用電動載具的商品配送方法之發展
(A distribution method for the region logistics using electric vehicles)

相關論文

★ 企業流程為核心的食品產業運籌體系規劃:低溫物流部份	★ 以企業流程方法規劃整體飛航後勤維修體系之研究
★ 成衣產業導入ERP運籌管理方案之個案研究	★ 光電產業試產基地之生產最佳化模式：以光投影機為例
★ TFT LCD產業獲利因素之探討	★ 科技事業進行合併/讓售之決策過程與成效之個案探討
★ 企業治理、風險及遵循解決方案導入之個案研究-以職責分離資訊系統為例	★ 品質機能展開與多準則決策於設備開發應用
★ ERP導入品質因素對IFRS轉換專案之影響	★ ERP投資金額對服務品質及導入後IT治理目標之分析
★ ERP 導入問題對專案的影響	★ IFRS轉換對員工退休金計畫影響
★ IFRS轉換問題對IFRS效益的影響	★ 電子產業新產品開發參考模式之發展
★ 應用資料科學方法提昇國防裝備可靠度之研究－以防空系統為例	★ 企業資訊方案行銷歷程之探討-以MES為例

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

環境污染和石油危機一直是人們關注的議題之一，近年來，為了達到新的環境保護標準，部分物流業者正準備將傳統燃料車隊改換成碳排放極低的電動車隊。在這篇論文中，以區域物流的範疇為主軸，和Erdoğan and Miller-Hooks (2012)所提出的綠色車輛途程問題(GVRP)為雛型，發展一個新的電動車途程規劃模型(E-VRP)來克服現實中電動車最大里程數不足及充電站設置短缺的問題，並提出一個新的演算法來進行問題求解。在情境模擬時，將車輛容量、送貨時間限制、和電動車相關因素等條件考慮進去，目標除了最小化路線總距離以外，亦期望每台車輛之送貨時間能平均，以避免傳統VRP因途程趟數限制所造成的車輛閒置。最後，本論文以德國法蘭克福地圖為實例展示演算法的路線規劃成果。

摘要(英)

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.

關鍵字(中)

★ 區域物流
★ 電動載具

關鍵字(英)

★ Region Logistics
★ Electric Vehicles

論文目次

摘要………………………………………………………………………………………i
英文摘要………………………………………………………………………………ii
目錄………………………………………………………………………………………iii
圖目錄……………………………………………………………………………………iv
表目錄……………………………………………………………………………………vi
第一章、簡介………………………………………………………………………1
1.1研究問題說明……………………………………………………1
1.2研究目的和範圍…………………………………………………1
第二章、相關研究探討………………………………………………………3
2.1區域物流之模型與方法……………………………………3
2.2綠色區域物流模型……………………………………………11
2.3電動車與充電站介紹………………………………………15
第三章、模型發展………………………………………………………………22
3.1問題描述………………………………………………………………22
3.2數學規劃模型………………………………………………………26
3.3求解方法構想……………………………………………………29
3.4求解演算法…………………………………………………………41
第四章、應用案例………………………………………………………………57
4.1實際操作……………………………………………………………57
4.2實務應用……………………………………………………………74
第五章、結論與後續研究議題…………………………………………82
5.1結論………………………………………………………………………82
5.2後續研究議題………………………………………………………………82
附錄(一) ………………………………………………………………………………83
參考文獻…………………………………………………………………………………84

參考文獻

Amaya, A., Langevin, A., Trepanier, M., 2007. The capacitated arc routing problem with refill points. Operations Research Letters 35 (1), 45–53.

Aráoz, J., Fernández, E., Meza, O., 2009. Solving the prize-collecting rural postman problem. European Journal of Operational Research 196 (3), 886–896.

Assad, A., Golden, B., 1995. Arc routing methods and applications. Handbooks in Operations Research and Management Science 8, 375–483.

Baldacci, R., Maniezzo, V., 2006. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 (1), 52–60.

Bapna, R., Thakur, L.S., Nair, S.K., 2002. Infrastructure development for conversion to environmentally friendly fuel. European Journal of Operational Research 1423, 480–496.

Bard, J. F., L. Huang, M. Dror and P. Jaillet (1988). "A branch and cut algorithm for the VRP with satellite facilities." IIE Transactions 30(9): 821-834.

Bautista, J., Fernández, E., Pereira, J., 2008. Solving an urban waste collection problem using ants heuristics. Computers & Operations Research 35 (9), 3020–3033.

Belenguer, J.M., Benavent, E., 2003. A cutting plane algorithm for the capacitated arc routing problem. Computers & Operations Research 30 (5), 705–728.

Belenguer, J.M., Benavent, E., 2003. A cutting plane algorithm for the capacitated arc routing problem. Computers & Operations Research 30 (5), 705–728.

Benavent, E., Corberán, A., Plana, I., Sanchis, J.M., 2009. Min–Max K-vehicles windy rural postman problem. Networks 54 (4), 216–226.

Beullens, P., Muyldermans, L., Cattrysse, D., Van Oudheusden, D., 2003. A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research 147 (3), 629–643.

Bodin, L.B., A. Assad and M. Ball. 1983. Routing and Scheduling of Vehicle and Crews: The State of the Art. Computers & Operations Research, 10, 62-212.

Brandão, J., Eglese, R., 2008. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35 (4), 1112–1126.

Bruce L Golden, Richard T Wong. Capacitated Arc Routing Problems. Networks, 1981, 11(3): 305-315.

Chu, F., Labadi, N., Prins, C., 2006. A Scatter Search for the periodic capacitated arc routing problem. European Journal of Operational Research 169 (2), 586–605.

Clarke, G., and Wright, J., 1964. Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12, 568-581.

Corberán, A., Prins, C., 2010. Recent results on arc routing problems: an annotated bibliography. Networks 56 (1), 50–69.

Dablanc, L. 2007. Goods transport in large European cities: Difficult to organize, difficult to modernize. Transportation Res. Part A: Policy Practice 41(3) 280–285.

Dror, M., 2000. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers.

E.K. Baker, 1983. An exact algorithm for the time-constrained traveling salesman problem. Oper. Res. 31, 65-73.

Eglese, R.W., 1994. Routeing winter gritting vehicles. Discrete Applied Mathematics 48 (3), 231–244.

EISA (the Energy Independence and Security Act), 2007. Public Law 110-140, December 19, 2007.

Eiselt, H., Gendreau, M., Laporte, G., 1995a. Arc routing problems, Part I: The Chinese postman problem. Operations Research 43 (2), 231–242.

Eiselt, H., Gendreau, M., Laporte, G., 1995b. Arc routing problems, Part II: The rural postman problem. Operations Research 43 (3), 399–414.
EPAct (The Energy Policy Act), 1992. Public Law 102-486, October 24, 1992.

EPAct (The Energy Policy Act), 2005. Public Law 109-58, August 8, 2005.

Ester, M., Kriegel, H.P., Sander, J., Xu, X., 1996. A density-based algorithm for discovering clusters in large spatial databases. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD.96), Portland, Oregon, pp. 226–231.

Executive Order (EO) 13423, 2007. Strengthening Federal Environmental, Energy, and Transportation Management. Federal Register, vol. 72, No. 17, Friday, January 26, 2007.

G Dantig, J Ramser., 1959. The Truck Dispatching Problem. Management Science, 6: 80.

Gambardella, L. M., Taillard, E., Agazzi, G. (1999). "MACS-VRPTW: A Multiple Colony System For Vehicle Routing Problems With Time Windows." New ideas in optimization: 63-76.

Gillett, B. E., and Miller, L. R., 1974. A heuristic algorithm for the vehicle dispatch problem. Operations Research, 22, 340-349.

Golden, B., 1975. Vehicle routing problem: Formulations and heuristic solution techniques. ORC Tech. M.I.T., Rep. 113.

Golden, B., Baker, E., Alfaro, J., and Schaffer, J., 1985. The vehicle routing problem with backhauling: two approaches. Proceedings of the Twenty-First Annual Meeting of S.E.TIMS, Myrtle Beach, Sc, 90-92.

Greistorfer, P., 2003. A tabu scatter search metaheuristic for the arc routing problem. Computers & Industrial Engineering 44 (2), 249–266.

Hertz, A., Laporte, G., Hugo, P.N., 1999. Improvement procedures for the undirected rural postman problem. Informs Journal on Computing 11 (1), 53–62.

Hertz, A., Laporte, G., Mittaz, M., 2000. A tabu search heuristic for the capacitated arc routing problem. Operations Research 48 (1), 129–135.

Hertz, A., Mittaz, M., 2001. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science 35 (4), 425–434.

Hirabayashi, R., Saruwatari, Y., Nishida, N., 1992. Tour construction algorithm for the capacitated arc routing problem. Asia–Pacific Journal of Operational Research 9 (2), 155–175.

Hirabayashi, R., Saruwatari, Y., Nishida, N., 1992. Tour construction algorithm for the capacitated arc routing problem. Asia–Pacific Journal of Operational Research 9 (2), 155–175.

Kara, I., Laporte, G., Bektas, T., 2004. A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem.

Kuby, M., Lim, S., 2005. The flow-refueling location problem for alternative-fuel vehicles. Socio-Economic Planning Science 39, 125–145.

Lenstra J. and Ken A. r., 1981, "Complexity of Vehicle Routing and Scheduling Problems", Networks, pp. 221-227.

Lin, S., 1965. Computer solutions of the traveling salesman problem. Bell System Tech. J, 44, 2245-2269.

Lin, S., and Kernighan, B., 1973. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498-516.

Lin, Z., Chena, C.-W., Ogden, J., Fan, Y., 2008b. The least cost hydrogen for southern California. International Journal of Hydrogen Energy 33 (12), 3009–3014.

Lin, Z., Ogden, J., Fan, Y., Chena, C.-W., 2008a. The fuel-travel-back approach to hydrogen station siting. International Journal of Hydrogen Energy 33 (12), 3096–3101.

Longo, H., De Araga~o, M.P., Uchoa, E., 2006. Solving capacitated arc routing problems using a transformation to the CVRP. Computers & Operations Research 33 (6), 1823–1837.

Longo, H., De Araga~o, M.P., Uchoa, E., 2006. Solving capacitated arc routing problems using a transformation to the CVRP. Computers & Operations Research 33 (6), 1823–1837.

Mourão, M.C., Nunes, A.C., Prins, C., 2009. Heuristic methods for the sectoring arc routing problem. European Journal of Operational Research 196 (3), 856–868.

Muyldermans, L., Beullens, P., Cattrysse, D., Van Oudheusden, D., 2005. Exploring variants of 2-opt and 3-opt for the general routing problem. Operations Research 53 (6), 982–995.

Nakul Sathaye, Scott Kelley, 2013. An approach for the optimal planning of electric vehicle infrastructure for highway corridors. Transportation Research Part E 59, 15–33.

Nicholas, M., Handy, S., Sperling, D., 2004. Using geographic information systems to evaluate siting and networks of hydrogen stations. Transportation Research Record 1880, 126–134

PM Thompson, HN Psaraftis, 1993. Cyclic transfer algorithm for multivehicle routing and scheduling problems. Operations research 41 (5), 935-946

Potvin, J., Duhamel, C., and Guertin, F., 1996. A genetic algorithm for vehicle routing with backhauling. Applied Intelligence, 6, 345-355.

Richard Y.K. Fung, Ran Liu, Zhibin Jiang, 2013. A memetic algorithm for the open capacitated arc routing problem. Transportation Research Part E 50 (2013) 53–67.

Schroeder, A., Traber, T., 2012. The economics of fast charging infrastructure for electric vehicles. Energy Policy 43, 136–144.

Sevgi Erdoğan, Elise Miller-Hooks, 2012. A Green Vehicle Routing Problem. Transportation Research Part E 48 (2012) 100–114.

Solomon, M.M. (1987), "Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints" Operations Research, Vol.35, No.2, pp.254-265.

Svoboda, V., 2009. Fast Charging. Encyclopedia of Electrochemical Power Sources, 424–442.
Tagmouti, M., Gendreau, M., Potvin, J.Y., 2007. Arc routing problems with time-dependent service costs. European Journal of Operational Research 181 (1), 30–39.

Toth, P., and Vigo, D., 1997. An exact algorithm for the vehicle routing problem with backhauls. Transportation science, 31(4), 372-385.

Toth, P., and Vigo, D., 1999. A heuristic algorithm for the symmetric and asymmetric vehicle routing problem with backhauls. European Journal of Operational Research, 113, 528-543.

Upchurch, C., Kuby, M., Lim., S., 2007. A capacitated model for location of alternative-fuel stations. Geographical Analysis 41 (1), 85–106.

US DOE, Department of Energy, 2010. Transportation Data Book, Edition 29 by Davis, S.C., Diegel, S.W., Boundy, R.G. Oak Ridge National Laboratory, ORNL-6985.

Usberti, F.L., França, P.M., França, A.L.M., 2011. The open capacitated arc routing problem. Computers & Operations Research 38 (11), 1543–1555.

Verrijdt, J., A. de Kok. 1995. Distribution planning for a divergent N-echelon network without intermediate stocks under service restrictions. Internat. J. Production Econom. 38 225–243.

Wang, Y.-W., Lin, C.-C., 2009. Locating road-vehicle refueling stations. Transportation Research Part E: Logistics and Transportation.

Wøhlk, S., 2008. An approximation algorithm for the capacitated arc routing problem. Open Operational Research Journal 2, 8–12.

Ying-Wei Wanga, Chuah-Chih Lin, 2013. Locating multiple types of recharging stations for battery-powered electric vehicle transport. Transportation Research Part E 58, 76–87.

中文文獻：
劉繼仁(2012)，一個以車輛途程規劃為基礎之綠色物流配送計劃方法之發展

網站資料：
行政院官方網站http://www.ey.gov.tw/policy8/cp.aspx?n=E1CE7A91363ABB7D

指導教授

呂俊德(Jun-der Leu)

審核日期

2014-7-24

推文