Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
