:::

詳目顯示

回上一頁
題名:以螞蟻群聚最佳化整合基因演算法求解無資源限制單一指派中位轉接點問題
書刊名:運輸學刊
作者:蘇純繒翁瑞聰
作者(外文):Su, Chwen-tzengWong, Jui-tsung
出版日期:2004
卷期:16:2
頁次:頁99-114
主題關鍵詞:螞蟻群聚最佳化基因演算法資料挖掘中位轉接點問題P-hub median problemData miningAnt colony optimizationGenetic algorithm
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(2) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:2
  • 共同引用共同引用:0
  • 點閱點閱:69
期刊論文
1.O'Kelly, Morton E.(1992)。Hub Facility Location with Fixed Costs。Papers in Regional Science,71(3),293-306。  new window
2.Maniezzo, V.、Colorni, A.(1999)。The Ant System Applied to the Quadratic Assignment Problem。IEEE Transactions on Knowledge and Data Engineering,11(5),769-778。  new window
3.O'Kelly, Morton E.(1987)。A Quadratic Integer Program for the Location of Interacting Hub Facilities。European Journal of Operational Research,32(3),393-404。  new window
4.Dorigo, M.、Bonabeau, E.、Theraulaz, G.(2000)。Ant Algorithms and Stigmergy。Future Generation Computer Systems,16(8),851-871。  new window
5.Dorigo, M.、Gambardella, L. M.(1997)。Ant Colonies for the Traveling Salesman Problem。BioSystems,43(2),73-81。  new window
6.Dorigo, M.、Di Caro, G.、Gambardella, L. M.(1999)。Ant Algorithms for Discrete Optimization。Artificial Life,5(2),137-172。  new window
7.Aykin, T.(1994)。Lagrangian Relaxation Based Approaches to Capacitated Hub-and-spoke Network Design Problem。European Journal of Operational Research,79,501-523。  new window
8.Skorin-Kapov, Darko、Skorin-Kapov, Jadranka、O'Kelly, Morton(1996)。Tight Linear Programming Relaxations of Uncapacitated p-hub Median Problems。European Journal of Operational Research,94(3),582-593。  new window
9.Skorin-Kapov, Darko、Skorin-Kapov, Jadranka、Skorin-Kapov, D.、Skorin-Kapov, J.(1994)。On Tabu Search for the Location of Interacting Hub Facilities。European Journal of Operational Research,73,502-509。  new window
10.Abdinnour-Helm, S.(1998)。A Hybrid Heuristic for the Uncapacitated Hub Location Problem。European Journal of Operational Research,106,489-499。  new window
11.Andreas, T. E.、Mohan, K.(1996)。Efficient Algorithms for the Uncapacitated Single Allocation p-hub Median Problem。Location Science,4(3),139-154。  new window
12.Dorigo, M.、Maniezzo, V.(1996)。The Ant System: Optimization by a Colony of Cooperation Agents。IEEE Trans. Systems Man Cybernet, B,26(1),29-41。  new window
13.Ebery, J. M.、Ernst, A. K.、Boland, N.(2000)。The Capacitated Multiple Allocation Hub Location Problem: Formulations and Algorithms。European Journal of Operational Research,120,614-631。  new window
14.Klincewicz, J. G.、Klincewicz, J.(1991)。Heuristics for the p-Hub Location Problem。European Journal of Operational Research,53,25-37。  new window
15.Klincewicz, J. G.(1992)。Avoiding local optima in the p-Hub location problem, using tabu search and GRASP。Annals of Operations Research,40,283-302。  new window
16.Melquiades, P.(1998)。Genetic Algorithm with Multistart Search for the p-Hub Median Problem。IEEE Proceedings,24(2),702-707。  new window
會議論文
1.Agrawal, R.、Imielinski, T.、Swami, A. N.(1993)。Mining Association Rules between Sets of Items in Large Databases。The 1993 ACM SIGMOD International Conference on Management of Data,207-216。  new window
研究報告
1.Dorigo, M.、Maniezzo, V.(1991)。A Colorni, Positive Feedback as a Search Strategy。Italy。  new window
2.Maniezzo, V.(1998)。Exact and Approximate Nondeterministic Tree-search Procedures for the Quadratic Assignment Problem。Italy。  new window
3.Stutzle, T.(1997)。Ant Approach to the Flow Shop Problem。沒有紀錄。  new window
學位論文
1.張斐茹(2000)。軸輻路網在國際定期貨櫃船航線之應用,0。  延伸查詢new window
2.藍坤銘(2002)。應用資料挖掘之順序樣式法於螞蟻理論之改善,沒有紀錄。  延伸查詢new window
圖書
1.Bullnheimer, B. H.、Strauss, C.(1999)。An Ant Colony Optimization Approach for the Single Machine Total Tardiness Problem, in: Press。An Ant Colony Optimization Approach for the Single Machine Total Tardiness Problem, in: Press。Piscataway, NJ。  new window
2.Stutzle, T.、Hoos, H.(1997)。The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem。The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem。New York, NY。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE