:::

詳目顯示

回上一頁
題名:同時考慮以自有車輛收送貨或委託貨運公司服務之啟發式演算法
書刊名:國立臺灣海洋大學海運學報
作者:朱經武劉曄洪秀幸
出版日期:2004
卷期:13
頁次:頁147-162
主題關鍵詞:同時收送貨車輛途程問題啟發式演算法0-1整數規劃運籌VRP with pickup and deliveryHeuristics0-1 integer programmingLogistics
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:0
  • 點閱點閱:16
就運銷管理者而言,如何將貨物由配送中心運送給顧客,是一項很重要的實務問題。在實際生活中,需求具有不確定性,所以當需求量大於業者本身車隊的容量時,業者必須考慮將過剩的需求委託貨運公司運送。 本研究以單一配送中心為研究對象,考慮不同車種與選擇貨運公司服務的情形下之同時收送貨車輛途程問題,主要的研究目的為發展一啟發式演算法,協助運銷管理者解決問通。經測試比較後顯示啟發式演算法之效率與準確度均十分良好。
The delivery of goods from a warehouse to local customers is an important and practical problem of a logistics manger. 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 with pickup and delivery 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.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
2.Taillard, É.D.(1993)。Parallel Iterative Search Methods for Vehicle Routing Problem。Networks,23,661-673。  new window
3.Laporte, G.、Gendreau, M.、Potvin, J-Y.、Semet, F.(2000)。Classical and Modem Heuristics for the Vehicle Routing Problem。International Transactions in Operational Research,7,285-300。  new window
4.Chu, C. W.(2004)。A heuristic algorithm for the truckload and less_than_truckoad problem。European Journal of Operational Research,113,528-543。  new window
5.Gaskell, T. J.(1967)。Basis for Vehicle Fleet Scheduling。Operational Research Quarterly,18,281。  new window
6.Yellow, P.(1970)。A Computational Modification to the Savings Method of Vehicle Scheduling。Operational Research Quarterly,21(2),281-283。  new window
7.Lin, S.(1965)。Computer Solution of the Traveling Salesman Problem。Bell System Technology Journal,44,2245-2269。  new window
8.Osman, I. H.(1993)。Metastrategy Simulated Annealing and Tabu Search Algorithm for the Vehicle Routing problem。Annals of Operations Reseach,41,421-451。  new window
9.Gendreau, M.、Hertz, A.、Laporte, G.(1994)。A Tabu Search Heuristic for the Vehicle Routing Problem。Management Science,40,1276-1290。  new window
10.Xu, J.、Kelly, J. P.(1996)。A Network Flow-based Tabu Search Heuristic for the Vehicle Routing Problem。Transportation Science,30,379-393。  new window
11.Psaraftis, Harilaos N.(1980)。A Dynamic Programming Solution to the Single Vehicle Many-to-many Immediate Request Dial-a-ride Problem。Transportation Science,14(2),130-154。  new window
12.Klincewicz, J. G.、Luss, H.、Pilcher, M. G.(1990)。Fleet Size Planning when Outside Carrier Service Are Available。Transportation Science,24,169-182。  new window
13.Lin, S.、Kernighan, B. W.(1973)。An effective heuristic algorithm for the traveling salesman problem。Operations Research,21(2),498-516。  new window
14.Min, H.(1989)。The multiple vehicle routing problem with simultaneous delivery and pick-up points。Transportation Research Part A: General,23(5),377-386。  new window
15.Salhi, S.、Nagy, G.(1999)。A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling。Journal of the Operational Research Society,50(10),1034-1042。  new window
16.Gillett, B.、Miller, L.(1974)。A Heuristic Algorithm for the Vehicle Dispatch Problem。Operational Research,22,340-349。  new window
17.Ball, M. O.、Golden, A.、Assad, A.、Bodin, L. D.(1983)。Planning for Truck Fleet Size in the Presence of a Common-Carrier Option。Decision Sciences,14(1),103-120。  new window
18.Christofides, N.、Eilon, S.(1969)。An Algorithm for the Vehicle Dispatching Problems。Operational Research Quarterly,20,309-318。  new window
19.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
20.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
會議論文
1.Agarwal, Y. K.(1985)。Vehicle routing with limited fleet and common carrier option。TIMS/ORSA Joint National Meeting。Boston。  new window
圖書論文
1.Kindervater, G. A. P.、Savelsbergh, M. W. P.(1997)。Vehicle routing: handling edge exchanges。Local Search in Combinatorial Optimization。Chichester:Wiley。  new window
2.Rego, C.、Roucairol, C.(1996)。A Parallel Tabu Search Algorithm Using Ejection Chains for Vehicle Routing Problem。Meta-Heuristics: Theory and Applications。Boston:Kluwer。  new window
3.Christofides, N.、Mingozzi, A.、Toth, P.(1979)。The Vehicle Routing Problem。Combinatorial Optimization。Chichester:Wiley。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE