This optimizer implements an extended ant colony optimization to solve non-convex nonlinear programming problems. The algorithm handles constraints using an oracle penalty method. [Schluter2009] [LICENSE]
Bases: pyOpt.pyOpt_optimizer.Optimizer
MIDACO Optimizer Class - Inherited from Optimizer Abstract Class
MIDACO Optimizer Class Initialization
Keyword arguments:
Documentation last updated: Feb. 16, 2010 - Peter W. Jansen
Run Optimizer (Optimize Routine)
Keyword arguments:
Additional arguments and keyword arguments are passed to the objective function call.
Documentation last updated: February. 17, 2011 - Peter W. Jansen
Name | Type | Default Value | Notes |
---|---|---|---|
ACC | float | 0 | Accuracy for constraint violation (0 - Use internal default) |
ISEED | int | 0 | Seed for random number generator (0 - Use internal default) |
FSTOP | int | 0 | Objective Function Stopping Value (0 - disabled) |
AUTOSTOP | int | 0 | Automatic stopping criteria (0 - disable, [1,500] - from local to global) |
ORACLE | float | 0 | Oracle parameter for constrained problems (0 - Use internal default) |
FOCUS | int | 0 | Focus of search process around best solution (0 - Use internal default) |
ANTS | int | 0 | Number of iterates (ants) (0 - Use internal default) |
KERNEL | int | 0 | Size of the solution archive (0 - Use internal default) |
CHARACTER | int | 0 | Internal custom parameters (see MIDACO manual for options) |
MAXEVAL | int | 10000 | Maximal function evaluations |
MAXTIME | int | 86400 | Maximal time limit, in seconds |
IPRINT | int | 1 | Output Level (<0 - None, 0 - Screen, 1 - File) |
PRINTEVAL | int | 10000 | Print history after every PRINTEVAL evaluation |
IOUT1 | int | 36 | History output unit number |
IOUT2 | int | 37 | Best solution output unit number |
IFILE1 | str | ‘MIDACO_HIST.out’ | History output file name |
IFILE2 | str | ‘MIDACO_BEST.out’ | Best output file name |
LKEY | str | ‘-‘ | License Key (Default - Limited Key) |