Partially ordered preferences applied to the site location problem in urban planning

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that allows the management of partially ordered constraints and a Geographical Information System (GIS) allowing spatial data mapping and analysis. Experts in urban planning provides constraints, being in our application a combination of legal constraints and preferences expressed by the property developer. As these constraints can hardly be totally ordered because they are not comparable, constraints are partially ordered. The experiment was performed using about 3800 cadastral parcels and 12 different constraints, each parcel being characterised for each constraint using GIS analysis operators. Data are then processed by the program mpropre (Managing PaRtially Ordered PREferences) that provides in output one or several optimal parcels. Results are finally validated by an expert and using ortho-images of the geographic area of interest. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Lagrue, S., Devillers, R., & Besqueut, J. Y. (2004). Partially ordered preferences applied to the site location problem in urban planning. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3180, 151–160. https://doi.org/10.1007/978-3-540-30075-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free