Abstract
The Hopfield net is known to produce a high percentage of invalid solutions in solving the TSP [11], [138]. This is attributed to the improper selection of parameters of the Hopfield energy function, Equation (3.22). This chapter examines why the Hopfield net frequently fails to produce valid solutions, and it also provides a remedy and presents comparison studies among different approaches discussed in previous chapters in solving the TSP. The TSP is singled out for comparison because it is a well-known, important, N P-complete problem that has many potential applications and has been benchmarked by many researchers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ansari, N., Hou, E. (1997). The Traveling Salesman Problem. In: Computational Intelligence for Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6331-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6331-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7907-2
Online ISBN: 978-1-4615-6331-0
eBook Packages: Springer Book Archive