standard tier · 72 briefs · 1,368 runs · results db2e24e

CityFormGen

Generative and optimisation methods for middle housing, compared under matched compute

RESEARCH GENERATIVE-DESIGN BENCHMARK - NOT CONSTRUCTION DOCUMENTATION OR CODE CERTIFICATION.

hard · flats · 2 storeys

B0067: a courtyard on a 21.8 × 22.2 m lot

5 dwellings, 25 rooms. The pooled front across all methods holds 1 nondominated designs.

Requirements

Lot
21.8 × 22.2 m (484 m²)
Street side faces
210° (0 = north)
Setbacks front / rear / left / right
3.6 / 5.3 / 2 / 2.1 m
Storeys × height
2 × 2.8 m
Shared core
yes (access gallery + stair)
Open space, net of parking
27% of the lot
Parking spaces
0
Courtyard
53 m² requested
Tightness (programme / buildable volume)
0.678

Programme

DwellingTypeStoreyMin m²Rooms
U0studio033entry, living, kitchen, bathroom
U11BR046entry, living, kitchen, bathroom, bedroom primary
U21BR046entry, living, kitchen, bathroom, bedroom primary
U31BR146entry, living, kitchen, bathroom, bedroom primary
U42BR163entry, living, kitchen, bathroom, bedroom primary, bedroom secondary

Required contacts: entry–living, kitchen–living. Doors forbidden between: entry–bedroom_primary, entry–bedroom_secondary, kitchen–bathroom.

Results by method

MethodSolvedHVEvalssNotes
Heuristic0%0.0005712.6
Random search0%0.00015006.5
Simulated annealing0%0.00015006.5
NSGA-II0%0.00015007.3
CP-SAT0%0.00004.6solver timeout
Random sketch + repair0%0.00015007.4repair collapse
Heuristic-seeded NSGA-II33%0.01715007.7repair collapse

Mean over 1 seeds (the heuristic is deterministic: one run).

Representative designs from the pooled front

Each is best on one objective, or the knee: the most balanced trade-off. None is best overall.

Closest attempts that failed

For methods that found nothing feasible: their least-infeasible design, with its violations marked on its page.

Pareto explorer

Loading designs…

Convergence on this brief

Archive hypervolume against evaluations, mean over seeds.

Heuristic
00.011500 ev
Random search
00.011500 ev
Simulated annealing
00.011500 ev
NSGA-II
00.011500 ev
CP-SAT
00.011500 ev
Random sketch + repair
00.011500 ev
Heuristic-seeded NSGA-II
00.011500 ev

What stopped designs here

Share of each method's evaluated designs that violated each constraint.
methodC04C05C06C07C08C09C10C11C14
Heuristic27%87%77%98%1%1%2%8%
Random search100%100%100%100%42%97%96%98%24%
Simulated annealing69%99%98%87%10%82%41%87%33%
NSGA-II58%92%93%81%9%76%30%53%42%
Random sketch + repair64%98%98%76%23%35%72%94%85%
Heuristic-seeded NSGA-II42%97%85%95%7%21%17%25%14%

Constraint definitions