International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Review of Travelling Salesmen Problem through Lexisearch Method

Author Affiliations

  • 1Department of Mathematics, Osmania University, Hyderabad, Telangana, INDIA

Res. J. Mathematical & Statistical Sci., Volume 3, Issue (11), Pages 1-5, November,12 (2015)

Abstract

The study is to present Lexisearch method does not require colossal element memory amid execution. A numerical writing computer program is worried with discovering ideal arrangements as opposed to acquiring great arrangements. The Lexisearch gets its name from etymology .This methodology has been utilized to take care of different combinatorial issues productively, The Assignment issue, The Traveling Salesman Problem, The occupation booking issue and so forth. In every one of these issues the lexicographic pursuit was observed to good productive than Branch bound calculations.

References

  1. Adaptive Ant Colony Optimization for the TravelingSalesman Problem, Michael Maur (2009)
  2. An Ant Colony Optimization Algorithm for the StableRoommates Problem Glen Upton, (2002)
  3. Bhavani and Sundara Murthy M., Truncated MTravellingSalesmen Problem, OPSEARCH, 43, 2(2006)
  4. Comparative Analysis of Genetic Algorithm and AntColony Algorithm on Solving Traveling SalesmanProblem, Kangshun Li, Lanlan Kang, Wensheng Zhang,Bing Li (2007)
  5. Frieze A.M. and Yadegar J., An Algorithm for Solving 3-Dimensional Assignment Problems with Application toScheduling a Teaching Practice, (1981)
  6. GhoseShila: The Maximum Capacity Routes: A LexiSearch Approach, Op. Res.8, 209-255 (1971)
  7. J.K. Sharma, Operations Research-Theory andapplications -MacMillan India Ltd.,
  8. Johnson D.S., McGeoch and L.A., The travelingsalesman problem: a case study in localoptimization, (1995)
  9. Kanthi Swarup and P.K. Guptha, Man Mohan-“Operations Research”- Sulthan Chand and Sons 13thEdition,
  10. Lin S. and Kernighan B.W., An effective heuristicalgorithm for the traveling-salesman problem, Operationsresearch, 21(2), 498-516 (1973)
  11. M. Ramesh, A lexisearch approach to some combinatorialprogramming problems, University of Hyderabad, India,(1997)
  12. P. Rama, Murthy-“Operations Research linearprogramming”-e books,
  13. Pandit S.N.N., Some Combinatorial Search Problems, PhD thesis, IIT Kharagpur, India (Unpublished)(1963)
  14. Russel S. and Norvig P., Artificial Intelligence: a ModernApproach, Prentice Hall, (1998)
  15. Shapiro J. F., Convergent duality for the travelingsalesman problem. Operations research center, 1-14(1989)