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 176
- Downloads 0
SURVEY ON HEURISTICS BASED RESOURCE SCHEDULING IN GRID COMPUTING
The most important goal of the Resource Scheduling in Grid Computing is to efficiently map the jobs to resources. Resource Scheduling in Grid computing is a complex task because of the heterogeneous environment. Grid Sch...
Green Cloud: Smart Resource Allocation and Optimization using Simulated Annealing Technique
Cloud computing aims to offer utility based IT services by interconnecting large number of computers through a real-time communication network such as the Internet. There has been a significant increase in the power cons...
APPLICABILITY OF CLOUD COMPUTING IN ACADEMIA
The Indian Education sector has seen a tremendous rise in the field of higher education which has led to the demand for the automation of education sector at all the levels in order to cater to the need of information of...
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
The genetic algorithm is described, including its three main steps: selection, crossover, and mutation. A comparison between implementation costs and running times of regular expressions matching a string is then made. T...
A PKI ARCHITECTURE USING OPEN SOURCE SOFTWARE FOR EGOVERNMENT SERVICES IN ROMANIA
This article presents an architecture based on Open Source software that promote citizen’s access to electronic services in a secure way and attempt to make an analysis between two different Open Source Public Key Infras...