Document Actions
Python Genetic Algorithms
Numerical and combinatorial problems solved using Genetic Algorithms in Python
In the last few days, I have been working on 2 implementations of Genetic Algorithms to solve different 2 problems. The first problem is a numerical optimization problem described at "Genetic Algorithms + Data Structures = Evolution Programs", page 36 (really good book I need to say). The second problem is the classic "Traveling Salesman Problem - TSP", using TSPLIB files from National TSP.
The implementation of both codes reflect my personal understanding about some approachs on Genetic Algorithms. The numerical optimization one is mostly an implementation of what is described on the book, but the TSP implementation is a 'proof of concept' regard ideas described on the same book (chapter 11) plus some heuristics that I added by myself after read some articles like this.
I can't say that both codes are perfect. In fact, TSP code needs some more improviments, but they work. I liked the results, so I decided to post them.
The source code is avaliable here.
The implementation of both codes reflect my personal understanding about some approachs on Genetic Algorithms. The numerical optimization one is mostly an implementation of what is described on the book, but the TSP implementation is a 'proof of concept' regard ideas described on the same book (chapter 11) plus some heuristics that I added by myself after read some articles like this.
I can't say that both codes are perfect. In fact, TSP code needs some more improviments, but they work. I liked the results, so I decided to post them.
The source code is avaliable here.