A columnar competitive model for solving multi-traveling salesman problem

DOI10.1016/j.chaos.2005.10.059zbMath1165.90662OpenAlexW2118003984MaRDI QIDQ2482590

Zhang Yi, Hong Qu, Hua Jin Tang

Publication date: 17 April 2008

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2005.10.059

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

A simple model for the multiple traveling salesmen problem with single depot and multiple sink, A new algorithm for finding the shortest paths using PCNNs

Cites Work

• ``Neural computation of decisions in optimization problems
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain
• On problem solving with Hopfield neural networks
• General local search methods
• Competition-based neural network for the multiple travelling salesmen problem with minmax objective
• Relaxed tours and path ejections for the traveling salesman problem
• Global convergence and suppression of spurious states of the Hopfield neural networks
• A neural network model as a globally coupled map and applications based on chaos
• The General Pickup and Delivery Problem
• The m-Traveling Salesman Problem with Minmax Objective
• Computational Experience with an M-Salesman Traveling Salesman Algorithm