A NEW ALGORITHM FOR LARGE-SCALE TRAVELING SALESMAN PROBLEMS

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.

REZAZADEH H.A.; SHEYKHAN N.

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

Journal Paper

Paper Information

Journal: JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TABRIZ) Year:2003 | Volume:29 | Issue:1 (31 ELECTRICAL ENGINEERING) Page(s): 87-93

Download Full-Text

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

Persian Verion

View:

2,169

Download:

Cites:

Information Journal Paper

Title

A NEW ALGORITHM FOR LARGE-SCALE TRAVELING SALESMAN PROBLEMS

Author(s)

REZAZADEH H.A. | SHEYKHAN N. | Issue Writer Certificate

Keywords

TRAVELING SALESMAN PROBLEMQ2

HEURISTIC ALGORITHMQ2

Abstract

The classic traveling - salesman problem is to determine a tour that will minimize the total distance or cost involved in visiting several cities and returning to the starting point. This paper describes a new algorithm for accelerating the computational performances of branch exchange heuristics for symmetric TRAVELING SALESMAN PROBLEM. The improvement in performance is obtained by considering only exchanges that have a good chance of producing a better solution. This algorithm is faster than other heuristics' algorithms and computation times increase much less rapidly with problem size. The new algorithm makes it possible to solve large-scale TRAVELING SALESMAN PROBLEMs.

Cites

No record.

References

No record.

Cite

APA: Copy

REZAZADEH, H.A., & SHEYKHAN, N.. (2003). A NEW ALGORITHM FOR LARGE-SCALE TRAVELING SALESMAN PROBLEMS. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TABRIZ), 29(1 (31 ELECTRICAL ENGINEERING)), 87-93. SID. https://sid.ir/paper/43776/en

Vancouver: Copy

REZAZADEH H.A., SHEYKHAN N.. A NEW ALGORITHM FOR LARGE-SCALE TRAVELING SALESMAN PROBLEMS. JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TABRIZ)[Internet]. 2003;29(1 (31 ELECTRICAL ENGINEERING)):87-93. Available from: https://sid.ir/paper/43776/en

IEEE: Copy

H.A. REZAZADEH, and N. SHEYKHAN, “A NEW ALGORITHM FOR LARGE-SCALE TRAVELING SALESMAN PROBLEMS,” JOURNAL OF FACULTY OF ENGINEERING (UNIVERSITY OF TABRIZ), vol. 29, no. 1 (31 ELECTRICAL ENGINEERING), pp. 87–93, 2003, [Online]. Available: https://sid.ir/paper/43776/en

Related Journal Papers