Travelling Salesman Problem with a grouping Constraint – A Lexi-Search Approach
Main Article Content
Abstract
There are many algorithms for usual one man TSP developed by researchers from time to time. But the problem has not received
much attention in its required context. In this paper we study a problem called TSP with Variant Constraint. Lexi-Search is by far the mostly
used tool for solving large scale NP-hard Combinatorial Optimization problems. Lexi-Search is, however, an algorithm paradigm, which has to
be filled out for each specific problem type, and numerous choices for each of the components exist. Even then, principles for the design of
efficient Lexi-Search algorithms have emerged over the years. 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 problem and find better solution.
Keywords: Travelling Salesman Problem, Tour, Lexi-Search, Word, Pattern
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.