Optimizations using Metaheuristics (GA, PSO, ABC...) for solving Travelling salesman Problem (38 / 194 cities) and CEC2008 benchmark functions.
-
Updated
Apr 27, 2020 - Jupyter Notebook
Optimizations using Metaheuristics (GA, PSO, ABC...) for solving Travelling salesman Problem (38 / 194 cities) and CEC2008 benchmark functions.
An entry into to the world of spacecraft trajectory design and optimization. The problem statement is to capture two planetary systems with one launch from earth, which means the initial part of the trajectory of a spacecraft which separates into two has to be the same. After separation, one half of the spacecraft will capture Saturn after takin…
Add a description, image, and links to the pygmo2 topic page so that developers can more easily learn about it.
To associate your repository with the pygmo2 topic, visit your repo's landing page and select "manage topics."