資料載入處理中...
臺灣人文及社會科學引文索引資料庫系統
:::
網站導覽
國圖首頁
聯絡我們
操作說明
English
行動版
(3.144.10.182)
登入
字型:
**字體大小變更功能,需開啟瀏覽器的JAVASCRIPT,如您的瀏覽器不支援,
IE6請利用鍵盤按住ALT鍵 + V → X → (G)最大(L)較大(M)中(S)較小(A)小,來選擇適合您的文字大小,
如為IE7以上、Firefoxy或Chrome瀏覽器則可利用鍵盤 Ctrl + (+)放大 (-)縮小來改變字型大小。
來源文獻查詢
引文查詢
瀏覽查詢
作者權威檔
引用/點閱統計
我的研究室
資料庫說明
相關網站
來源文獻查詢
/
簡易查詢
/
查詢結果列表
/
詳目列表
:::
詳目顯示
第 1 筆 / 總合 1 筆
/1
頁
來源文獻資料
摘要
外文摘要
引文資料
題名:
快遞與隔日配貨物之車輛路線規劃與應用分析
書刊名:
運輸學刊
作者:
林志鴻
作者(外文):
Lin, Chih-hung
出版日期:
2010
卷期:
22:1
頁次:
頁101-129
主題關鍵詞:
單一車輛路線問題
;
快遞貨物
;
隔日配貨物
;
Single-vehicle routing problem
;
SVRP
;
Express freight
;
Overnight freight
原始連結:
連回原系統網址
相關次數:
被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
排除自我引用:0
共同引用:
5
點閱:12
近年來,隨網路購物與電視購物之發展與競爭,促使網購或電購貨物之前置時間愈來愈短,而貨運業者所配送貨物之時限亦各有不同,本研究將探討貨運業者面臨同時服務快遞貨物與隔日配貨物之車輛路線問題 (VRPEO)。此問題屬單一車輛路線問題(SVRP)之變化,其與單一車輛路線問題較不同之問題特性包括因節點具時間限制,使車輛路線無法服務所有需服務的節點、除部分節點具動態性外,車輛回場站之時間亦具動態性等。本研究除明確定義問題、構建相關數學模式,以及研提啟發法進行求解外,亦進一步分析貨物運送時間限制之寬鬆程度與路線成本之關係,期能提供相關業者之參考與後續研究之依循。
以文找文
In recent years, the lead time of freight is becoming shorter and shorter because of the sharp competition among e-shopping centers and TV shopping stores. This situation leads to the requirement of delivering express freight for overnight freight carriers and delivering overnight freight during workdays for express freight carriers. In this article, the vehicles need to deliver express freight and overnight freight in the same time, so we called the problem the vehicle routing problem for delivering express and overnight freight (VRPEO). The VRPEO is a variant of single vehicle routing problem (SVRP). The VRPEO is different from the general SVRP. For example, some nodes are selected to be served by a vehicle; there is time constraint in the depot; and this problem belongs to a dynamic vehicle routing problem. In addition to clearly defining the routing problem, we constructed a model and developed heuristic algorithms to solve the VRPEO. Furthermore, we also studied the correlation between the time constraint and the route cost for providing some suggestions to freight carriers.
以文找文
期刊論文
1.
Mosheiov, G.(1994)。The traveling salesman problem with pick-up and delivery。European Journal of Operational Research,79(2),299-310。
2.
Bodin, L. D.、Golden, B. L.、Assad, A. A.、Ball, M. O.(1983)。Routing and Scheduling of Vehicles and Crews: The State of the Art。Computers & Operations Research,10(2),63-211。
3.
韓復華、王國琛(20020600)。巨集啟發式解法在求解大規模旅行推銷員問題之應用。運輸學刊,14(2),1-14。
延伸查詢
4.
Anily, S. and Mosheiov, G.(1994)。“The Traveling Salesman Problem with Delivery and Backhauls,”。Operations Research Letters,vol. 16;no. 1,pp. 11-18。
5.
Azi, N., Gendreau, M., and Potvin, J. Y.(2007)。“An Exact Algorithm for a Single-vehicle Routing Problem with Time Windows and Multiple Routes,”。European Journal of Operational Research,vol. 178;no. 3,pp. 755-766。
6.
Chakroborty, P. and Mandal, A.(2005)。“An Sexual Genetic Algorithm for the General Single Vehicle Routing Problem,”。Engineering Optimization,vol. 37;no. 1,pp. 1-27。
7.
Dueck, G. and Scheuer, T.(1990)。“Threshold Accepting: A General Purpose Optimization Algorithm Appeared Superior to Simulated Annealing,”。Journal of Computational Physics,vol. 90;no. 1,pp. 161-175。
8.
Gendreau, M., Laporte, G., and Solomon, M. M.(1995)。“Singe-vehicle Routing and Scheduling to Minimize the Number of Delays,”。Transportation Science,vol. 29;no. 1,pp. 56-62。
9.
Gendreau, M., Laporte, G., and Vigo, D.(1999)。“Heuristics for the Traveling Salesman Problem with Pickup and Delivery,”。Computers and Operations Research,vol. 26;no. 7,pp. 699-714。
10.
Gribkovskaia, I., Halskau, Ø., Laporte, G., and Vlček, M.(2007)。“General Solutions to the Single Vehicle Routing Problem with Pickups and Deliveries,”。European Journal of Operational Research,vol. 180;no. 2,pp. 568-584。
11.
Gribkovskaia, I., Laporte, G., and Shyshou, A.(2008)。“The Single Vehicle Routing Problem with Deliveries and Selective Pickups,”。Computers and Operations Research,vol. 35;no. 9,pp. 2908-2924。
12.
Laporte, G. and Martello, S.(1990)。“The Selective Travelling Salesman Problem,”。Discrete Applied Mathematics,vol. 26;no. 2-3,pp. 193-207。
13.
Mitrovic-Minic, S., Krishnamurti, R., and Laporte, G.(2004)。“Double-horizon Based Heuristics for the Dynamic Pickup and Delivery Problem with Time Windows,”。Transportation Research Part B,vol. 38;no. 8,pp. 669-685。
14.
Renaud, J., Boctor, F. F., and Ouenniche, J.(2000)。“A Heuristic for the Pickup and Delivery Traveling Salesman Problem,”。Computers and Operations Research,vol. 27;no. 9,pp. 905-916。
15.
Santos, H. G., Ochi, L. S., Marinho, E. H., and Drummond, L. M. A.(2006)。“Combining an Evolutionary Algorithm with Data Mining to Solve a Single-vehicle Routing Problem,”。Neurocomputing,vol. 70;no. 1-3,pp. 70-77。
16.
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。
17.
Süral, H. and Bookbinder, J. H.(2003)。“The Single-vehicle Routing Problem with Unrestricted Backhauls,”。Networks,vol. 41;no. 3,pp. 127-136。
圖書
1.
許志義(1995)。多目標決策,二版。臺北:五南圖書出版公司。
延伸查詢
2.
Elion, S., Watson-Gandy, C., and Christofides, N.(1971)。Distribution Management, Mathematical Modeling and Practical Analysis。London。
3.
Psaraftis, H. N.(1988)。Dynamic Vehicle Routing Problems。Vehicle Routing: Methods and Studies。New York。
推文
當script無法執行時可按︰
推文
推薦
當script無法執行時可按︰
推薦
引用網址
當script無法執行時可按︰
引用網址
引用嵌入語法
當script無法執行時可按︰
引用嵌入語法
轉寄
當script無法執行時可按︰
轉寄
top
:::
相關期刊
相關論文
相關專書
相關著作
熱門點閱
1.
應用螞蟻演算法提升售後服務保修專員指派績效之研究
2.
調適型導引螞蟻演算法求解時窗收卸貨問題之研究
3.
應用時窗分割與整數化策略簡化時窗收卸貨問題之研究
4.
宅配業車輛路線問題之研究
5.
巨集啟發式解法在求解大規模旅行推銷員問題之應用
無相關博士論文
無相關書籍
無相關著作
無相關點閱
QR Code