Difference between revisions of "3. Evaluating options"

From COST Action FP0804: FORSYS
Jump to: navigation, search

Warning: require(): Unable to allocate memory for pool. in /data/home/fp0804/www/wiki/includes/AutoLoader.php on line 1191
Line 2: Line 2:
  
 
1. Selecting the best option  
 
1. Selecting the best option  
* In continuous case (see Malczewski 1999), the best option can be selected using optimizations tools, and in discrete case with multi-criteria analysis tools or voting methods.
+
* In continuous case (see Malczewski 1999), the best option can be selected using optimizations tools, and in discrete case with multi-criteria analysis MCA tools or voting methods.
 +
* The optimization tools may include linear or non-linear programming tools or heuristic optimization tools.
 
2. Ranking alternative options  
 
2. Ranking alternative options  
 
* If it is not enough to select one best option, the options can be ranked from best to worst. There may also be groups of options that are indifferent to the DM/stakeholders.
 
* If it is not enough to select one best option, the options can be ranked from best to worst. There may also be groups of options that are indifferent to the DM/stakeholders.

Revision as of 20:51, 12 September 2011

The tasks involved in this phase are

1. Selecting the best option

  • In continuous case (see Malczewski 1999), the best option can be selected using optimizations tools, and in discrete case with multi-criteria analysis MCA tools or voting methods.
  • The optimization tools may include linear or non-linear programming tools or heuristic optimization tools.

2. Ranking alternative options

  • If it is not enough to select one best option, the options can be ranked from best to worst. There may also be groups of options that are indifferent to the DM/stakeholders.

3. Aggregating preferences

  • In case of several stakeholders / DMs the preferences need to be aggregated, in order to select the best option.

Malczewski, J. 1999. GIS and Multicriteria decision analysis. Wiley. 392 p.