ANALYSIS AND SYNTHESIS OF ENHANCED ANT COLONY OPTIMIZATION WITH THE TRADITIONAL ANT COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM

Authors

  • Pallavi Arora M.Tech (CSE) student
  • Harjeet Kaur Lovely Professional University
  • Prateek Agrawal Lovely Professional University

DOI:

https://doi.org/10.24297/ijct.v2i2b.2637

Keywords:

Ant Colony Optimization, Travelling Salesperson problem, Combinatorial Optimization, Pheromone, K-Means Clustering

Abstract

Ant Colony optimization is a heuristic technique which has been applied to a number of combinatorial optimization problem and is based on the foraging behavior of the ants. Travelling Salesperson problem is a combinatorial optimization problem which requires that each city should be visited once. In this research paper we use the K means clustering technique and Enhanced Ant Colony Optimization algorithm to solve the TSP problem. We show a comparison of the traditional approach with the proposed approach. The simulated results show that the proposed algorithm is better compared to the traditional approach.

Downloads

Download data is not yet available.

Author Biography

Pallavi Arora, M.Tech (CSE) student

Lovely Professional University

Downloads

Published

2011-12-30

How to Cite

Arora, P., Kaur, H., & Agrawal, P. (2011). ANALYSIS AND SYNTHESIS OF ENHANCED ANT COLONY OPTIMIZATION WITH THE TRADITIONAL ANT COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 1(1), 88–92. https://doi.org/10.24297/ijct.v2i2b.2637

Issue

Section

Research Articles