@inbook{8b2b5436a7ad48a3a1928f3e607cdfc9,
title = "Columnar Competitive Model for Solving Multi-Traveling Salesman Problem",
abstract = "This chapter studies an optimization problem: Multi-Traveling Salesman Problem (MTSP), which is an extension of the well known TSP. A columnar competitive model (CCM) of neural networks incorporating a winner-take-all learning rule is employed to solve the MTSP. Stability conditions of CCM for MTSP are exploited by mathematical analysis. Parameter settings of the network for guaranteeing the network converges to valid solutions are discussed in detail. Simulations are carried out to illustrate the performance of the columnar competitive model compared to heuristic algorithms such as the Tabu Search.",
author = "Huajin Tang and Tan, {Kay Chen} and Zhang Yi",
year = "2007",
doi = "10.1007/978-3-540-69226-3_10",
language = "English",
isbn = "978-3-540-69225-6",
series = "Studies in Computational Intelligence",
publisher = "Springer Berlin Heidelberg",
pages = "145--160",
booktitle = "Neural Networks",
}