:::

詳目顯示

回上一頁
題名:應用迭代區域搜尋法求解混合封閉與開放車輛路線問題
書刊名:運輸學刊
作者:韓復華 引用關係朱佑旌鄧全斌
作者(外文):Han, Anthony F.Chu, Yu-chingTeng, Chuan-pin
出版日期:2016
卷期:28:4
頁次:頁479-506
主題關鍵詞:混合封閉與開放車輛路線問題迭代區域搜尋法巨集啟發式解法隨機變動鄰域尋優法Close-open mixed vehicle routing problemCOMVRPIterated local searchILSMetaheuristicRandomized variable neighborhood descentRVND
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:19
期刊論文
1.Penna, P. H. V.、Subramanian, A.、Ochi, L. S.(2013)。An Iterated Local Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem。Journal of Heuristics,19(2),201-232。  new window
2.Subramanian, A.、Penna, P. H. V.、Uchoa, E.、Ochi, L. S.(2012)。A Hybrid Algorithm for the Heterogeneous Fleet Vehicle Routing Problem。European Journal of Operational Research,221(2),285-295。  new window
3.Potvin, J. Y.、Rousseau, J. M.(1993)。A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows。European Journal of Operational Research,66(3),331-340。  new window
4.Lin, S.、Kernighan, B. W.(1973)。An effective heuristic algorithm for the traveling salesman problem。Operations Research,21(2),498-516。  new window
5.Bräysy, O.、Hasle, G.、Dullaert, W.(2004)。A Multi-start Local Search Algorithm for the Vehicle Routing Problem with Time Windows。European Journal of Operational Research,159(3),586-605。  new window
6.Chu, C. W.(2005)。A Heuristic Algorithm for the Truckload and Less-Than-Truckload Problem。European Journal of Operational Research,165(3),657-667。  new window
7.Cuervo, D. P.、Goos, P.、Sorensen, K.、Arraiz, E.(2014)。An Iterated Local Search Algorithm for the Vehicle Routing Problem with Backhauls。European Journal of Operational Research,237(2),454-464。  new window
8.Han, A. F.、Chu, Y.(2016)。A Multi-Start Heuristic Approach for the Split-Delivery Vehicle Routing Problem with Minimum Delivery Amounts。Transportation Research Part E: Logistics and Transportation Review,88,11-31。  new window
9.Liu, R.、Jiang, Z.(2012)。The Close-Open Mixed Vehicle Routing Problem。European Journal of Operational Research,220(2),349-360。  new window
10.Silva, M. M.、Subramanian, A.、Ochi, L. S.(2015)。An Iterated Local Search Heuristic for the Split Delivery Vehicle Routing Problem。Computers and Operations Research,53,234-249。  new window
11.Subramanian, A.、Drummond, L. M. A.、Bentes, C.、Ochi, L. S.、Farias, R.(2010)。A Parallel Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery。Computers and Operations Research,37(11),1899-1911。  new window
12.Dantzig, George B.、Ramser, J. H.(1959)。The Truck Dispatching Problem。Management Science,6(1),80-91。  new window
會議論文
1.Pichpibul, T.、Kawtummachai, R.(2013)。New Best Solutions for the Close-Open Mixed Vehicle Routing Problem by Using an Improved Harmony Search Algorithm。The Second Asian Conference on Information Systems。  new window
2.Pichpibul, T.、Kawtummachai, R.(2012)。A Modified Savings Heuristic for the Close-Open Mixed Vehicle Routing Problem。The Asia Pacific Industrial Engineering and Management Systems Conference,17-20。  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
圖書論文
1.Cordeau, J. F.、Laporte, G.(2005)。Tabu Search Heuristics for the Vehicle Routing Problem。Metaheuristic Optimization Via Memory and Evolution: Tabu Search and Scatter Search。Boston:Kluwer。  new window
2.Lourenço, H. R.、Martin, O. C.、Stützle, T.(2003)。Iterated Local Search。Handbook of Metaheuristics。United States:Springer。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top