A neural network algorithm for the multiple traveling salesman problem

DOI10.1007/BF00204755zbMATH Open0679.68108MaRDI QIDQ1822984FDOQ1822984

Authors: Yanyan Li 

Publication date: 1989

Published in: Biological Cybernetics (Search for Journal in Brave)

Recommendations

• An efficient multivalued Hopfield network for the traveling salesman problem
• Publication:4893554
• scientific article; zbMATH DE number 807575
• ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net
• scientific article; zbMATH DE number 1110519

zbMATH Keywords

optimizationdynamic modelsneural networkHopfield network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Numerical methods in optimal control (49M99)

Cited In (12)

• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• An improved Hopfield Lagrange network with application on motor efficiency optimization
• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• Neural network methods in combinatorial optimization
• Title not available (Why is that?)
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
• A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem
• A deterministic annealing algorithm for the minimum concave cost network flow problem
• Stochastic methods for neural systems
• ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net
• Metaheuristics: A bibliography

This page was built for publication: A neural network algorithm for the multiple traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822984)