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

B0013: a courtyard on a 17.3 × 28.1 m lot

5 dwellings, 25 rooms. No method found a design meeting every constraint within the budget.

Requirements

Lot
17.3 × 28.1 m (486 m²)
Street side faces
90° (0 = north)
Setbacks front / rear / left / right
5.3 / 7.2 / 2.4 / 1.5 m
Storeys × height
2 × 2.8 m
Shared core
yes (access gallery + stair)
Open space, net of parking
42% of the lot
Parking spaces
0
Courtyard
49 m² requested
Tightness (programme / buildable volume)
0.775

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.0005051.6
Random search0%0.00015004.7
Simulated annealing0%0.00015004.7
NSGA-II0%0.00015005.1
CP-SAT0%0.00004.6solver timeout
Random sketch + repair0%0.00015005.0repair collapse
Heuristic-seeded NSGA-II0%0.00015005.6repair collapse

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

Closest attempts that failed

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

Convergence on this brief

Archive hypervolume against evaluations, mean over seeds.

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

What stopped designs here

Share of each method's evaluated designs that violated each constraint.
methodC04C05C06C07C08C09C10C11C14
Heuristic21%57%18%26%1%1%2%96%
Random search100%100%100%100%57%99%99%98%30%
Simulated annealing90%100%97%88%26%90%29%90%38%
NSGA-II72%99%100%86%22%78%26%69%75%
Random sketch + repair89%95%86%61%46%70%84%92%80%
Heuristic-seeded NSGA-II34%80%30%29%8%15%16%25%97%

Constraint definitions