A Lexi-Search Approach for Variant Mutiple Travelling Salesmen Problem
Main Article Content
Abstract
The multiple travelling salesmen problem (mTSP) is a generalization of the well-known travelling salesman problem (TSP), where
more than one salesman is allowed to be used in the solution. More over, the characteristics of the mTSP seem more appropriate for real-life
applications, and it is also possible to extend the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additional
side constraints. Although there exists a wide body of the literature for the TSP and the VRP, the mTSP has not received the same amount of
attention. In this paper we develop an efficient Lexi-Search method for solving the multiple travelling salesmen problem. Although Lexi-Search
methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. The
motivation of the calculation of the lower bounds is based on ideas frequently used in solving problems. Computationally, the algorithm
extended the size of the problem and find better solution
Â
Keywords: Multiple Travelling Salesmen Problem, Lexi-Search, Pattern Recognition, Tour, Alphabet Table, Search Table.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.