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

B0030: a adu pair on a 12.9 × 18 m lot

2 dwellings, 11 rooms. The pooled front across all methods holds 582 nondominated designs.

Requirements

Lot
12.9 × 18 m (232 m²)
Street side faces
75° (0 = north)
Setbacks front / rear / left / right
3.6 / 5.8 / 2 / 1.5 m
Storeys × height
2 × 2.8 m
Shared core
yes (access gallery + stair)
Open space, net of parking
38% of the lot
Parking spaces
1
Courtyard
not required
Tightness (programme / buildable volume)
0.731

Programme

DwellingTypeStoreyMin m²Rooms
U02BR063entry, living, kitchen, bathroom, bedroom primary, bedroom secondary
U11BR146entry, living, kitchen, bathroom, bedroom primary

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

Results by method

MethodSolvedHVEvalssNotes
Heuristic0%0.0002800.6
Random search0%0.00015003.2
Simulated annealing100%0.06915003.6
NSGA-II100%0.09015004.5
CP-SAT100%0.078466.8
Random sketch + repair100%0.07515004.1repair collapse
Heuristic-seeded NSGA-II100%0.10015004.3repair 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.101500 ev
Random search
00.101500 ev
Simulated annealing
00.101500 ev
NSGA-II
00.101500 ev
CP-SAT
00.101500 ev
Random sketch + repair
00.101500 ev
Heuristic-seeded NSGA-II
00.101500 ev

What stopped designs here

Share of each method's evaluated designs that violated each constraint.
methodC04C05C06C07C08C09C10C11
Heuristic24%68%91%24%1%
Random search89%99%66%99%23%76%37%86%
Simulated annealing38%71%37%61%9%33%19%43%
NSGA-II32%71%32%49%9%31%19%32%
Random sketch + repair50%75%51%37%18%28%22%60%
Heuristic-seeded NSGA-II32%80%51%35%7%33%12%23%

Constraint definitions