This repository provides Python implementations of genetic algorithms for solving two distinct problems: curve fitting and the knapsack problem. Genetic algorithms are employed to find optimal solutions in both scenarios.
The knapsack problem solver employs a genetic algorithm to maximize the total value of selected items placed in a knapsack, considering the weight capacity of the knapsack.
The curve fitting algorithm aims to find the best coefficients for a polynomial equation, minimizing the distance between the curve and a given set of data points.
To use the algorithms in this repository, you will need Python 3 installed on your system. You can download Python 3 from the official website: Python Downloads
Once you have Python 3 installed, you can run the programs for curve fitting and the knapsack problem.
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
Please make sure to update tests as appropriate.
👤 Michael Maher
- Twitter: @Michael___Maher
- Github: @Michael-M-aher
Please ⭐️ this repository if this project helped you!
Copyright © 2023 Michael Maher.
This project is MIT licensed.