Multiobjective Optimization Methods

Abstract

This chapter focuses on the most often used conventional optimization approaches in GIS-MCDA. The methods can be classified into three groups: (i) methods for generating non-dominated solutions (the weighting, and constraint methods), (ii) the distance-based methods (such as compromise programming, goal programming, and reference point methods), and (iii) interactive methods. This classification is based on the ways in which the decision maker’s preference information is incorporated into the modeling procedure. Efficient solution generation methods do not require the preference information to be provided before performing the optimization procedure. In distance-based methods, the preferences are specified a priori; that is, all decision maker preferences are specified before the solution process. The interactive methods assume that the preferences can be provided progressively in the modeling procedure.