Improving the Hopfield model performance when applied to the traveling salesman problem
- 285 Downloads
The continuous Hopfield network (CHN) can be used to solve, among other combinatorial optimization problems, the traveling salesman problem (TSP). In order to improve the performance of this heuristic technique, a divide-and-conquer strategy based on two phases is proposed. The first phase involves linking cities with the most neighbors to define a set of chains of cities and, secondly, to join these with isolated cities to define the final tour. Both problems are solved by mapping the two TSPs onto their respective CHNs. The associated parameter-setting procedures are deduced; these procedures ensure the feasibility of the obtained tours, and the quality of the solutions is compared with the pure CHN approach using some traveling salesman problem library (TSPLIB) instances. By means of this strategy, solving TSP instances with sizes of up to 13,509 cities are allowed with the computational resources we had available. Finally, the new divide-and-conquer procedure is improved by tuning the parameter which controls the first phase.
KeywordsArtificial neural networks Hopfield network Traveling salesman problem Divide-and-conquer
We thank the two anonymous referees for their interesting suggestions. This research has been partially supported by the Government of Spain, Grant TIN2012-32482, and by the local Government of Madrid, Grant S2013/ICE-2845 (CASI-CAM).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflicts of interest.
- Lawler EL (1985) The traveling salesman problem: a guided tour of combinatorial optimization. In: Wiley-Interscience series in discrete mathematics. Wiley, New YorkGoogle Scholar
- Reinelt G (1994) The traveling salesman: computational solutions for TSP applications. Springer, New YorkGoogle Scholar
- Suh T, Esat II (1998) Solving large scale combinatorial optimisation problems based on a divide and conquer strategy. Neural Comput Appl 7(2):166–179Google Scholar
- Tang H, Tan KC, Zhang Y (2007) Neural networks: computational models and applications. Studies in Computational Intelligence, vol 53, Springer, Berlin, HeidelbergGoogle Scholar
- Woeginger GJ (2003) Exact algorithms for NP-hard problems: a survey. In: Combinatorial Optimization Eureka, You Shrink!. Springer, New York, pp 185–207Google Scholar