Using evolutionary algorithms to generate alternatives for multiobjective site-search problems

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

Abstract

Multiobjective site-search problems are a class of decision problems that have geographical components and multiple, often conflicting, objectives; this kind of problem is often encountered and is technically difficult to solve. In this paper we describe an evolutionary algorithm (EA) based approach that can be used to address such problems. We first describe the general design of EAs that can be used to generate alternatives that are optimal or close to optimal with respect to multiple criteria. Then we define the problem addressed in this research and discuss how the EA was designed to solve it. In this procedure, called MOEA/Site, a solution (that is, a site) is encoded by using a graph representation that is operated on by a set of specifically designed evolutionary operations. This approach is applied to five different types of cost surfaces and the results are compared with 10 000 randomly generated solutions. The results demonstrate the robustness and effectiveness of this EA-based approach to geographical analysis and multiobjective decisionmaking. Critical issues regarding the representation of spatial solutions and associated evolutionary operations are also discussed.

Cite

CITATION STYLE

APA

Xiao, N., Bennett, D. A., & Armstrong, M. P. (2002). Using evolutionary algorithms to generate alternatives for multiobjective site-search problems. Environment and Planning A, 34(4), 639–656. https://doi.org/10.1068/a34109

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