Multiple Criteria Decision Aiding (MCDA)

This paper deals with ranking stores in the locality of Mbanza-Ngungu (DR Congo) while considering consumers' preferences. The Conjoint Analysis method is used to determine weights for criteria to evaluate the considered alternatives. Next, we ran AHP and TOPSIS methods to rank these alternatives from the best to the worst. Both used methods agree with the same ranking for the six considered shopping centers. Additional computations had been performed to study the consistency of AHP matrices. The inconsistency rates of all AHP pairwise comparison matrices are lower than 0.1 showing that the AHP is verified.

This paper aims at presenting a new voting function which is obtained in Balinski-Laraki's framework and benefits mean and median advantages. The so-called Mean-Median Comprise Method (MMCM) has fulfilled criteria such as unanimity, neutrality, anonymity, monotonicity, and Arrow's independence of irrelevant alternatives. It also generalizes approval voting system.

No abstract

The transportation and the assignment problems have both been frequently investigated in the field of operations research. For a couple of decades, it has been proven that no greedy algorithm can yield an optimal solution to these problems since their respective underlying structures are not matroids. It is shown in this paper that, even though seeking a greedy algorithm to solve one of the aforesaid problems is fanciful, a heuristic method capable of providing good approximations to the optimal solution can be found. The so-called “hybrid greedy algorithm” is a hybridization of the Balas-Hammer and the Hungarian methods. It can be used to solve both the transportation and the assignment problems. It often provides an optimal solution to small assignment problems and it outperforms the Balas-Hammer (Vogel’s approximation method) and other heuristic methods for solving the transportation problem.JEL Classification: C02 , C61 , C63 MSC Classification: 00A72 , 03D15 , 68Q25 , 68U20 , 68W40 , 90C27