Abstract
| Original language | English |
|---|---|
| Title of host publication | Numerical and Evolutionary Optimization – NEO 2017 |
| Editors | L. Trujillo, O. Schütze, Y. Maldonado, P. Valle |
| Place of Publication | Cham |
| Publisher | Springer |
| Pages | 62-82 |
| ISBN (Print) | 978-3-319-96103-3 |
| DOIs | |
| Publication status | Published - 2019 |
Publication series
| Name | Studies in Computational Intelligence |
|---|---|
| Volume | 785 |
Fingerprint
Cite this
}
Evaluating memetic building spatial design optimisation using hypervolume indicator gradient ascent. / van der Blom, K.; Boonstra, S.; Wang, H.; Hofmeyer, H.; Emmerich, Michael T.M.
Numerical and Evolutionary Optimization – NEO 2017. ed. / L. Trujillo; O. Schütze; Y. Maldonado; P. Valle. Cham : Springer, 2019. p. 62-82 (Studies in Computational Intelligence; Vol. 785).Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review
TY - CHAP
T1 - Evaluating memetic building spatial design optimisation using hypervolume indicator gradient ascent
AU - van der Blom, K.
AU - Boonstra, S.
AU - Wang, H.
AU - Hofmeyer, H.
AU - Emmerich, Michael T.M.
PY - 2019
Y1 - 2019
N2 - In traditional, single objective, optimisation local optima may be found by gradient search. With the recently introduced hypervolume indicator (HVI) gradient search, this is now also possible for multi-objective optimisation, by steering the whole Pareto front approximation (PFA) in the direction of maximal improvement. However, so far it has only been evaluated on simple test problems. In this work the HVI gradient is used for the real world problem of building spatial design, where the shape and layout of a building are optimised. This real world problem comes with a number of constraints that may hamper the effectiveness of the HVI gradient. Specifically, box constraints, and an equality constraint which is satisfied by rescaling. Moreover, like with regular gradient search, the HVI gradient may overstep an optimum. Therefore, step size control is also investigated. Since the building spatial designs are encoded in mixed-integer form, the use of gradient search alone is not sufficient. To navigate both discrete and continuous space, an evolutionary multi-objective algorithm (EMOA) and the HVI gradient are used in hybrid, forming a so-called memetic algorithm. Finally, the effectiveness of the memetic algorithm using the HVI gradient is evaluated empirically, by comparing it to an EMOA without a local search method. It is found that the HVI gradient method is effective in improving the PFA for this real world problem. However, due to the many discrete subspaces, the EMOA is able to find better solutions than the memetic approach, albeit only marginally.
AB - In traditional, single objective, optimisation local optima may be found by gradient search. With the recently introduced hypervolume indicator (HVI) gradient search, this is now also possible for multi-objective optimisation, by steering the whole Pareto front approximation (PFA) in the direction of maximal improvement. However, so far it has only been evaluated on simple test problems. In this work the HVI gradient is used for the real world problem of building spatial design, where the shape and layout of a building are optimised. This real world problem comes with a number of constraints that may hamper the effectiveness of the HVI gradient. Specifically, box constraints, and an equality constraint which is satisfied by rescaling. Moreover, like with regular gradient search, the HVI gradient may overstep an optimum. Therefore, step size control is also investigated. Since the building spatial designs are encoded in mixed-integer form, the use of gradient search alone is not sufficient. To navigate both discrete and continuous space, an evolutionary multi-objective algorithm (EMOA) and the HVI gradient are used in hybrid, forming a so-called memetic algorithm. Finally, the effectiveness of the memetic algorithm using the HVI gradient is evaluated empirically, by comparing it to an EMOA without a local search method. It is found that the HVI gradient method is effective in improving the PFA for this real world problem. However, due to the many discrete subspaces, the EMOA is able to find better solutions than the memetic approach, albeit only marginally.
U2 - 10.1007/978-3-319-96104-0_3
DO - 10.1007/978-3-319-96104-0_3
M3 - Chapter
SN - 978-3-319-96103-3
T3 - Studies in Computational Intelligence
SP - 62
EP - 82
BT - Numerical and Evolutionary Optimization – NEO 2017
A2 - Trujillo, L.
A2 - Schütze, O.
A2 - Maldonado, Y.
A2 - Valle, P.
PB - Springer
CY - Cham
ER -