ONES ASSIGNMENT METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM

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.

BASIRZADEH HADI; Sayadi Abbas

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

Seminar Paper

Paper Information

Seminar: IRANIAN CONFERENCE ON APPLIED MATHEMATICS
Year:2013 | Issue:5

Download Full-Text

View:

132

Download:

132

Information Seminar Paper

Title

ONES ASSIGNMENT METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM

Author(s)

BASIRZADEH HADI | Sayadi Abbas | Issue Writer Certificate

Keywords

ASSIGNMENT PROBLEM

LINEAR INTEGER PROGRAMMING

TRAVELING SALESMAN PROBLEM

Abstract

THIS PAPER INTRODUCES A NEW APPROACH FOR SOLVING TRAVELING SALESMAN PROBLEM. THIS METHOD OFFERS SIGNIFICANT ADVANTAGES OVER SIMILAR METHODS, IN THE PROCESS, FIRST WE DEFINE THE DISTANCE MATRIX, THEN BY USING DETERMINANT REPRESENTATION WE OBTAIN A REDUCED MATRIX WHICH HAS AT LEAST ONE 1 IN EACH ROW AND EACH COLUMN. THEN BY USING THE NEW METHOD, WE OBTAIN AN OPTIMAL SOLUTION FOR TRAVELING SALESMAN PROBLEM BY ASSIGNING ONES TO EACH ROW AND EACH COLUMN. THE NEW METHOD IS BASED ON CREATING SOME ONES IN THE DISTANCE MATRIX AND THEN TRY TO FIND A COMPLETE SOLUTION TO THERE ONES.THE PROPOSED METHOD IS A SYSTEMATIC PROCEDURE, EASY TO APPLY AND CAN BE UTILIZED FOR ALL TYPES OF TRAVELING SALESMAN PROBLEM WITH MAXIMIZE OR MINIMIZE OBJECTIVE FUNCTIONS.AT THE END, THIS METHOD IS ILLUSTRATED WITH SOME NUMERICAL EXAMPLES.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

BASIRZADEH, HADI, & Sayadi, Abbas. (2013). ONES ASSIGNMENT METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM. IRANIAN CONFERENCE ON APPLIED MATHEMATICS. SID. https://sid.ir/paper/929894/en

Vancouver: Copy

BASIRZADEH HADI, Sayadi Abbas. ONES ASSIGNMENT METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM. 2013. Available from: https://sid.ir/paper/929894/en

IEEE: Copy

HADI BASIRZADEH, and Abbas Sayadi, “ONES ASSIGNMENT METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM,” presented at the IRANIAN CONFERENCE ON APPLIED MATHEMATICS. 2013, [Online]. Available: https://sid.ir/paper/929894/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops