臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：以基因演算法與樣板路徑求解旅行推銷員問題
書刊名：運輸計劃
作者：曾國雄／王日昌／黃明居 引用關係
作者(外文)：Tzeng, Gwo-hshiung／Wang, Jih-chang／Hwang, Ming-jiu
出版日期：1996
卷期：25:3
頁次：頁493-516
主題關鍵詞：旅行推銷員問題；基因演算法；樣板路徑；交配運算子；Traveling salesman problem；Genetic algorithm；Template path；Crossover
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(3) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:3
  • 共同引用共同引用:0
  • 點閱點閱:17
期刊論文
1.Little, John D. C.、Murty, Katta G.、Sweeney, Dura W.、Karel, Caroline(1963)。An Algorithm for the Traveling Salesman Problem。Operations Research，11(6)，972-989。  new window
2.Dueck, G.、Scheuer, T.(1990)。Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing。Journal of Computational Physics，90(1)，161-175。  new window
3.Lin, S.、Kernighan, B. W.(1973)。An effective heuristic algorithm for the traveling salesman problem。Operations Research，21(2)，498-516。  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.Hopfield, J. J.、Tank, D. W.(1985)。"Neural" computation of decisions in optimization problems。Biological cybernetics，52(3)，141-152。  new window
6.Lin, C. K. Y.、Haley, K. B.、Sparks, C.(1995)。A Comparative Study of Both Standard and Adaptive Versions of Threshold Accepting and Simulated Annealing Algorithms in Three Scheduling Problems。European Journal of Operational Research，83(2)，330-346。  new window
7.Bellman, B. E.(1963)。Dynamic Programming Treatment of the Traveling Salesman Problem。Journal of the Association for Computing Machinery，9。  new window
8.Bellmore, M.、Malone, J. C.(1971)。Pathology of Traveling Salesman Subtour-Elimination Algorithms。Operations Research，19，278-307。  new window
9.Christofides, N.、Eilton, S.(1972)。Algorithms for Large scale Travelling Salesman Problems。Operational Research Quarterly，23，511-518。  new window
10.Crowder, H.、Padberg, M. W.(1980)。Solving Large-scale Symmetric Travelling Salesman Problems to Optimality。Management Science，26(5)，495-509。  new window
11.Cowling, P.、Maffioli, F.(1995)。A Bound for the Symmetric Traveling Salesman Problem Through Matroid Formulation。European Journal of Operational Researches，83(2)，301-309。  new window
12.Dantzig, G. B.、Fulkerson, D. R.、Johnson, S. M.(1954)。Solution of a Large-scale Traveling- salesman Problem。Operations Research，2，393-410。  new window
13.Gendreau, M.、Hertz, A.、Laporte, G.(1992)。New Insertion and Post-Optimization Procedures for the Traveling Salesman Problem。Operations Research，40(6)，1086-1094。  new window
14.Glover, F.(1977)。Heuristic for Integer Programming Using Surrogate Constraints。Decision Sciences，8，156-166。  new window
15.Glover, F.(1990)。TABU Search, Part II。ORSA Journal on Computing，2(1)，4-32。  new window
16.Held, M.、Karp, R. M.(1970)。The Traveling Salesman Problem and Minimum Spanning Trees。Operations Research，18(6)，1138-1162。  new window
17.Johnson, D. S.(1987)。More Approaches to the Travelling Salesman Guide。Nature，330，525。  new window
18.Knox, J.(1994)。TABU Search Performance on the Symmetric Traveling Salesman Problem。Computers and Operations Research，21(8)，867-874。  new window
19.Laporte, G.(1992)。The Vehicle Routing Problem: An Overview of Exact and Approximate。European Journal of Operational Research，59，345-358。  new window
20.Lin, S.(1965)。Computer Solution of the Traveling Salesman Problem。Bell System Computer Journal，44，2245-2269。  new window
21.Miliotis, P.(1978)。Using Cutting Planes to Solve the Symmetric Salesman Problem。Mathematical Programming，10，367-378。  new window
22.Miller, D. L.、Pekny, J. E.(1989)。Results From a Parallel Branch and Bound Algorithm for Solving Large Asymmetric Traveling Salesman Problems。Operations Research Letters，8，129-135。  new window
23.Miller, D. L.、Pekny, J. E.(1991)。Exact Solution of Large Asymmetric Traveling Salesman Problems。Science，251，754-761。  new window
24.Muhlenheine, M.、George-Schleuter、Kramer, O.(1988)。Evolution Algorithms in Combinatorial Optimization。Parallel Computing，7，65-85。  new window
25.Norback, J.、Love, R.(1977)。Geometric Approaches to Solving the Traveling Salesman Problem。Management Science，23，1208-1223。  new window
26.Padberg, M. W.、Hong, S.(1980)。On the Symmetric Traveling Salesman Problem: A Computational Study。Mathematical Programming Study，12，78-107。  new window
27.Padberg, M. W.、Rinaldi, G.(1987)。Optimization of a 532-city Symmetric Traveling Salesman Problem by Branch and Cut。Operations Research Letters，6，1-7。  new window
28.Padberg, M. W.、Rinaldi, G.(1990)。Facet Identification for the Symmetric Traveling Salesman Problem。Mathematical Programming，47，219-257。  new window
29.Reinelt, G.(1992)。TSPLIB -- A Traveling Salesman Problem Library。ORSA Journal on Computing，3(4)，376-384。  new window
30.Rosenkrantz, D. J.、Steams, R. E.、Lewis, P. M. II(1977)。An Analysis of Several Heuristics for the Traveling Salesman Problem。SIAM Journal on Computing，6(3)，563-581。  new window
31.Glover, F.(1989)。Tabu Search。ORSA Journal on Computing，1，190-206。  new window
32.Kirkpatrick, Scott、Gelatt, C. D. Jr.、Vecchi, M. P.(1983)。Optimization by simulated annealing。Science，220(4598)，671-680。  new window
會議論文
1.Goldberg, David E.、Lingle, Robert Jr.(1985)。Alleles, Loci and the Traveling Salesman Problem。The First International Conference on Genetic Algorithms and Their Applications。Pittsburgh, PA：Lawrence Erlbaum Associates。154-159。  new window
2.韓復華、楊智凱(1995)。以門檻接受法改善路網成本之研究。中華民國運輸學會第十屆研討會，335-342。  延伸查詢new window
3.Gorges-Schleuter, M.。ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy。The Third International Conference for Genetic Algorithms。Morgan Kaufmann Publishers, Inc.。422-427。  new window
4.Grefenstette, J. J.、Gopal, R.、Rosmaita, B. J.、Gucht, D. V.(1985)。Genetic Algorithms for the Traveling Salesman Problem。Lawrence Erlbaum Associates。160-168。  new window
5.Homaifar, A.、Guan, S.、Liepin, G. E.(1993)。A New Approach on the Traveling Salesman Problem by Genetic Algorithms。The Fifth International Conference on Genetic Algorithms。Lawrence Erlbaum Associates。  new window
6.Jog, P.、Suh, J. Y.、Van Gucht, D.(1989)。The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem。The Third International Conference for Genetic Algorithms。Morgan Kaufmann Publishers, Inc.。110-115。  new window
7.Johnson, D. S.(1990)。Local Optimization and the Travelling Salesman Problem。The 17th International Collquium on Automata, Languages and Programming。Berlin：Springer-Verlag。446-461。  new window
8.Muhlenheine, H.(1989)。Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization。The Third International Conference for Genetic Algorithms。Morgan Kaufmann Publishers, Inc.。416-421。  new window
9.Oliver, L. M.、Smith, D. J.、Holland, J. R. C.(1987)。A Study of Permutation Crossover Operators on the Traveling Salesman Problem。The Second International Conference on Genetic Algorithms。Lawrence Erlbaum Associate。224-230。  new window
10.Whitely, D.、Starkweather, T.、Fuquay, D.(1989)。Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator。The Third International Conference for Genetic Algorithms。Morgan Kaufmann Publishers, Inc.。133-140。  new window
研究報告
1.Glover, F.(1988)。TABU Search。Center for Applied Artificial Intelligence (CAAI), Graduate School of Business, University of Colorado。  new window
2.Lidd, M. L.(1991)。Traveling Salesman Problem Domain Application of a Fundamentally New Approach to Utilizing Genetic Algorithm。  new window
學位論文
1.李育欣(19900600)。完全性路網TSP 問題啟發式解法之研究--兼論類神經網路解法之應用(碩士論文)。國立交通大學。  延伸查詢new window
2.Knox, J.(1989)。The Application of Tabu Search to the Symmetric Traveling Salesman Problem(博士論文)。University of Colorado，Boulder。  new window
3.Lam, J.(1989)。The Application of TABU Search to the Symmetric Traveling Salesman(博士論文)。University of Colorado。  new window
4.Or, I.(1976)。Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Regional Blod Banking(博士論文)。Northwestern University，Evanston, IL。  new window
5.Shapiro, D. M.(1966)。Algorithms for the Solution of the Optimal Cost and Bottleneck Traveling Salesman Problems(博士論文)。Washington University，St. Louis, MO。  new window
圖書
1.Goldberg, D. E.(1989)。Genetic Algorithms in Search Optimization & Machine Learning。Addision-Wesley。  new window
2.Lawler, E. L.、Lenstra, J. K.、Rinnooy Kan, A. H. G.、Shmoys, D. B.(1985)。The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization。Chichester：Wiley。  new window
3.Michalewicz, W.(1992)。Genetic Algorithms+ Data Structures = Evolution Programs。Berlin：Springer。  new window
4.Reinelt, G.(1994)。The Traveling Salesman。New York：Springer Verlag。  new window
5.Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。  new window
圖書論文
1.Golden, B. L.、Stewart, W. R.(1985)。Empirical analysis of heuristics。The Traveling Salesman Problem。New York：John Wiley and Sons Ltd.。  new window
2.Grefenstette, J. J.(1987)。Incorporating Problem Specific Knowledge into Genetic Algorithms。Genetic Algorithms and Simulated Annealing。Morgan Kaufmann Publisher, Inc.。  new window
3.Karp, R.(1992)。Complexity of Computer Computations。Reducibility Among Combinatorial Problem。New York：Plenum Press。  new window
4.Liepins, G. E.、Hilliard, M. R.、Richardson, J.、Palmer, M.(1990)。Genetic Algorithms Applications to Set Covering and Traveling Salesman Problems。Operations Research and Artificial Intelligence: The Integration of Problem Solving Strategies。Kluwer Academic Press。  new window
5.Maekawa, K.、Tamaki, H.(1995)。A Method for the Traveling Salesman Problem Based on the Genetic Algorithms。Transactions of the Society of Instrument and Control Engineers。  new window
6.Padberg, M. W.、Grotschel, M.(1985)。Polyhedral Computations。The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization。Chichester：Wiley。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：1609（臺灣：1603，外國：6） ／ 本年度總使用人次：2042760 ／ 訪客人次（自102年09月）：67843675
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上