:::

詳目顯示

回上一頁
題名:路線貨運業貨物排程模式之研究
書刊名:運輸計劃
作者:陳春益 引用關係林正章 引用關係高玉明
作者(外文):Chen, Chuen-yihLin, Cheng-changGau, Yuh-ming
出版日期:1997
卷期:26:2
頁次:頁327-352
主題關鍵詞:路線貨運業貨物排程模式Dantzig-wolfe分解演算法決策支援系統Time definite carrierFreight routing modelDantzig-wolfe decomposition algorithmDecision support system
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(11) 博士論文(2) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:10
  • 共同引用共同引用:4
  • 點閱點閱:28
     為期協助國內路線貨運業處理其所面臨之貨物排程問題,本文根據路線貨運業營運 網路及貨物排程問題之特性,將營運網路予以電腦化,據以構建貨物排程模式。由於電腦化營 運網路之際,儘量納入貨件於中繼站轉運必須考量的因素,包括時間上、空間上之接駁等,故 本文所構建之貨物排程模式,其限制式相當簡化,有助於模式之求解。 本文並以國內某大路線貨運公司貨物排程問題為例進行實例研究,利用Dantzig-Wolfe 分解演 算法求解屬多元商品網路流量問題之貨物排程模式。實例結果顯示,貨物排程模式應可協助業 者搜尋各起迄對貨物之運送路徑,亦可提供資訊供分析承運貨物之各車輛路線運送情形,包括 承載率、轉運量、以及加班車之調派等。此外,為利於查詢與展示營運網路與運算結果,本研 究以地理資訊系統MapInfo 為使用者介面,可作為未來開發貨物排程決策支援系統之參考。
     This paper attempts to formulate a freight routing model for time definite carriers. The optimization model takes the characteristics of the freight routing problem time definite carriers facing as well as their internal operation networks into account and treats that as a multicommodity network flow problem. Furthermore, we propose an algorithm for solving it based on a column generation scheme, e.g., Dantzig-Wolfe Decomposition Algorithm. The freight routing model has been tested on a certain major carrier's network in Taiwan. The results show promising. Additionally, in order to make carrier's staff easily use the system and diagnose the data integrity, the model is constructed under a decision support system developed by a Geographic Information System tool, MapInfo. The system can quickly display the operation network as well as process queries for the results determined by the optimization model.
期刊論文
1.陳春益、余秀梅(19931100)。次梯度資源導向分解演算法應用於動態貨櫃調度模式之研究。成功大學學報,28(科技.醫學篇),199-214。  延伸查詢new window
2.Powell, Warren B.、Sheffi, Yosef(1989)。Design and implementation of an interactive optimization system for network design in the motor carrier industry。Operations Research,37(1),12-29。  new window
3.Leung, Janny M.、Magnanti, Thomas L.、Singhal, Vijay(1990)。Routing in point-to-point delivery systems: formulations and solution heuristics。Transportation Science,24(4),245-260。  new window
4.Crainic, T. G.、Roy, J.(1992)。Improving Intercity Freight Routing with a Tactical Planning Model。Interfaces,22,31-44。  new window
5.Powell, W. B.、Sheffi, Y.(1983)。The Load Planning Problem of Motor Carrier: Problem Description and a Proposed Solution Approach。Transportation Research,17,471-480。  new window
6.葉宏謨(19850000)。零擔貨運排班之研究。輔仁學誌. 法管理學院之部,17,255-277。  延伸查詢new window
7.Azevedo, J. A.、Costa, M. E. Q. S.、Madeira, J. J. E. R. S.(1993)。An Algorithm for the Ranking of Shortest Path。European Journal of Operational Research,69,97-106。  new window
8.Martins, E. Q. V.(1984)。An Algorithm for Ranking Paths that May Contain Cycles。European Journal of Operational Research,18,123-130。  new window
9.陳春益、蔡蕉蘭(19970600)。國內貨物排程問題之探討。運輸學刊,10(2)=36,79-98。new window  延伸查詢new window
10.Kennington, J. L.(1978)。A survey of linear cost multicommodity network flows。Operations Research,26(2),209-236。  new window
會議論文
1.林正章(1995)。多元貨品流量問題在唯一路徑限制式下的正確演算法。中華民國運輸學會第十屆論文研討會,303-310。  延伸查詢new window
研究報告
1.陳春益、林正章(1996)。路線貨運業載運問題之硏究。國立成功大學交通管理科學研究所。  延伸查詢new window
2.黃承傳、陳武正、汪進財(1993)。台灣地區貨物運輸系統最適運具分配之研究。交通部運輸研究所。  延伸查詢new window
3.Chen, C.、Komhauser, A. L.(1990)。Decomposition of Convex Multicommodity Network Flow Problems。Princeton, NJ:Princeton University。  new window
圖書
1.Maplnfo Corporation(1992)。Maplnfo: User's Guide。  new window
2.Ahuja, R. K.、Magnanti, T. L.、Orlin, J. B.(1993)。Network Flows。New Jersey:Prentice-Hall。  new window
3.Lin, C.(1990)。The Load Planning at UPS。Philadelphia:ORSA-TIMS。  new window
4.Schrage, L.(1991)。LINDO User's Manual。The Scientific Press。  new window
5.Sheffi, Y.(1985)。Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods。Englewood Cliffs, N.J.:Prentice-Hall。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top