A columnar competitive model for solving multi-traveling salesman problem

DOI10.1016/J.CHAOS.2005.10.059MaRDI QIDQ2482590zbMATH OpenOpenAlexFDO

Authors Hong Qu, Zhang Yi, 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

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

Cites work

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

Cited in

(2)

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

This page was built for publication: A columnar competitive model for solving multi-traveling salesman problem

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