Seeking the Pareto front for multiobjective spatial optimization problems

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.

[1]  Andrzej P. Wierzbicki,et al.  The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[2]  R. Benayoun,et al.  Linear programming with multiple objective functions: Step method (stem) , 1971, Math. Program..

[3]  John R. Current,et al.  Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .

[4]  E J Barber,et al.  GUIDELINES FOR APPLYING CRITERIA TO DESIGNATE ROUTES FOR TRANSPORTING HAZARDOUS MATERIALS. IMPLEMENTATION PACKAGE , 1980 .

[5]  I. Y. Kim,et al.  Adaptive weighted-sum method for bi-objective optimization: Pareto front generation , 2005 .

[6]  G. List.  Siting Emergency Response Teams: Tradeoffs Among Response Time, Risk, Risk Equity and Cost , 1993 .

[7]  Evan J. Hughes.  Multi-objective Binary Search Optimisation , 2003, EMO.

[8]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[9]  Richard L. Church,et al.  Geographical information systems and location science , 2002, Comput. Oper. Res..

[10]  Carlos A. Coello Coello,et al.  An updated survey of GA-based multiobjective optimization techniques , 2000, CSUR.

[11]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[12]  Tong Gao,et al.  A min–max method with adaptive weightings for uniformly spaced Pareto optimum points , 2006 .

[13]  Johan Andersson,et al.  A survey of multiobjective optimization in engineering design , 2001 .

[14]  Hokey Min,et al.  Multiobjective design of transportation networks: taxonomy and annotation , 1986 .

[15]  Wei Chen,et al.  Quality utility : a Compromise Programming approach to robust design , 1999 .

[16]  Jacek Malczewski,et al.  GIS‐based multicriteria decision analysis: a survey of the literature , 2006, Int. J. Geogr. Inf. Sci..

[17]  J. Martel,et al.  Enhancing Geographical Information Systems Capabilities with Multi-Criteria Evaluation Functions , 2003 .

[18]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[19]  C. Nemmers,et al.  Guidelines for applying criteria to designate routes for transportating hazardous materials , 1983 .

[20]  Timothy C. Coburn,et al.  GIS and Multicriteria Decision Analysis , 2000 .

[21]  W. H. Zhang,et al.  A compromise programming method using multibounds formulation and dual approach for multicriteria structural optimization , 2003 .

[22]  Jacek Malczewski,et al.  GIS and Multicriteria Decision Analysis , 1999 .

[23]  Keith A. Seffen,et al.  A SIMULATED ANNEALING ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION , 2000 .

[24]  A. Wierzbicki.  On the completeness and constructiveness of parametric characterizations to vector optimization problems , 1986 .

[25]  A CoelloCarlos.  An updated survey of GA-based multiobjective optimization techniques , 2000 .

[26]  Adam C. Winstanley,et al.  An evolutionary algorithm for multicriteria path optimization problems , 2006, Int. J. Geogr. Inf. Sci..

[27]  Ruey Long Cheu,et al.  GIS and genetic algorithms for HAZMAT route planning with security considerations , 2004, Int. J. Geogr. Inf. Sci..

[28]  A. A. Elimam,et al.  Two engineering applications of a constrained shortest-path model , 1997 .

[29]  J. Dennis,et al.  A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems , 1997 .

[30]  P. Casey,et al.  Federal Highway Administration , 1994 .

[31]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[32]  Eric P. Smith,et al.  An Introduction to Statistical Modeling of Extreme Values , 2002, Technometrics.

[33]  Ralph E. Steuer,et al.  An interactive weighted Tchebycheff procedure for multiple objective programming , 1983, Math. Program..