Skip to content

A Python implementation of a Genetic Algorithm to find the shortest route between cities using given city coordinates.

License

Notifications You must be signed in to change notification settings

Aymen016/Shortest-Route-Genetic-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

ย 

History

5 Commits
ย 
ย 
ย 
ย 
ย 
ย 

Repository files navigation

๐Ÿš€ Shortest Route Genetic Algorithm ๐Ÿงฌ

This repository contains a Python implementation of a Genetic Algorithm to find the shortest route between cities based on given coordinates. It demonstrates how evolutionary techniques can solve optimization problems effectively! ๐ŸŒŸ

๐Ÿ“š Features

  • ๐Ÿ—บ๏ธ City Locations: Configurable coordinates for cities.
  • ๐Ÿ”„ Genetic Algorithm: Utilizes selection, crossover, and mutation to evolve solutions.
  • ๐Ÿ“ˆ Visualization: Plots the shortest route using matplotlib.

โš’๏ธ Tools & Libraries

  • ๐Ÿ Python
  • ๐Ÿ”ข Genetic Algorithm
  • ๐ŸŽฒ Random Library
  • ๐Ÿงฎ Euclidean Distance
  • ๐Ÿ“Š Matplotlib (for route visualization)

๐Ÿ—๏ธ How to Use

  1. Clone the repository:
    git clone https://github.com/your-username/shortest-route-genetic-algorithm.git

๐ŸŽ‰ Contribute

Feel free to fork this repository, improve the algorithm, or add new features. Contributions are welcome! ๐Ÿค

๐Ÿ“œ License

This project is licensed under the MIT License. ๐Ÿ“„

About

A Python implementation of a Genetic Algorithm to find the shortest route between cities using given city coordinates.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages