A neural network algorithm for the multiple traveling salesman problem
From MaRDI portal
Publication:1822984
DOI10.1007/BF00204755zbMath0679.68108MaRDI QIDQ1822984
Publication date: 1989
Published in: Biological Cybernetics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Numerical methods in optimal control (49M99)
Related Items
A deterministic annealing algorithm for approximating a solution of the min-bisection problem ⋮ Metaheuristics: A bibliography ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ A deterministic annealing algorithm for the minimum concave cost network flow problem ⋮ Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem ⋮ Stochastic methods for neural systems ⋮ Neural network methods in combinatorial optimization ⋮ A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem ⋮ An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets
