ARL Topologies vs Dakota
ARL Topologies
github.comDakota
dakota.sandia.govSide by side
| Figure | ARL Topologies | Dakota |
|---|---|---|
| Price from | Free | Free |
| Free plan | Yes | Yes |
| Free trial | — | — |
| Open source | — | — |
| Windows | — | Yes |
| macOS | — | Yes |
| Linux | — | Yes |
| Self-hosted | Yes | — |
| Plans published | 1 | 1 |
| Spec score · Generative Design Software | 7.9 (#5) | 7.9 (#7) |
| License | The repository license describes CC0 1.0 Universal terms, with a stated patent-license modification for contributions. | Dakota versions 5.0 and newer are available under the GNU Lesser General Public License. |
| Purpose | ARL_Topologies is an extensible topology optimization program intended as both a research platform and a general-use tool. | Dakota provides software for optimization and uncertainty quantification using computational models. |
Plans
In their own words
ARL Topologies
ARL Topologies is free, open-source software for topology optimization, published by USArmyResearchLab as a United States government project. It is intended for research and general use, and runs self-hosted from the command line with an XML input file. The program separates design representation, optimization method, and objective function. Representations include two- and three-dimensional element-based density discretization with SIMP interpolation, plus nodal-based density discretization with Heaviside projection and filtering. Inputs can be ASCII ExodusII or GMSH meshes, or rectangular pixel and voxel regions. Available optimizers include optimality criterion, method of moving asymptotes, BFGS through NLopt, and a genetic algorithm. Its implemented objective performs static structural finite element analysis. Density results can be post-processed to STL, while VTK, GMSH, and Matlab are output formats. A shared-library objective function allows extension to other problems. Building requires a C++11 compiler and listed libraries.
Dakota
Dakota provides software for optimization and uncertainty quantification using computational models. Its methods cover optimization, uncertainty quantification, parameter estimation, and sensitivity or variance analysis. These capabilities can be combined into strategies such as hybrid optimization, surrogate-based optimization and optimization under uncertainty. The C++ toolkit connects simulation codes with iterative systems-analysis methods, and Dakota lists MPI for parallel distributed-memory communication. The project describes engineering analysts using it to explore designs and assess confidence in computational predictions. Prebuilt binaries are available for macOS, Windows and Red Hat Enterprise Linux 7 and 8; other platforms require building from source. Installation instructions also describe an optional PYTHONPATH setup for the dakota.interfacing Python module. Dakota versions 5.0 and newer are available under the GNU Lesser General Public License. Some optional numerical libraries, including DOT, NLPQLP and NPSOL/NLSSOL, require separate commercial licenses. Documentation for releases 6.17 and later is available through the documentation site, with older manuals available for download. User support is directed to GitHub Discussions, and the project offers introductory and methods-focused screencasts.