:::

詳目顯示

回上一頁
題名:選擇以自有車輛運送或委託貨運公司服務之啟發式演算法
書刊名:航運季刊
作者:朱經武鄭超元洪秀幸
作者(外文):Chu, Ching-wuCheng, Chao-yuanHung, Chsiu-hsing
出版日期:2005
卷期:14:1
頁次:頁87-100
主題關鍵詞:車輛途程問題啟發式演算法0-1整數規畫運籌Vehicle routingHeuristics0-1 integer programmingLogistics
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:19
運銷管理者所面臨的決策問題很多,如何選擇一合適的運輸方式或業者運送貨物對運銷管理而言,是一很重要的決策,因為運輸成本在運銷各項成本中所佔之比例最高。 基本上有兩種運輸方式可供業者選擇,一種是以自有車隊運送,另者是委託貨運公司運送。以自有車隊運送,運銷管理者需要決定的是合併那些運送在同一車和規劃運送路線。委託貨運公司運送,貨運公司負責規劃每次從運送地至目的地的路線,運銷管理者只需將貨物交與給他們即可。市場上常見的新竹貨運、與大榮貨運屬於後者。 本研究以單一配送中心為研究對象,考慮不同車種與選擇貨運公司服務的情形下之車輛途程問題,主要的研究目的為發展一啟發式演算法,協助運銷管理者解決問題。經測試比較後顯示啟發式演算法之效率與準確度均十分良好。
The delivery of goods from a warehouse to local customers is an important and practical problem of a logistics manager. In reality, we are facing the fluctuation of demand. When the total demand is greater than the whole capacity of owned trucks, the logistics managers may consider using an outsider carrier. In this paper, we address the problem of routing a fixed number of trucks with limited capacity from a central warehouse to customers with known demand. The objective of this paper is developing a heuristic algorithm to route the private trucks and to make a selection of less-than-truckload carriers by minimizing a total cost function. Both the mathematical model and the heuristic algorithm are developed. Finally, some computational results and suggestions for future research are presented.
期刊論文
1.Ball, M. O.、Golden, A.、Assad, A.、Bodin, L. D.(1985)。Planning for truck fleet size in the presence of a common-carrier option。Decision Sciences,14,103-120。  new window
2.Toth, P.、Vigo, D.(1999)。A Heuristic Algorithm for the Symmetric and Asymmetric Vehicle Routing Problems with Backhauls。European Journal of Operational Research,113(3),528-543。  new window
3.Taillard, É.D.(1993)。Parallel Iterative Search Methods for Vehicle Routing Problem。Networks,23,661-673。  new window
4.Yellow, P.(1970)。A Computational Modification to the Savings Method of Vehicle Scheduling。Operational Research Quarterly,21(2),281-283。  new window
5.Gillett, B. E.、Miller, L. R.(1974)。A heuristic algorithm for the vehicle-dispatch problem。Operations Research,22(2),340-349。  new window
6.Gendreau, M.、Hertz, A.、Laporte, G.(1994)。A Tabu Search Heuristic for the Vehicle Routing Problem。Management Science,40,1276-1290。  new window
7.Lin, S.、Kernighan, B. W.(1973)。An effective heuristic algorithm for the traveling salesman problem。Operations Research,21(2),498-516。  new window
8.Osman, I. H.(1993)。Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem。Annals of Operations Research,41(4),421-451。  new window
9.Christofides, N.、Eilon, S.(1969)。An Algorithm for the Vehicle Dispatching Problems。Operational Research Quarterly,20,309-318。  new window
10.Rochat, Yves、Taillard, Éric D.(1995)。Probabilistic Diversification and Intensification in Local Search for Vehicle Routing。Journal of Heuristics,1(1),147-167。  new window
11.Clarke, G. U.、Wright, J. W.(1964)。Scheduling of Vehicles from a Central Depot to a Number of Delivery Points。Operations Research,12(4),568-581。  new window
12.Laporte, G.、Gendreau, M.、Potvin, J. Y.、Semet, F.(2000)。Classical and modern heuristics for the vehicle routing problem。International Transactions in Operational Research,7(4/5),285-300。  new window
會議論文
1.Agarwal, Y. K.(1985)。Vehicle routing with limited fleet and common carrier option。TIMS/ORSA Joint National Meeting。Boston。  new window
其他
1.Gaskell, T.J.(1967)。Basis for Vehicle Fleet Scheduling。  new window
2.Lin, S.,(1965)。Computer Solution of the Traveling Salesman Problem。  new window
3.Xu, J., and Kelly, J.P.(1996)。A Network Flow-based Tabu Search Heuristic for the Vehicle Routing Problem。  new window
4.Rego, C., Roucairol, C.(1996)。A Parallel Tabu Search Algorithm Using Ejection Chains for Vehicle Routing Problem,Boston:Kluwer。  new window
5.Klincewicz, J.G., Luss, H, and Pilcher, M.G.(1990)。Fleet Size Planning whenOutside Carrier Service Are Available。  new window
6.Kindervater, G.A.P., and Savelsbergh, M.W.P.(1997.)。Vehicle routing: handling edge exchanges,Chichester:Wiley。  new window
圖書論文
1.Christofides, N.、Mingozzi, A.、Toth, P.(1979)。The Vehicle Routing Problem。Combinatorial Optimization。Chichester:Wiley。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE