Highly Influential

7 Excerpts

- Published 2012 in 2012 IEEE International Conference on…

This paper presents a Discrete Particle Swarm Optimization (DPSO) technique to solve Graph based Travelling Salesman Problem (TSP). TSP can be represented as a graph where nodes represent cities and edges represent paths between them. A partially connected graph addresses a more realistic problem than a completely connected graph since in real life paths may not exist between certain cities. A novel approach to DPSO is used to obtain results in this situation. Convergence of DPSO to the optimal solution for such a Graph based TSP is tasted.

Showing 1-10 of 10 references

Highly Influential

7 Excerpts

Highly Influential

5 Excerpts

Highly Influential

5 Excerpts

Highly Influential

5 Excerpts

Highly Influential

5 Excerpts

Highly Influential

3 Excerpts

Highly Influential

5 Excerpts

Highly Influential

6 Excerpts

Highly Influential

5 Excerpts

Highly Influential

5 Excerpts

@article{Afaq2012ANA,
title={A novel approach to solve Graph based Travelling Salesman Problem using Particle Swarm Optimization technique},
author={Hifza Afaq and Sapana Saini},
journal={2012 IEEE International Conference on Computational Intelligence and Computing Research},
year={2012},
pages={1-4}
}