:::

詳目顯示

回上一頁
題名:調適型螞蟻演算法應用於旅行推銷員問題之研究
書刊名:運輸學刊
作者:李泰琳張靖 引用關係卓裕仁 引用關係
作者(外文):Li, Tai-linChang, ChingCho, Yuh-jen
出版日期:2007
卷期:19:1
頁次:頁89-120
主題關鍵詞:螞蟻演算法旅行推銷員問題螞蟻演算法參數控制Ant colony optimizationTraveling salesman problemACO parameters control
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(1) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:15
期刊論文
1.Bullnheimer, B.、Hartl, R. F.、Strauss, C.(1999)。A new rank based version of the ant system-a computational study。Central European Journal of Operations Research,7(1),25-38。  new window
2.Le Louam, F. X.、Gendreau, M.、Potvin, J. Y.(2004)。GENI Ants for the Traveling Salesman Problem。Annals of Operations Research,131,187-201。  new window
3.Watkins, C. J. C. H.、Dayan, P.(1992)。Technical Note: Q-Learning。Machine Learning,8(3),279-292。  new window
4.Zhang, W.、Bai, Y.(2005)。A Hybrid Elastic Net Method for Solving the Traveling Salesman Problem。International Journal of Software Engineering and Knowledge Engineering,15(2),447-453。  new window
5.Walshaw, C.(2002)。A Multilevel Approach to the Traveling Salesman Problem。Operations Research Part C,50(5),862-877。  new window
6.Reinelt, G.(1994)。The Traveling Salesman: Computational Solutions for TSP Applications。Lecture Notes in Computer Science,840,1-223。  new window
7.Qi, D.、Sun, R.(2005)。Learning to Cooperate in Solving the Traveling Salesman Problem。International Journal of Neural Systems,15(1/2),151-162。  new window
8.Mendivil, F.、Shonkwiler, R.、Spruill, M. C.(2005)。Analysis of Random Restart and Iterated Improvement for Global Optimization with Application to the Traveling Salesman Problem。Annals of Operations Research,124(2),407-433。  new window
9.Lin, S.(1965)。Computer Solutions for the Traveling Salesman Problem。Bell Systems Technology Journal,44,2245-2269。  new window
10.Laporte, G.(1992)。The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms。European Journal of Operational Research,59(2),231-247。  new window
11.DePuy, G. W.、Moraga, R. J.、Whltehouse, G. E.(2005)。Meta-RaPS: A Simple and Effective Approach for Solving the Traveling Salesman Problem。Transportation Research Part E,41(22),115-130。  new window
12.Bentley, J. L.(1992)。Fast Algorithms for Geometric Traveling Salesman Problems。ORSA Journal on Computing,4(4),387-411。  new window
13.Bektas, T.(2006)。The Multiple Traveling Salesman Problem: An Overview of Formulations and Solution Procedures。OMEGA: The International Journal of Management Science,34(3),209-419。  new window
14.張靖、卓裕仁、藍宜祥(20051200)。改良型巢狀分割法應用於旅行推銷員問題之研究。運輸計劃,34(4),549-573。new window  延伸查詢new window
15.Dorigo, Marco、Gambardella, Luca Maria(1997)。Ant Colony System: A cooperative learning approach to the traveling salesman problem。IEEE Transactions on Evolutionary Computation,1(1),53-66。  new window
16.Dorigo, M.、Gambardella, L. M.(1997)。Ant Colonies for the Traveling Salesman Problem。BioSystems,43(2),73-81。  new window
17.Dorigo, M.、Maniezzo, V.、Colorni, A.(1996)。Ant System: Optimization by a colony of cooperating agents。IEEE Transactions on Systems, Man, and Cybernetics--Part B,26(1),29-41。  new window
會議論文
1.Gambardella, L. M.、Dorigo, M.(1996)。Solving Symmetric and Asymmetric TSPs by Ant Colonies。The IEEE International Conference on Evolutionary Computation,622-627。  new window
2.Stiitzle, T.、Hoos, H. H.(1997)。The MAX-MIN Ant System and Local Search for the Travelling Salesman Problem。The IEEE International Conference on Evolutionary Computation,309-314。  new window
3.Gambardella, L. M.、Dorigo, M.(1995)。Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem。The Eleventh Intemational Conference on Machine Learning。Tahoe City, CA:Morgan Kaufmann。252-260。  new window
4.Colorni, A.、Dorigo, M.、Maniezzo, V.(1991)。Distributed Optimization by Ant Colonies。The First European Conference on Artificial Life。Paris:Elsevier。134-142。  new window
研究報告
1.Dorigo, M.、Maniezzo, V.、Colorni, A.(1991)。Positive Feedback as a Search Strategy。Milano:Dipartimento di Elettronica e Informatica, Politecnico di Milano。  new window
2.Dorigo, M.、Maniezzo, V.、Colorni, A.(1991)。The Ant System: An Autocatalytic Optimizing Process。Italy:Dipartimento di Elettronica e Informatica, Politecnico di Milano。  new window
學位論文
1.Stützle, T.(1998)。Local Search Algorithms for Combinatorial Problems--Analysis, Improvements and New Applications(博士論文)。Darmstadt University of Technology,Darmstadt, Germany。  new window
2.Dorigo, M.(1992)。Optimization, Learning and Natural Algorithms(博士論文)。Politecnico di Milano,Italian。  new window
圖書
1.Stützle, T.、Dorigo, M(1999)。ACO Algorithms for the Traveling Salesman Problem。Belgium:Universit Libre de Bruxelles。  new window
圖書論文
1.Dorigo, M.、DI Caro, G.(1999)。The Ant Colony Optimization Meta-Heuristic。New Ideas in Optimization。New York:McGraw-Hill。  new window
2.Stiitzle, T.、Hoos, H. H.(1999)。MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems。Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization。  new window
3.韓復華、卓裕仁(2001)。第八章:網路節點服務TSP與VRP問題回顧。運輸網路分析。臺北:五南圖書處版公司。  延伸查詢new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE