메뉴 건너뛰기




Volumn 3320, Issue , 2004, Pages 202-212

Genetic local search based on genetic recombination: A case for traveling salesman problem

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

EID: 13944270301     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30501-9_46     Document Type: Conference Paper
Times cited : (5)

References (20)
  • 3
    • 84901047034 scopus 로고
    • Genetic algorithms and neighborhood search
    • Evolutionary Computing, Leeds, U.K.
    • C.R.Reeves. Genetic algorithms and neighborhood search, in Evolutionary Computing, AISB Workshop, Pages 115-130. Leeds, U.K. (1994).
    • (1994) AISB Workshop , pp. 115-130
    • Reeves, C.R.1
  • 5
    • 0001193147 scopus 로고    scopus 로고
    • The traveling salesman problem: A case study in local optimization
    • (E. H. L. Aarts and J. K. Lenstra, eds.), Wiley and Sons, New York
    • D. S. Johnson and L. A. McGeoch, The Traveling Salesman Problem: A Case Study in Local Optimization, in Local Search in Combinatorial Optimization, (E. H. L. Aarts and J. K. Lenstra, eds.), Wiley and Sons, New York, (1996).
    • (1996) Local Search in Combinatorial Optimization
    • Johnson, D.S.1    McGeoch, L.A.2
  • 7
    • 21844527073 scopus 로고
    • The traveling salesman: Computational solutions for TSP applications
    • Springer Verlag, Berlin, Germany
    • G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications. Vol. 840 of Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, (1994).
    • (1994) Lecture Notes in Computer Science , vol.840
    • Reinelt, G.1
  • 10
    • 0001693878 scopus 로고
    • The traveling salesman problem: A neural network perspective
    • J.Y. Potvin, The Traveling Salesman Problem: A Neural Network Perspective, ORSA Journal on Computing, vol. 5, pp. 328-348, (1993).
    • (1993) ORSA Journal on Computing , vol.5 , pp. 328-348
    • Potvin, J.Y.1
  • 12
  • 16
    • 0001673286 scopus 로고    scopus 로고
    • Optimization strategies gleaned from biological evolution
    • R. M. Brady, Optimization Strategies Gleaned from Biological Evolution, Nature, vol. 317, pp. 804-806, Operations Research, 28(5):1066-1099, (1985).
    • Nature , vol.317 , pp. 804-806
    • Brady, R.M.1
  • 17
    • 13944265390 scopus 로고
    • R. M. Brady, Optimization Strategies Gleaned from Biological Evolution, Nature, vol. 317, pp. 804-806, Operations Research, 28(5):1066-1099, (1985).
    • (1985) Operations Research , vol.28 , Issue.5 , pp. 1066-1099
  • 18
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol. 220, pp. 671-680,(1983).
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 19
    • 0015604699 scopus 로고
    • An efficient heuristic procedure for the traveling salesman problem
    • S.Lin, and B. Kernighan, An Efficient Heuristic Procedure for the Traveling Salesman Problem. Operations Research., 21:498-516, (1973).
    • (1973) Operations Research , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.