An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767)

The shortest path problem with respect to two objectives is considered. The objectives are in conflict and it is impossible to find a single optimal solution, but there is a set of noninferior solutions from which the best one must be selected. An interactive method for the generation of an approximation of the noninferior solution set for two objective shortest path problems is proposed. The method incorporates interaction between the decision maker and analyst to reduce the number of alternative noninferior solutions. The interaction allows the decision maker to include additional criteria, values and personal judgment in the decision making process. The described interactive procedure is based upon the noninferior set estimation (NISE) method. In the algorithm a weighting method is used to generate an approximation of the noninferior solution set. The maximum possible error for the approximation is estimated at each iteration, which then is used to generate the next step of the procedure. For the demonstration of the given technique a sample example is presented.