:::

詳目顯示

回上一頁
題名:以禁忌搜尋演算法求解確定型及隨機型多車種車輛途程問題
書刊名:工業工程學刊
作者:吳泰熙 引用關係黃金智楊懿淑
作者(外文):Wu, Tai-hsiHuang, Chin-chihYang, Yi-shu
出版日期:2001
卷期:18:2
頁次:頁102-112
主題關鍵詞:車輛途程問題隨機型車輛途程問題禁忌搜尋演算法Vehicle routing problemFleet mix problemTabu search
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:1
  • 共同引用共同引用:10
  • 點閱點閱:16
期刊論文
1.Jaikumar, R.、Fisher, M. L.(1981)。A generalized assignment heuristic for vehicle routing。Networks,11(2),109-124。  new window
2.Gillett, B. E.、Miller, L. R.(1974)。A heuristic algorithm for the vehicle-dispatch problem。Operations Research,22(2),340-349。  new window
3.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
4.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。  new window
5.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
6.韓復華、楊智凱、卓裕仁(19970600)。應用門檻接受法求解車輛路線問題之研究。運輸計劃,26(2),253-280。new window  延伸查詢new window
7.Christofides, N.、Eilon, S.(1969)。An Algorithm for the Vehicle Dispatching Problem。Operation Research Quarterly,20(3),309-318。  new window
8.Lin, S.(1965)。Computer solutions of the traveling salesman problem。Bell System Technology Journal,44,2245-2269。  new window
9.Bodin, L.、Golden, B. L.(1981)。Classification in Vehicle Routing and Scheduling。Networks,11,97-108。  new window
10.Bartholdi, J. J.、Platzman, L. K.(1988)。Heuristics based on spacefilling curves for combinatorial problems in Euclidean space。Management Science,34,291-305。  new window
11.Brandao, J.、Mercer, A.(1997)。A tabu search algorithm for the multi-trip vehicle routing and scheduling problem。European Journal of Operational Research,100,180-191。  new window
12.Duhamel, C.、Potvin, J.-Y.、Rousseau, J.-M.(1997)。A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows。Transportation Science,31(1),49-59。  new window
13.Dror, M.、Trudeau, P.(1986)。Stochastic vehicle routing with modified savings algorithm。European Journal of Operational Research,23,228-235。  new window
14.Etezadi, T.、Beasley, J. E.(1983)。Vehicle fleet composition。Journal of the Operational Research Society,34,87-91。  new window
15.Gendreau, M.、Laporte, G.、Seguin, R.(1996)。A tabu search heuristic for the vehicle routing problem with stochastic demands and customers。Operations Research,44,469-477。  new window
16.Gendreau, M.、Laporte, G.、Seguin, R.(1995)。An exact algorithm for the vehicle routing problem with stochastic demands and customers。Transportation Science,29,143-155。  new window
17.Gendreau, M.、Laporte, G.、Seguin, R.(1996)。Stochastic vehicle routing。European Journal of Operational Research,88,3-12。  new window
18.Golden, B.、Assad, A.、Levy, L.、Gheysens, F.(1984)。The fleet size and mix vehicle routing problem。Computers & Operations Research,11(1),49-66。  new window
19.Haughton, M. A.(1998)。The performance of route modification and demand stabilization strategies in stochastic vehicle routing。Transportation Research, Part B: Methodological,32,551-566。  new window
20.Laporte, G.、Louveaux, F.、Mercure, H.(1992)。The vehicle routing problem with stochastic travel times。Transportation Science,26,161-170。  new window
21.Renaud, J.、Laporte, G.、Boctor, F. F.(1996)。A tabu search heuristic for the multi-depot vehicle routing problem。Computers & Operations Research,23(3),229-235。  new window
22.Stewart, W. R., Jr.、Golden, B. L.(1983)。Stochastic vehicle routing: a comprehensive approach。European Journal of Operational Research,14,371-385。  new window
學位論文
1.Or, I.(1976)。Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking(博士論文)。Northwestern University,Evanston, IL。  new window
2.林明俊(1998)。隨機環境下多車種派車問題之研究,0。  延伸查詢new window
3.張祖明(1993)。多車種車輛路線問題啟發式解法之研究,0。  延伸查詢new window
圖書
1.Neivergelt, J.、Deo, N.、Reingold, E. M.(1977)。Combinatorial Algorithms: Theory and Practice。Combinatorial Algorithms: Theory and Practice。New Jersey:Prentice-Hall。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top