This project compares the classical implementation of Genetic Algorithm and Ant Colony Optimization, to solve a TSP problem.

It's possible to define the number of cities to visit , and also interactively create new cities to visit in a 2D spatial panel. A total distance is given for AG and ACO solution at end.

Project Samples

tsp-problem-ga-aco-comparisson Screenshot 1 tsp-problem-ga-aco-comparisson Screenshot 2

Project Activity

See All Activity >

Follow tsp-problem-ga-aco-comparisson

tsp-problem-ga-aco-comparisson Web Site

Other Useful Business Software
The Most Powerful Software Platform for EHSQ and ESG Management Icon
The Most Powerful Software Platform for EHSQ and ESG Management

Addresses the needs of small businesses and large global organizations with thousands of users in multiple locations.

Choose from a complete set of software solutions across EHSQ that address all aspects of top performing Environmental, Health and Safety, and Quality management programs.
Learn More
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of tsp-problem-ga-aco-comparisson!

Additional Project Details

Programming Language

Java

Registered

2016-06-23
Report inappropriate content