scholarly journals Genetic evolution vs. function approximation: Benchmarking algorithms for architectural design optimization

2018 ◽  
Vol 6 (3) ◽  
pp. 414-428 ◽  
Author(s):  
Thomas Wortmann

Abstract This article presents benchmark results from seven simulation-based problems from structural, building energy, and daylight optimization. Growing applications of parametric design and performance simulations in architecture, engineering, and construction allow the harnessing of simulation-based, or black-box, optimization in the search for less resource- and/or energy consuming designs. In architectural design optimization (ADO) practice and research, the most commonly applied black-box algorithms are genetic algorithms or other metaheuristics, to the neglect of more current, global direct search or model-based, methods. Model-based methods construct a surrogate model (i.e., an approximation of a fitness landscape) that they refine during the optimization process. This benchmark compares metaheuristic, direct search, and model-based methods, and concludes that, for the given evaluation budget and problems, the model-based method (RBFOpt) is the most efficient and robust, while the tested genetic algorithms perform poorly. As such, this article challenges the popularity of genetic algorithms in ADO, as well as the practice of using them for one-to-one comparisons to justify algorithmic innovations. Highlights Benchmarks optimization algorithms on structural, energy, and daylighting problems. Benchmarks metaheuristic, direct search, and model-based optimization methods. Challenges the popularity of genetic algorithms in architectural design optimization. Presents model-based methods as a more efficient and reliable alternative.

Author(s):  
Marcus Pettersson ◽  
Johan O¨lvander

Box’s Complex method for direct search has shown promise when applied to simulation based optimization. In direct search methods, like Box’s Complex method, the search starts with a set of points, where each point is a solution to the optimization problem. In the Complex method the number of points must be at least one plus the number of variables. However, in order to avoid premature termination and increase the likelihood of finding the global optimum more points are often used at the expense of the required number of evaluations. The idea in this paper is to gradually remove points during the optimization in order to achieve an adaptive Complex method for more efficient design optimization. The proposed method shows encouraging results when compared to the Complex method with fix number of points and a quasi-Newton method.


2015 ◽  
Vol 52 (4) ◽  
pp. 1021-1037 ◽  
Author(s):  
Robert E. Thompson ◽  
John M. Colombi ◽  
Jonathan Black ◽  
Bradley J. Ayres

Author(s):  
Zhouzhou Su ◽  
Wei Yan

AbstractBuilding performance simulation and genetic algorithms are powerful techniques for helping designers make better design decisions in architectural design optimization. However, they are very time consuming and require a significant amount of computing power. More time is needed when two techniques work together. This has become the primary impediment in applying design optimization to real-world projects. This study focuses on reducing the computing time in genetic algorithms when building simulation techniques are involved. In this study, we combine two techniques (offline simulation and divide and conquer) to effectively improve the run time in these architectural design optimization problems, utilizing architecture-specific domain knowledge. The improved methods are evaluated with a case study of a nursing unit design to minimize the nurses’ travel distance and maximize daylighting performance in patient rooms. Results show the computing time can be saved significantly during the simulation and optimization process.


2020 ◽  
Vol 143 (4) ◽  
Author(s):  
Yufei Wu ◽  
Teng Long ◽  
Renhe Shi ◽  
G. Gary Wang

Abstract This article presents a novel mode-pursuing sampling method using discriminative coordinate perturbation (MPS-DCP) to further improve the convergence performance of solving high-dimensional, expensive, and black-box (HEB) problems. In MPS-DCP, a discriminative coordinate perturbation strategy is integrated into the original mode-pursuing sampling (MPS) framework for sequential sampling. During optimization, the importance of variables is defined by approximated global sensitivities, while the perturbation probabilities of variables are dynamically adjusted according to the number of optimization stalling iterations. Expensive points considering both optimality and space-filling property are selected from cheap points generated by perturbing the current best point, which balances between global exploration and local exploitation. The convergence property of MPS-DCP is theoretically analyzed. The performance of MPS-DCP is tested on several numerical benchmarks and compared with state-of-the-art metamodel-based design optimization methods for HEB problems. The results indicate that MPS-DCP generally outperforms the competitive methods regarding convergence and robustness performances. Finally, the proposed MPS-DCP is applied to a stepped cantilever beam design optimization problem and an all-electric satellite multidisciplinary design optimization (MDO) problem. The results demonstrate that MPS-DCP can find better feasible optima with the same or less computational cost than the competitive methods, which demonstrates its effectiveness and practicality in solving real-world engineering problems.


2012 ◽  
Vol 22 (02) ◽  
pp. 1250009 ◽  
Author(s):  
JERRY SWAN ◽  
GABRIELA OCHOA ◽  
GRAHAM KENDALL ◽  
MARTIN EDJVET

Attempts have been made to eliminate some potential counterexamples to the Andrews–Curtis conjecture using the combinatorial optimization methods of blind-search and the genetic algorithms meta-heuristic. Breadth-first search with secondary storage is currently the most successful method, which raises questions regarding the inferior performance of heuristic search. In order to understand the underlying reasons we obtain fitness landscape metrics for a number of balanced presentations and draw conclusions regarding the likely effectiveness of other meta-heuristics.


