InternationaleJournals

A Lexisearch Approach to the Travelling Salesman Problem
 

1Ch.N. Anuradha, 2V.V.Haragopal and 3Shahnaz bathul

1Department of Mathematics, Vasavi College of Engg., Hyderabad, Telangana, India. E-mail: chnanuradha@yahoo.com
2Department of Statistics and Center For Quantitative Methods, Osmania University, Hyderabad, Telangana, India. E-mail:
haragopal_vajjha@yahoo.com
3Department of Mathematics, JNTU, Hyderabad, Telangana, India. E-mail: sbathul@gmail.com

Abstract: In this paper we introduce a simple Lexi-search Algorithm for a Travelling Salesman problem. The Lexi-search derives its name from lexicography.This approach has been used to solve various combinatorial problems efficiently. This algorithm is deterministic and is always guaranteed to find an optimal solution.

Keywords:  Introduction, Combinatorial problem,Lexi-search Algorithm to  travelling Salesman problem,conclusion.

 

 

 

 

 

 

 

International eJournal of Mathematics and Engineering
Volume
7, Issue
2, Pages:  42 - 50