Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks

Hongzong Li; Jiasen Wang; Jun Wang

doi:10.1109/ICIST52614.2021.9440588

Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

7 Citations (Scopus)

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	https://doi.org/10.1109/ICIST52614.2021.9440588
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
Place	China
City	Chengdu
Period	21/05/21 → 23/05/21
Internet address	https://conference.cs.cityu.edu.hk/icist/

Research Keywords

collaborative neurodynamic optimization
discrete Hopfield network
Travelling salesman problem

Access Output

10.1109/ICIST52614.2021.9440588

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Li, H., Wang, J., & Wang, J. (2021). Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks. In 11th International Conference on Information Science and Technology (ICIST) (pp. 456-465). Article 9440588 (International Conference on Information Science and Technology, ICIST). IEEE. https://doi.org/10.1109/ICIST52614.2021.9440588

@inproceedings{f4578a3031fd43ad90fd5e320d29e7a1,

title = "Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks",

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.",

keywords = "collaborative neurodynamic optimization, discrete Hopfield network, Travelling salesman problem",

author = "Hongzong Li and Jiasen Wang and Jun Wang",

year = "2021",

month = may,

doi = "10.1109/ICIST52614.2021.9440588",

language = "English",

isbn = "978-1-6654-2941-2",

series = "International Conference on Information Science and Technology, ICIST",

publisher = "IEEE",

pages = "456--465",

booktitle = "11th International Conference on Information Science and Technology (ICIST)",

address = "United States",

note = "11th International Conference on Information Science and Technology, ICIST 2021 ; Conference date: 21-05-2021 Through 23-05-2021",

url = "https://conference.cs.cityu.edu.hk/icist/",

}

Li, H , Wang, J & Wang, J 2021, Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks. in 11th International Conference on Information Science and Technology (ICIST)., 9440588, International Conference on Information Science and Technology, ICIST, IEEE, pp. 456-465, 11th International Conference on Information Science and Technology, ICIST 2021, Chengdu, China, 21/05/21. https://doi.org/10.1109/ICIST52614.2021.9440588

Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks. / Li, Hongzong ; Wang, Jiasen ; Wang, Jun.
11th International Conference on Information Science and Technology (ICIST). IEEE, 2021. p. 456-465 9440588 (International Conference on Information Science and Technology, ICIST).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks

AU - Li, Hongzong

AU - Wang, Jiasen

AU - Wang, Jun

PY - 2021/5

Y1 - 2021/5

N2 - 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.

AB - 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.

KW - collaborative neurodynamic optimization

KW - discrete Hopfield network

KW - Travelling salesman problem

UR - https://www.scopus.com/pages/publications/85107910315

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85107910315&origin=recordpage

U2 - 10.1109/ICIST52614.2021.9440588

DO - 10.1109/ICIST52614.2021.9440588

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 978-1-6654-2941-2

T3 - International Conference on Information Science and Technology, ICIST

SP - 456

EP - 465

BT - 11th International Conference on Information Science and Technology (ICIST)

PB - IEEE

T2 - 11th International Conference on Information Science and Technology, ICIST 2021

Y2 - 21 May 2021 through 23 May 2021

ER -

Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this