Abstract
This paper addresses the travelling salesman problem (TSP) based on collaborative neurodynamic optimization (CNO). In the CNO approach to TSP, a population of discrete Hopfield networks are employed for searching local optimal solutions and repeatedly reinitialized by using the particle swarm optimization rule towards a global optimal solution. Experimental results for solving four TSP benchmarks are reported to substantiate the efficacy of the CNO approach.
| Original language | English |
|---|---|
| Title of host publication | 11th International Conference on Information Science and Technology (ICIST) |
| Publisher | IEEE |
| Pages | 456-465 |
| ISBN (Electronic) | 978-1-6654-1266-7 |
| ISBN (Print) | 978-1-6654-2941-2 |
| DOIs | |
| Publication status | Published - May 2021 |
| Event | 11th International Conference on Information Science and Technology, ICIST 2021 - Chengdu, China Duration: 21 May 2021 → 23 May 2021 https://conference.cs.cityu.edu.hk/icist/ |
Publication series
| Name | International Conference on Information Science and Technology, ICIST |
|---|---|
| ISSN (Print) | 2164-4357 |
| ISSN (Electronic) | 2573-3311 |
Conference
| Conference | 11th International Conference on Information Science and Technology, ICIST 2021 |
|---|---|
| Country/Territory | China |
| City | Chengdu |
| Period | 21/05/21 → 23/05/21 |
| Internet address |
Research Keywords
- collaborative neurodynamic optimization
- discrete Hopfield network
- Travelling salesman problem