The distance-based critical node detection in the symmetric travelling salesman problem and its application to improve the approximate solutions

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.

Abdolhosseinzadeh Mohsen; Alipour Mir Mohammad

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS Year:2023 | Volume:14 | Issue:8 Page(s): 291-296

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

The distance-based critical node detection in the symmetric travelling salesman problem and its application to improve the approximate solutions

Author(s)

Abdolhosseinzadeh Mohsen | Alipour Mir Mohammad | Issue Writer Certificate

Keywords

Critical node

Travelling salesman problem

Approximation Algorithm

2-opt algorithm

Approximate Solution

Abstract

The Travelling salesman problem is one of the well-known NP-hard problems, and there are various versions of the problem with respect to its different specifications of the constraints and assumptions. Especially, the symmetric Travelling salesman problem has been considered in numerous routing models. The Critical node detection problem has received increasing attention throughout the routing models. The Critical node has the most important role in the routing problems, and if it is out of service then the optimal solution will be hit by a large undesirable cost. The Critical node is defined as the node whose deletion from the network results in the largest decrease in the optimal cost. It is proved the Critical node of the network is the Critical node for the optimal tour, too. Thus, the Critical node is considered to obtain a good Approximate Solution in a reasonable iteration. The 2-opt heuristic is applied by the Critical node in the symmetric traveling salesman problem and the iterations are reduced significantly. Then, the pseudo-Critical node is defined and detected in the Approximate Solution, whose removal results in the largest decrease of the approximate cost. So, the 2-opt heuristic is applied by the pseudo-Critical node and the optimal or a nearby optimal solution is obtained.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans