A HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES
Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 4
Abstract
In this paper, we present an intelligent solution system for travelling salesman problem. The solution has three stages. The first stage uses Clustering Analysis in Data Mining to classify all customers by a number of attributes, such as distance, demand level, the density of customer, and city layout. The second stage introduces how to generate feasible routing schemes for each vehicle type. Specifically, a depth-first search algorithm with control rules is presented to generate feasible routing schemes. In the last stage, a genetic programming model is applied to find the best possible solution. Finally, we present a paradigm for using this algorithm for distributed memory architectures to gain the benefits of parallel processing.
Authors and Affiliations
Khushboo Aggarwal , Sunil Kumar Singh , Sakar Khattar
Keywords
Related Articles
- EP ID EP113781
- DOI -
- Views 162
- Downloads 0
PRE-IDEALS AND NEW TOPOLOGIES USING FUZZY SETS
A fuzzy ideal on a set X is a non empty collection of subsets of X with heredity property which is also closed under arbitrary union and finite intersections. In this paper, we introduce a weak form of fuzzy ideals namel...
DETERMINING THE NUMBER OF CLUSTERS FOR A K-MEANS CLUSTERING ALGORTIHM
Clustering is a process used to divide data into a number of groups. All data points have some mathematical parameter according to which grouping can be done. For instance, if we have a number of points on a twodimension...
Discovering Non-Redundant Association Rules using MinMax Approximation Rules
Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redund...
ANALYSING THE ACCEPTANCE CRITERIA AMONG THE CONCEPTS FOR GENERATING AUTOMATED ONTOLOGIES
The semantic search yields fruitful results while searching the concepts. Ontologies play a crucial role in searching the concepts in a semantic way. It is otherwise said that, wherever search is needed, ontology search...
RELATIVE QUERY RESULTS RANKING FOR ONLINE USERS IN WEB DATABASES
To handle with the problem of so many-answers replied from an online Web database in response to a relative query, this paper proposes a unique approach to rank the similar query results. Depending upon the on the databa...