Seeking the Pareto front for multiobjective spatial optimization problems
Authors:
- 25 March 2008
- journal article
- research article
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 22 (5) , 507-526
Abstract
Spatial optimization problems, such as route selection, usually involve multiple, conflicting objectives relevant to locations. An ideal approach to solving such multiobjective optimization problems (MOPs) is to find an evenly distributed set of Pareto‐optimal alternatives, which is capable of representing the possible trade‐off among different objectives. However, these MOPs are commonly solved by combining the multiple objectives into a parametric scalar objective, in the form of a weighted sum function. It has been found that this method fails to produce a set of well spread solutions by disregarding the concave part of the Pareto front. In order to overcome this ill‐behaved nature, a novel adaptive approach has been proposed in this paper. This approach seeks to provide an unbiased approximation of the Pareto front by tuning the search direction in the objective space according to the largest unexplored region until a set of well‐distributed solutions is reached. To validate the proposed methodology, a case study on multiobjective routing has been performed using the Singapore road network with the support of GIS. The experimental results confirm the effectiveness of the approach.Keywords
This publication has 19 references indexed in Scilit:
- GIS and genetic algorithms for HAZMAT route planning with security considerationsInternational Journal of Geographical Information Science, 2004
- Geographical information systems and location scienceComputers & Operations Research, 2002
- An Introduction to Statistical Modeling of Extreme Values2001
- An updated survey of GA-based multiobjective optimization techniquesACM Computing Surveys, 2000
- Quality Utility—A Compromise Programming Approach to Robust DesignJournal of Mechanical Design, 1999
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization ProblemsSIAM Journal on Optimization, 1998
- A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problemsStructural and Multidisciplinary Optimization, 1997
- An Overview of Evolutionary Algorithms in Multiobjective OptimizationEvolutionary Computation, 1995
- Multiobjective design of transportation networks: Taxonomy and annotationEuropean Journal of Operational Research, 1986
- Linear programming with multiple objective functions: Step method (stem)Mathematical Programming, 1971