Solving TSP by using Lotka-Volterra neural networks

@article{Li2009SolvingTB,
  title={Solving TSP by using Lotka-Volterra neural networks},
  author={Manli Li and Zhang Yi and Min Zhu},
  journal={Neurocomputing},
  year={2009},
  volume={72},
  pages={3873-3880}
}
This paper proposes a new approach to solve traveling salesman problem (TSP) by using a class of Lotka–Volterra neural networks (LVNN) with global inhibition. Some stability criteria that ensure the convergence of valid solutions are obtained. It is proved that an equilibrium state is stable if and only if it corresponds to a valid solution of the TSP. Thus, a valid solution can always be obtained whenever the derived. Simulation results illustrate the theoretical analysis. & 2009 Elsevier B.V… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Improving local minima of columnar competitive model for TSPs

IEEE Transactions on Circuits and Systems I: Regular Papers • 2006
View 1 Excerpt

On parameter settings of Hopfield networks applied to traveling salesman problems

IEEE Transactions on Circuits and Systems I: Regular Papers • 2005
View 2 Excerpts

Convergence Analysis of Recurrent Neural Networks

Network Theory and Applications • 2004
View 5 Excerpts

Dynamic stability conditions for Lotka-Volterra recurrent neural networks with delays.

Physical review. E, Statistical, nonlinear, and soft matter physics • 2002
View 1 Excerpt

Similar Papers

Loading similar papers…