Afficher la notice abrégée

dc.creatorKarakostas, S.en
dc.date.accessioned2015-11-23T10:33:07Z
dc.date.available2015-11-23T10:33:07Z
dc.date.issued2015
dc.identifier10.1080/0305215x.2014.908870
dc.identifier.issn0305-215X
dc.identifier.urihttp://hdl.handle.net/11615/28993
dc.description.abstractThe multi-objective nature of most spatial planning initiatives and the numerous constraints that are introduced in the planning process by decision makers, stakeholders, etc., synthesize a complex spatial planning context in which the concept of solid and meaningful optimization is a unique challenge. This article investigates new approaches to enhance the effectiveness of multi-objective evolutionary algorithms (MOEAs) via the adoption of a well-known metaheuristic: the non-dominated sorting genetic algorithm II (NSGA-II). In particular, the contribution of a sophisticated crossover operator coupled with an enhanced initialization heuristic is evaluated against a series of metrics measuring the effectiveness of MOEAs. Encouraging results emerge for both the convergence rate of the evolutionary optimization process and the occupation of valuable regions of the objective space by non-dominated solutions, facilitating the work of spatial planners and decision makers. Based on the promising behaviour of both heuristics, topics for further research are proposed to improve their effectiveness.en
dc.source.uri<Go to ISI>://WOS:000350042100002
dc.subjectcrossover operatoren
dc.subjectmulti-criteria analysisen
dc.subjectgenetic algorithmsen
dc.subjectinitializationen
dc.subjectspatial planningen
dc.subjectALLOCATIONen
dc.subjectEngineering, Multidisciplinaryen
dc.subjectOperations Research & Management Scienceen
dc.titleMulti-objective optimization in spatial planning: Improving the effectiveness of multi-objective evolutionary algorithms (non-dominated sorting genetic algorithm II)en
dc.typejournalArticleen


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée