You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am using the U-NSGA-III algorithm to solve an aerodynamic (black-box) propulsion optimisation problem. For those interested, the code is available on my public repository here.
For this particular problem, there is only one objective: the propulsive efficiency. When using the feasibility-first constraint handling with save_history=True, memory usage is perfectly fine on a typical run (population size of 100 with a maximum of 100 generations). However, using save_history=True with the AdaptiveEpsilonConstraintHandling seems to eat memory like teenage me during breakfast. I have had to stop my code at generation 16.
In this generation, the time between the end of analysis of a current generation and the start of the next generation blows up exponentially, while the baseline memory load increases from a default of ~20GB (I am using a starmap parallelisation with 61 processes) to over 180GB.