Multi-Objective Algorithms for Solving Disjoint Search Space Optimization Problems

EasyChair Preprint 2532

Abstract

Urban development is governed by a number of rules that buildings must respect. Our aim is to generate buildings that meet these rules while optimising the living space. In this context, a major difficulty arises when there are several disjointed research areas. A classic solution consists in multiplying the optimum search scenarios. To avoid this multiplicity of scenarios, we propose to join the disjointed spaces and use a multi-objective approach based on a penalty function for rule violation in addition to maximizing the building surface area.

Keyphrases: Optimisation multi-objectifs, plan local d’urbanisme, satisfaction de contraintes

@booklet{EasyChair:2532,
  author    = {Astrid Jourdan and Yannick Le Nir and Peio Loubière},
  title     = {Multi-Objective Algorithms for Solving Disjoint Search Space Optimization Problems},
  howpublished = {EasyChair Preprint 2532},
  year      = {EasyChair, 2020}}