Travelling Salesman Problem with a grouping Constraint – A Lexi-Search Approach

Main Article Content

Dr. K.Sobhan Babu
Dr. Keshava Reddi.E, Prof.Sundara Murthy.M

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

Download data is not yet available.

Article Details

Section
Articles