Author:
Motohashi Shun,Matsuura Takafumi,Ikeguchi Tohru,Aihara Kazuyuki
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21, 498–516 (1973)
2. Glover, F.: Tabu search–part I. ORSA J. Computing 1, 190–206 (1989)
3. Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
4. Holland, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The University of Michigan Press (1975)
5. Hasegawa, M., Ikeguchi, T., Aihara, K.: Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Physical Review Letters 79, 2344–2347 (1997)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solving the Steiner Tree Problem in Graphs with Chaotic Neural Networks;Transactions of the Institute of Systems, Control and Information Engineers;2023-05-15
2. Memetic Strategies for Network Design Problems;Springer Tracts in Nature-Inspired Computing;2021-08-07
3. Solving the Steiner tree problem in graphs by chaotic search;Nonlinear Theory and Its Applications, IEICE;2020
4. The double-assignment method for the exponential chaotic tabu search in quadratic assignment problems;Nonlinear Theory and Its Applications, IEICE;2011
5. Theory and Applications of Chaotic Optimization Methods;Innovative Computing Methods and Their Applications to Engineering Problems;2011