https://github.com/karanchawla/airfoil-optimization
This repository contains code development for the 4th credit project for AE416. The aim of the project is to compare different optimization algorithms in the context of airfoil optimization.
https://github.com/karanchawla/airfoil-optimization
airfoil airfoil-generation drag optimization-algorithms parsec particle-swarm-optimization xfoil
Last synced: 11 months ago
JSON representation
This repository contains code development for the 4th credit project for AE416. The aim of the project is to compare different optimization algorithms in the context of airfoil optimization.
- Host: GitHub
- URL: https://github.com/karanchawla/airfoil-optimization
- Owner: karanchawla
- License: mit
- Created: 2016-10-31T16:38:56.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2017-03-18T17:58:29.000Z (almost 9 years ago)
- Last Synced: 2025-03-28T10:47:32.506Z (11 months ago)
- Topics: airfoil, airfoil-generation, drag, optimization-algorithms, parsec, particle-swarm-optimization, xfoil
- Language: Python
- Size: 4.31 MB
- Stars: 23
- Watchers: 4
- Forks: 6
- Open Issues: 0
-
Metadata Files:
- Readme: Readme.md
- License: License.txt
Awesome Lists containing this project
README
The Python XFOIL optimization toolbox can be used to optimize airfoils for a specific operating range. I initially made it to be able to optimize the shape of a strut.
NOTE: Windows and Mac XFOIL binaries are included, see `xfoil` folder.
## Useful because...
of its three different toolsets:
- `/xfoil` module: Communicates with XFOIL, makes it possible to retrieve polar data with just one function call.
- `/airfoil_generators`: Contains parametric airfoil generators which convert a list of numbers into an airfoil shape. Currently implemented:
- NACA 4-series (for testing and fun)
- PARSEC (is limited in the shapes it can produce but produces reasonable airfoil shapes, play around with it [here](http://www.as.dlr.de/hs/d.PARSEC/Parsec.html))
- `/optimization_algorithms`: An optimization algorithm tries to find a point in a multidimensional space with the lowest score (e.g. point (x,y) within 1