Neurodynamic programming: a case study of the traveling salesman problem-Reference-Cited by-同舟云学术

Neurodynamic programming: a case study of the traveling salesman problem

Published:2007-05-31 Issue:4 Volume:17 Page:347-355
ISSN:0941-0643
Container-title:Neural Computing and Applications
language:en
Short-container-title:Neural Comput & Applic

Author:

Ma Jia,Yang Tao,Hou Zeng-Guang,Tan Min,Liu Derong

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Software

Link

http://link.springer.com/content/pdf/10.1007/s00521-007-0127-5.pdf

Reference37 articles.

1. 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–1284

2. Bentley J (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4(4):387–411

3. 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–615

4. Burke LI, Damany P (1992) The guilty net for the traveling salesman problem. Comput Oper Res 19(3–4):255–265

5. Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Tech Rep 388. Carnegie-Melon University, Pittsburgh

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reinforcement learning for the traveling salesman problem: Performance comparison of three algorithms;The Journal of Engineering;2023-09

2. A Novel Discrete Group Teaching Optimization Algorithm for TSP Path Planning with Unmanned Surface Vehicles;Journal of Marine Science and Engineering;2022-09-15

3. Tuning of reinforcement learning parameters applied to SOP using the Scott–Knott method;Soft Computing;2019-07-06

4. PSO-based improved multi-flocks migrating birds optimization (IMFMBO) algorithm for solution of discrete problems;Soft Computing;2018-04-18

5. The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem;Neural Computing and Applications;2012-01-06