/optimization-methods

title: Optimization Methods
description: Genetic algorithms, simulated annealing, particle swarm optimization, gradient-based methods, topology optimization, shape optimization, size optimization, and benchmark problems for AEC computational design
version: 1.0.0
tags: [optimization, genetic-algorithm, simulated-annealing, PSO, gradient, topology, shape, size, metaheuristic]
auto_activate: true
user_invocable: true
invocation: /optimization-methods

Optimization Methods for AEC Computational Design

1. Optimization in AEC Design

The Role of Optimization

Optimization is the systematic process of finding the best solution from a set of feasible alternatives according to one or more criteria. In the Architecture, Engineering, and Construction (AEC) industry, optimization transforms design from an intuition-driven craft into a rigorous, evidence-based discipline that can explore thousands of alternatives in the time a human designer evaluates a handful.

Every AEC project embeds optimization problems whether practitioners recognize them or not. Selecting a column grid that minimizes steel tonnage, arranging rooms to maximize adjacency satisfaction, routing ductwork to minimize pressure loss, or shaping a facade to balance daylight and solar heat gain -- all are optimization problems with design variables, objectives, and constraints.

Design Optimization vs. Mathematical Optimization

Mathematical optimization seeks a global or local extremum of a function subject to constraints, governed by theorems about convexity, differentiability, and feasibility. Design optimization in AEC adds layers of complexity:

• **Multiple stakeholders** with conflicting objectives (cost vs. aesthetics vs. performance)
• **Mixed variable types**: continuous (member thickness), discrete (bolt count), categorical (material grade), topological (connectivity)
• **Expensive evaluations**: a single FEA run may take minutes; a CFD simulation hours; an energy model tens of minutes
• **Ill-defined objectives**: "architectural quality" resists quantification
• **Regulatory constraints**: building codes, zoning ordinances, fire safety -- hard constraints that cannot be relaxed
• **Manufacturing constraints**: available section catalogs, sheet sizes, fabrication tolerances
• **Uncertainty**: loads are probabilistic, material properties vary, construction tolerances exist

Problem Classification

| Classification Axis | Categories | AEC Examples | |---|---|---| | Variable type | Continuous, discrete, integer, mixed, combinatorial | Member sizing (continuous), bolt count (integer), material choice (categorical) | | Objective count | Single-objective, multi-objective, many-objective (>3) | Weight minimization (single), weight vs. cost vs. carbon (many) | | Constraint type | Unconstrained, equality-constrained, inequality-constrained, bound-constrained | Stress <= allowable, drift <= H/400, area = target | | Landscape | Convex, non-convex, multi-modal, discontinuous, noisy | Topology optimization (non-convex), layout optimization (multi-modal) | | Evaluation cost | Cheap (analytical), moderate (FEA), expensive (CFD), very expensive (coupled multi-physics) | Truss weight (cheap), building energy (expensive) | | Determinism | Deterministic, stochastic, robust, reliability-based | Deterministic sizing, reliability-based design under seismic uncertainty |

NP-Hardness of Real Design Problems

Many AEC optimization problems are NP-hard or NP-complete:

• **Floor plan layout** with adjacency and area constraints maps to graph partitioning and bin packing -- both NP-hard
• **Discrete structural topology** (deciding which members exist in a ground structure) is combinatorial with 2^n candidates for n potential members
• **Construction scheduling** with resource constraints is equivalent to job-shop scheduling (NP-hard)
• **Panelization of freeform surfaces** with planarity constraints is NP-hard in the general case
• **Steel connection design** with catalog-based bolt/plate selection is combinatorial

This NP-hardness means exact solutions are intractable for realistic problem sizes. Metaheuristics provide high-quality solutions in practical time, though without guarantees of global optimality.

When to Optimize vs. When to Use Engineering Judgment

Optimization is not always the answer. Use engineering judgment when:

• The design space is small enough to enumerate (< 50 alternatives)
• Code-prescriptive requirements dictate a single solution
• The objective is poorly defined or rapidly changing
• Computational cost of evaluation exceeds project budget
• The problem is so constrained that only one feasible solution exists

Use formal optimization when:

• The design space is large (hundreds to millions of alternatives)
• Multiple competing objectives require trade-off analysis
• Small improvements yield significant cost or performance savings
• The problem will recur across projects (amortize setup cost)
• Regulatory compliance must be demonstrated rigorously
• You need to prove to a client that the design is near-optimal

---

2. Algorithm Classification

Complete Taxonomy

Gradient-Based Methods

Gradient-based methods use derivative information (first-order: gradient; second-order: Hessian) to navigate the objective landscape. They are the workhorse of smooth, continuous optimization.

**Steepest Descent (Gradient Descent)**

• Update: x_{k+1} = x_k - alpha_k * grad(f(x_k))
• Step size alpha_k found via line search (Armijo, Wolfe conditions)
• Linear convergence rate; slow near optima due to zigzagging
• Use case: simple, low-dimensional smooth problems; often a starting point for teaching

**Conjugate Gradient (CG)**

• Constructs conjugate search directions that avoid zigzagging
• Fletcher-Reeves, Polak-Ribiere, Hestenes-Stiefel variants
• Superlinear convergence for quadratic objectives; resets every n steps
• Use case: large-scale unconstrained problems where Hessian storage is prohi