메뉴 건너뛰기




Volumn 28, Issue 4, 1998, Pages 618-620

Efficient convex-elastic net algorithm to solve the euclidean traveling salesman problem

Author keywords

Neural network; Optimization problems; Traveling salesman problem (TSP)

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ITERATIVE METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING;

EID: 0032142024     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.704301     Document Type: Article
Times cited : (31)

References (10)
  • 1
    • 0027540270 scopus 로고
    • A hybrid neural network model for solving optimization problems
    • Feb.
    • K. T. Sun and H. C. Fu, "A hybrid neural network model for solving optimization problems," IEEE Trans. Comput., vol. 42, pp. 218-227, Feb. 1993.
    • (1993) IEEE Trans. Comput. , vol.42 , pp. 218-227
    • Sun, K.T.1    Fu, H.C.2
  • 2
    • 0026880159 scopus 로고
    • The traveling salesman problem: An overview of exact and approximate algorithms
    • G. Laporte, "The traveling salesman problem: An overview of exact and approximate algorithms," Eur. J. Oper. Res., vol. 59, pp. 231-247, 1992.
    • (1992) Eur. J. Oper. Res. , vol.59 , pp. 231-247
    • Laporte, G.1
  • 4
    • 0028338155 scopus 로고
    • An introduction to simulated evolutionary optimization
    • Jan.
    • D. B. Fogel, "An introduction to simulated evolutionary optimization," IEEE Trans. Neural Networks, vol. 5, pp. 3-14, Jan. 1994.
    • (1994) IEEE Trans. Neural Networks , vol.5 , pp. 3-14
    • Fogel, D.B.1
  • 5
    • 0023657610 scopus 로고
    • An analogue approach to the traveling salesman problem using an elastic net method
    • Apr. 16
    • R. Durbin and D. Willshaw, "An analogue approach to the traveling salesman problem using an elastic net method," Nature, vol. 326, pp. 689-691, Apr. 16, 1987.
    • (1987) Nature , vol.326 , pp. 689-691
    • Durbin, R.1    Willshaw, D.2
  • 6
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the traveling salesman problem
    • S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, pp. 498-516, 1973.
    • (1973) Oper. Res. , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.2
  • 7
    • 0015055178 scopus 로고
    • A man-machine approach toward solving traveling salesman problem
    • May
    • P. Krolak and W. Felts, "A man-machine approach toward solving traveling salesman problem," Commun. ACM, vol. 14, pp. 327-334, May 1971.
    • (1971) Commun. ACM , vol.14 , pp. 327-334
    • Krolak, P.1    Felts, W.2
  • 8
    • 0026853637 scopus 로고
    • The guilty net for the traveling salesman problem
    • L. Burke and P. Damany, "The guilty net for the traveling salesman problem," Comput. Oper. Res., vol. 19, no. 3/4, pp. 255-265, 1992.
    • (1992) Comput. Oper. Res. , vol.19 , Issue.3-4 , pp. 255-265
    • Burke, L.1    Damany, P.2
  • 9
    • 0021819411 scopus 로고
    • Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
    • Jan.
    • J. Cerny, "Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm," J. Optim. Theory Appl., vol. 45, pp. 41-51, Jan. 1985.
    • (1985) J. Optim. Theory Appl. , vol.45 , pp. 41-51
    • Cerny, J.1
  • 10
    • 0026220441 scopus 로고
    • Solution of large-scale symmetric traveling salesman problems
    • M. Grotschel, "Solution of large-scale symmetric traveling salesman problems," Math. Progr., vol. 51, pp. 141-201, 1991.
    • (1991) Math. Progr. , vol.51 , pp. 141-201
    • Grotschel, M.1


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