A NOVEL COMBINATORIAL CONSTRUCTIVE NEURAL NETWORK FOR THE TRAVELING SALESMAN PROBLEM AND SHORTEST PATH PROBLEM WITH SPECIFIED CITY NUMBER

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAADATMAND TARZJAN M.; AKBARZADEH M.R.; KHADEMI M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Year:2005 | Volume:39 | Issue:4 (92) Page(s): 469-487

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,478

Download:

Cites:

Information Journal Paper

Title

A NOVEL COMBINATORIAL CONSTRUCTIVE NEURAL NETWORK FOR THE TRAVELING SALESMAN PROBLEM AND SHORTEST PATH PROBLEM WITH SPECIFIED CITY NUMBER

Author(s)

SAADATMAND TARZJAN M. | AKBARZADEH M.R. | KHADEMI M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper a novel constructive neural network is introduced for solving the classic traveling salesman problem (CNN-TSP). The proposed neural network is inspired by the idea of the Kohonen SOFM and the Hopfield NN. The Kohonen SOFM introduces suitable TSP solutions for its competitive training algorithm though it slowly converges. Contrarily, the Hopfield NN quickly converges for its recursive structure while its solutions are poor. The proposed CNN combines the recursive structure (inspired from the Hopfield NN) with the competitive training algorithm (inspired from the Kohonen SOFM) to give both suitable performance and quickly convergence. The experimental results show that the CNN convergence speed is faster than the Kohonen SOFM by 20 times while its performance (with respect to the best-to-date solutions) is better than Kohonen by 3.81% for 29 benchmark TSP problems from TSPLIB. Also, the proposed NN appears better performance than other conventional approaches such as simulated annealing and Budinichs SOM. CNN can be used to solve other optimization NP-complete problems for its flexibility; i.e. in this paper, it is used to solve shortest path problem with specified city number (SPSN) as well as TSP.

Cites

No record.

References

No record.

Cite

APA: Copy

SAADATMAND TARZJAN, M., AKBARZADEH, M.R., & KHADEMI, M.. (2005). A NOVEL COMBINATORIAL CONSTRUCTIVE NEURAL NETWORK FOR THE TRAVELING SALESMAN PROBLEM AND SHORTEST PATH PROBLEM WITH SPECIFIED CITY NUMBER. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), 39(4 (92)), 469-487. SID. https://sid.ir/paper/14045/en

Vancouver: Copy

SAADATMAND TARZJAN M., AKBARZADEH M.R., KHADEMI M.. A NOVEL COMBINATORIAL CONSTRUCTIVE NEURAL NETWORK FOR THE TRAVELING SALESMAN PROBLEM AND SHORTEST PATH PROBLEM WITH SPECIFIED CITY NUMBER. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN)[Internet]. 2005;39(4 (92)):469-487. Available from: https://sid.ir/paper/14045/en

IEEE: Copy

M. SAADATMAND TARZJAN, M.R. AKBARZADEH, and M. KHADEMI, “A NOVEL COMBINATORIAL CONSTRUCTIVE NEURAL NETWORK FOR THE TRAVELING SALESMAN PROBLEM AND SHORTEST PATH PROBLEM WITH SPECIFIED CITY NUMBER,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TEHRAN), vol. 39, no. 4 (92), pp. 469–487, 2005, [Online]. Available: https://sid.ir/paper/14045/en

Related Journal Papers