{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T02:50:32Z","timestamp":1761706232239},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T00:00:00Z","timestamp":1180569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00521-007-0127-5","type":"journal-article","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T05:20:01Z","timestamp":1180502401000},"page":"347-355","source":"Crossref","is-referenced-by-count":6,"title":["Neurodynamic programming: a case study of the traveling salesman problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Jia","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeng-Guang","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,5,31]]},"reference":[{"issue":"9","key":"127_CR1","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/S0893-6080(99)00063-5","volume":"12","author":"N Aras","year":"1999","unstructured":"Aras N, Oommen BJ, Altinel IK (1999) The kohonen network incorporating explicit statistics and its application to the traveling salesman problem. Neural Netw 12(9):1273\u20131284","journal-title":"Neural Netw"},{"issue":"4","key":"127_CR2","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J Bentley","year":"1992","unstructured":"Bentley J (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4(4):387\u2013411","journal-title":"ORSA J Comput"},{"key":"127_CR3","doi-asserted-by":"crossref","unstructured":"Bersini H, Dorigo M, Langerman S, Seront G, Gambardella L (1996) Results of the first international contest on evolutionary optimization (1st iceo). In: Evolutionary computation. Proceedings of IEEE international conference on. Springer-Verlag, Nagoya, pp 611\u2013615","DOI":"10.1109\/ICEC.1996.542670"},{"issue":"3\u20134","key":"127_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0305-0548(92)90047-9","volume":"19","author":"LI Burke","year":"1992","unstructured":"Burke LI, Damany P (1992) The guilty net for the traveling salesman problem. Comput Oper Res 19(3\u20134):255\u2013265","journal-title":"Comput Oper Res"},{"key":"127_CR5","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Tech Rep 388. Carnegie-Melon University, Pittsburgh"},{"issue":"4","key":"127_CR6","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1057\/jors.1972.79","volume":"23","author":"N Christofides","year":"1972","unstructured":"Christofides N, Eilon S (1972) Algorithms for large-scale traveling salesman problems. Oper Res Quart 23(4):511\u2013518","journal-title":"Oper Res Quart"},{"issue":"4","key":"127_CR7","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"key":"127_CR8","first-page":"1017","volume":"8","author":"R Crites","year":"1996","unstructured":"Crites R, Barto A (1996) Improving elevator performance using reinforcement learning. Adv Neural Inf Process Syst 8:1017\u20131023","journal-title":"Adv Neural Inf Process Syst"},{"issue":"6","key":"127_CR9","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"issue":"1","key":"127_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella L (1997) Ant colony system: a cooperative learning approach to the travelingsalesman problem. Evolut Comput IEEE Trans 1(1):53\u201366","journal-title":"Evolut Comput IEEE Trans"},{"issue":"6114","key":"127_CR11","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R Durbin","year":"1987","unstructured":"Durbin R, Willshaw D (1987) An analogue approach to the traveling salesman problem using an elastic net method. Nature 326(6114):689\u2013691","journal-title":"Nature"},{"issue":"3","key":"127_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"CN Fiechter","year":"1994","unstructured":"Fiechter CN (1994) A parallel tabu search algorithm for large traveling salesman problems. Discrete Appl Math 51(3):243\u2013267","journal-title":"Discrete Appl Math"},{"key":"127_CR13","doi-asserted-by":"crossref","unstructured":"Freisleben B, Merz P (1996) A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: International conference on evolutionary computation, pp 616\u2013621","DOI":"10.1109\/ICEC.1996.542671"},{"key":"127_CR14","doi-asserted-by":"crossref","unstructured":"Gambardella LM, Dorigo M (1995) Ant-q: a reinforcement learning approach to the traveling salesman problem. In: International conference on machine learning, pp 252\u2013260","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"issue":"6","key":"127_CR15","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau M, Hertz A, Laporte G (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40(6):1086\u20131094","journal-title":"Oper Res"},{"key":"127_CR16","first-page":"207","volume-title":"The traveling salesman problem. A guided tour of combinatorial optimization","author":"BL Golden","year":"1985","unstructured":"Golden BL, Stewart WR et\u00a0al (1985) Empirical analysis of heuristics. In: Lawler EL, Lenstra JK, Kan AHGR, Shmoys DB (eds) The traveling salesman problem. A guided tour of combinatorial optimization. Wiley, Chichester, pp 207\u2013249"},{"key":"127_CR17","volume-title":"Neural networks: a comprehensive foundation","author":"S Haykin","year":"1998","unstructured":"Haykin S (1998) Neural networks: a comprehensive foundation. Prentice Hall, PTR Upper Saddle River"},{"key":"127_CR18","unstructured":"Homaifar A, Guan S, Liepins GE (1993) A new approach on the traveling salesman problem by genetic algorithms. In: Proceedings of the 5th international conference on genetic algorithms. Morgan Kaufmann Publishers Inc., San Francisco, pp 460\u2013466"},{"issue":"3","key":"127_CR19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52(3):141\u2013152","journal-title":"Biol Cybern"},{"issue":"2","key":"127_CR20","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1142\/S1465876301000350","volume":"2","author":"G Jayalakshmi","year":"2001","unstructured":"Jayalakshmi G, Sathiamoorthy S, Rajaram R (2001) An hybrid genetic algorithm\u2014a new approach to solve traveling salesman problem. Int J Comput Eng Sci 2(2):339\u2013355","journal-title":"Int J Comput Eng Sci"},{"key":"127_CR21","doi-asserted-by":"crossref","unstructured":"Johnson DS (1990) Local optimization and the traveling salesman problem. In: Goos G, Hartmanis J (eds) ICALP \u201990: proceedings of the 17th international colloquium on automata, languages and programming. Springer-Verlag, London, pp 446\u2013461","DOI":"10.1007\/BFb0032050"},{"key":"127_CR22","first-page":"215","volume-title":"Local search in combinatorial optimization.","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The travelling salesman: a case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, New York, pp 215\u2013310"},{"key":"127_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling LP, Littman ML, Moore AP (1996) Reinforcement learning: a survey. J Artif Intell Res 4:237\u2013285","journal-title":"J Artif Intell Res"},{"issue":"5","key":"127_CR24","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","volume":"28","author":"P Kanellakis","year":"1980","unstructured":"Kanellakis P, Papadimitriou C (1980) Local Search for the asymmetric traveling salesman problem. Oper Res 28(5):1086\u20131099","journal-title":"Oper Res"},{"key":"127_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: theory and applications","author":"P Laarhoven","year":"1987","unstructured":"Laarhoven P, Aarts E (1987) Simulated annealing: theory and applications. Kluwer, Norwell"},{"issue":"10","key":"127_CR26","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44(10):2245\u20132269","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"127_CR27","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) an effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498-516","journal-title":"Oper Res"},{"key":"127_CR28","unstructured":"Miagkikh VV, Punch WF (1999) An approach to solving combinatorial optimization problems using a population of reinforcement learning agents. In: Banzhaf W, Daida J, Eiben AE, Garzon MH, Honavar V, Jakiela M, Smith RE (eds) Proceedings of the genetic and evolutionary computation conference, vol 2. Morgan Kaufmann, Orlando, pp 1358\u20131365"},{"issue":"1","key":"127_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M Padberg","year":"1990","unstructured":"Padberg M, Rinaldi G (1990) Facet identification for the symmetric traveling salesman polytope. Math Programm 47(1):219\u2013257","journal-title":"Math Programm"},{"key":"127_CR30","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1287\/ijoc.5.4.328","volume":"5","author":"J Potvin","year":"1993","unstructured":"Potvin J (1993) The traveling salesman problem: a neural network perspective. ORSA J Comput 5:328\u2013348","journal-title":"ORSA J Comput"},{"issue":"4","key":"127_CR31","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"127_CR32","unstructured":"Singh S, Bertsekas D (1997) Reinforcement learning for dynamic channel allocation in cellular telephone systems. In: Mozer MC, Jordan MI, Petsche T (eds) Advances in neural information processing systems, vol 9. The MIT Press, Cambridge, pp 974\u2013980"},{"issue":"1","key":"127_CR33","first-page":"9","volume":"3","author":"R Sutton","year":"1988","unstructured":"Sutton R (1988) Learning to predict by the methods of temporal differences. Mach Learn 3(1):9\u201344","journal-title":"Mach Learn"},{"key":"127_CR34","volume-title":"Reinforcement learning: an introduction","author":"R Sutton","year":"1998","unstructured":"Sutton R, Barto A (1998) Reinforcement learning: an introduction. MIT Press, Cambridge"},{"issue":"3","key":"127_CR35","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/203330.203343","volume":"38","author":"G Tesauro","year":"1995","unstructured":"Tesauro G (1995) Temporal difference learning and TD-Gammon. Commun ACM 38(3):58\u201368","journal-title":"Commun ACM"},{"issue":"3","key":"127_CR36","first-page":"279","volume":"8","author":"C Watkins","year":"1992","unstructured":"Watkins C, Dayan P (1992) Technical note: Q-Learning. Mach Learn 8(3):279\u2013292","journal-title":"Mach Learn"},{"issue":"1021","key":"127_CR37","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1098\/rstb.1979.0056","volume":"287","author":"D Willshaw","year":"1979","unstructured":"Willshaw D, von der Malsburg C (1979) A marker induction mechanism for the establishment of ordered neural mappings: its application to the retinotectal problem. Philos Trans R Soc Lond B Biol Sci 287(1021):203\u2013243","journal-title":"Philos Trans R Soc Lond B Biol Sci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-007-0127-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-007-0127-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-007-0127-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T16:32:02Z","timestamp":1707928322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-007-0127-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,31]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["127"],"URL":"https:\/\/doi.org\/10.1007\/s00521-007-0127-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,31]]}}}