A PATTERN RECOGNITION LEXI SEARCH APPROACH TO TRAVELLING SALESMAN PROBLEM WITH ADDITIONAL CONSTRAINTS

Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 2

Abstract

There are n cities and N = {1, 2,… n}. Let {1} be the headquarter city and the subheadquarter cities i.e.,H = {a1, a2… ah} be the subset of N. The cost array C (i, j) indicates the cost of the travelling salesman by visiting the jth city from ith city. Suppose the salesman wants to visiting the m (m<n) (| M | = m & M⊂N, M = {1} U N1 U {h} U N2) cities with the condition that the person starts his trip schedule from a headquarter city (say1) visiting N1 cities before reaching any one of the sub-headquarter city (say h, h Є H) and he will come back to the home city by visiting N2 cities m=N1+N2+2. The objective of the problem is that the total cost of the trip schedule of the salesman under the considerations should be least/minimum. The model can be expressed as a zero-one programming problem. For this problem a computer program is developed for the algorithm and is tested. It is observed that it takes less time for solving higher dimension problems also.

Authors and Affiliations

Dr. K. CHENDRA SEKHAR , Dr. U. BALAKRISHNA , Dr. E. PURUSHOTHAM , C. SURESH BABU , Dr. M. SUNDARA MURTHY

Keywords

Related Articles

A novel method of dynamic permanent caching with resourceful built up and imperative access

Caching is built up each time when the machine starts up according to user’s application usability. This built up rocedure escalates the efficiency of application’s usage for the next coming access of same application....

Multimodal Authentication For High End Security

In earlier days Traditional authentication method in computer systems are based on knowledge and token based. Unfortunately lot of drawbacks are in these systems. Passwords often be forgotten, disclosed or changed. A rel...

Architectural Based Data Aggregation Techniques in Wireless Sensor Network: A Comparative Study

Data aggregation is very crucial techniques in wireless sensor network. Because with the help of data aggregation we reduce the energy consumption by eliminating redundancy .when wireless sensor network deployed in remot...

Implementation and simulation of arithmetic logic unit, shifter and Multiplier in Quantum cellular automata technology

Quantum cellular automata (QCA) is a new technology in the nanometer scale and has been considered as one of the alternative to CMOS technology. QCA have a large potential in the development of circuits with high space d...

Performance Evaluation of Ad Hoc On Demand Distance Vector in MANETs with varying Network Size using NS-2 Simulation

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically forming a network topology without the use of any existing network infrastructure or centralized administration. Routing is the task of...

Download PDF file
  • EP ID EP119509
  • DOI -
  • Views 101
  • Downloads 0

How To Cite

Dr. K. CHENDRA SEKHAR, Dr. U. BALAKRISHNA, Dr. E. PURUSHOTHAM, C. SURESH BABU, Dr. M. SUNDARA MURTHY (2012). A PATTERN RECOGNITION LEXI SEARCH APPROACH TO TRAVELLING SALESMAN PROBLEM WITH ADDITIONAL CONSTRAINTS. International Journal on Computer Science and Engineering, 4(2), 307-320. https://europub.co.uk/articles/-A-119509