Mixed Integer Distributed Ant Colony Optimization. MIDACO is a solver for general optimization problems. MIDACO can be applied to continuous (NLP), discrete/integer (IP) and mixed integer (MINLP) problems. Problems may be restricted to equality and/or inequality constraints. MIDACO is suitable for problems with up to several hundreds to some thousands of optimization variables. MIDACO implements a derivative-free, heuristic algorithm that treats the problem as black-box which may contain critical function properties such as non-convexity, discontinuities or stochastic noise. For cpu-time expensive applications, MIDACO offers an efficient parallelization strategy. The software is available in several programming languages, such as Excel, Matlab, Python, R, C/C++ and Fortran.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Patil, Bhagyesh V.; Nataraj, P.S.V.: An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (2014)
- Schlüter, Martin; Gerdts, Matthias; Rückmann, Jan-J.: A numerical study of MIDACO on 100 MINLP benchmarks (2012)
- Schlüter, Martin; Gerdts, Matthias: The oracle penalty method (2010)
Further publications can be found at: http://www.midaco-solver.com/index.php/about/publications