2021 ◽  
Vol 21 (4) ◽  
pp. 271-289
Author(s):  
Renato Godoi da Cruz ◽  
Cláudia Maria Arcipreste ◽  
Rafael Lemieszek Pinheiro ◽  
Rovadávia Aline de Jesus Ribas

Abstract This paper describes the construction of an information flow that combines parametric modelling and genetic algorithms to optimise both the total weight of a structured steel roof and the shape of its surface to maximise the generation potential of photovoltaic energy. Through the systematisation of a design process using genetic algorithms integrated with generative design as an architectural design method, architects can work with problem parameterisation, going one step further than the mere formal proposition of solutions.As a result, we present a process in which there is a dialogical relationship between the architect and project in a continuous flow of information in the initial steps of the design process, guided by predefined optimisation objectives. Therefore, it is relevant to note that the designer accepts a reduced creative control over the final shape in favor of control over the core principles that constitute the optimisation algorithms. An approach that involved the designer in a process of post computational processing evaluations is also highlighted, giving him better support to discuss and analyze the design options.


Author(s):  
Nataliya Gulayeva ◽  
Volodymyr Shylo ◽  
Mykola Glybovets

Introduction. As early as 1744, the great Leonhard Euler noted that nothing at all took place in the universe in which some rule of maximum or minimum did not appear [12]. Great many today’s scientific and engineering problems faced by humankind are of optimization nature. There exist many different methods developed to solve optimization problems, the number of these methods is estimated to be in the hundreds and continues to grow. A number of approaches to classify optimization methods based on various criteria (e.g. the type of optimization strategy or the type of solution obtained) are proposed, narrower classifications of methods solving specific types of optimization problems (e.g. combinatorial optimization problems or nonlinear programming problems) are also in use. Total number of known optimization method classes amounts to several hundreds. At the same time, methods falling into classes far from each other may often have many common properties and can be reduced to each other by rethinking certain characteristics. In view of the above, the pressing task of the modern science is to develop a general approach to classify optimization methods based on the disclosure of the involved search strategy basic principles, and to systematize existing optimization methods. The purpose is to show that genetic algorithms, usually classified as metaheuristic, population-based, simulation, etc., are inherently the stochastic numerical methods of direct search. Results. Alternative statements of optimization problem are given. An overview of existing classifications of optimization problems and basic methods to solve them is provided. The heart of optimization method classification into symbolic (analytical) and numerical ones is described. It is shown that a genetic algorithm scheme can be represented as a scheme of numerical method of direct search. A method to reduce a given optimization problem to a problem solvable by a genetic algorithm is described, and the class of problems that can be solved by genetic algorithms is outlined. Conclusions. Taking into account the existence of a great number of methods solving optimization problems and approaches to classify them it is necessary to work out a unified approach for optimization method classification and systematization. Reducing the class of genetic algorithms to numerical methods of direct search is the first step in this direction. Keywords: mathematical programming problem, unconstrained optimization problem, constrained optimization problem, multimodal optimization problem, numerical methods, genetic algorithms, metaheuristic algorithms.


Author(s):  
Bastien Talgorn ◽  
Sébastien Le Digabel ◽  
Michael Kokkolaras

Typical challenges of simulation-based design optimization include unavailable gradients and unreliable approximations thereof, expensive function evaluations, numerical noise, multiple local optima and the failure of the analysis to return a value to the optimizer. The remedy for all these issues is to use surrogate models in lieu of the computational models or simulations and derivative-free optimization algorithms. In this work, we use the R dynaTree package to build statistical surrogates of the blackboxes and the direct search method for derivative-free optimization. We present different formulations for the surrogate problem considered at each search step of the Mesh Adaptive Direct Search (MADS) algorithm using a surrogate management framework. The proposed formulations are tested on two simulation-based multidisciplinary design optimization problems. Numerical results confirm that the use of statistical surrogates in MADS improves the efficiency of the optimization algorithm.


2015 ◽  
Vol 137 (2) ◽  
Author(s):  
Bastien Talgorn ◽  
Sébastien Le Digabel ◽  
Michael Kokkolaras

Typical challenges of simulation-based design optimization include unavailable gradients and unreliable approximations thereof, expensive function evaluations, numerical noise, multiple local optima, and the failure of the analysis to return a value to the optimizer. One possible remedy to alleviate these issues is to use surrogate models in lieu of the computational models or simulations and derivative-free optimization algorithms. In this work, we use the R dynaTree package to build statistical surrogates of the blackboxes and the direct search method for derivative-free optimization. We present different formulations for the surrogate problem (SP) considered at each search step of the mesh adaptive direct search (MADS) algorithm using a surrogate management framework. The proposed formulations are tested on 20 analytical benchmark problems and two simulation-based multidisciplinary design optimization (MDO) problems. Numerical results confirm that the use of statistical surrogates in MADS improves the efficiency of the optimization algorithm.


Sign in / Sign up

Export Citation Format

Share Document