A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-18, 18 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-06-20
Country of Publication
Egypt
No. of Pages
18
Main Subjects
Abstract EN
A simple lexisearch algorithm that uses path representation method for the asymmetric traveling salesman problem (ATSP) is proposed, along with an illustrative example, to obtain exact optimal solution to the problem.
Then a data-guided lexisearch algorithm is presented.
First, the cost matrix of the problem is transposed depending on the variance of rows and columns, and then the simple lexisearch algorithm is applied.
It is shown that this minor preprocessing of the data before the simple lexisearch algorithm is applied improves the computational time substantially.
The efficiency of our algorithms to the problem against two existing algorithms has been examined for some TSPLIB and random instances of various sizes.
The results show remarkably better performance of our algorithms, especially our data-guided algorithm.
American Psychological Association (APA)
Ahmed, Zakir Hussain. 2011. A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem. Mathematical Problems in Engineering،Vol. 2011, no. 2011, pp.1-18.
https://search.emarefa.net/detail/BIM-495830
Modern Language Association (MLA)
Ahmed, Zakir Hussain. A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem. Mathematical Problems in Engineering No. 2011 (2011), pp.1-18.
https://search.emarefa.net/detail/BIM-495830
American Medical Association (AMA)
Ahmed, Zakir Hussain. A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem. Mathematical Problems in Engineering. 2011. Vol. 2011, no. 2011, pp.1-18.
https://search.emarefa.net/detail/BIM-495830
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-495830