[Feature Request]: Traveling Salesman Problem (TSP) with Genetic Algorithm

[ashis2004]

Is there an existing issue for this?

• [X] I have searched the existing issues

Feature Description

• Data Collection: Generate or use existing datasets of city coordinates.
• Initialize Population: Create an initial population of random routes.
• Fitness Function: Define a fitness function to evaluate the total distance of each route.
• Selection: Select the best routes for crossover.
• Crossover: Combine routes to create new routes.
• Mutation: Introduce small changes to routes to maintain genetic diversity.
• Evaluation: Assess the performance of the algorithm in finding the shortest route.

Use Case

The Traveling Salesman Problem is a classic optimization problem where the goal is to find the shortest possible route that visits a list of cities and returns to the origin city.

Benefits

No response

Priority

High

Record

• [X] I agree to follow this project's Code of Conduct
• [X] I'm a GSSOC contributor
• [X] I want to work on this issue
• [X] I'm willing to provide further clarification or assistance if needed.

[ashis2004]

pls @sanjay-kv assign it me

[github-actions[bot]]

Hello @ashis2004! Your issue #337 has been closed. Thank you for your contribution!