ADAPTATION OF THE MOMA-PLUS METHOD TO THE RESOLUTION OF TRANSPORTATION AND ASSIGNMENT PROBLEMS

---

Résumé

In this paper, we propose a new approach to solve transportation and assignment problems using the MOMA (MultiObjetive Metaheuristic based on Alienor method [7]) method algorithm. This approach consists in adapting the method of MOMA-plus version [1], initially conceived for the optimization in continuous variables, to the solving of combinatorial problems. It consists in transforming the transportation or assignment problem into an optimization problem without constraints and with a single variable. The using of our approach to resolve a transportation or assignment problem allows to enumerate almost the all existing solutions and thus provides more flexibility to a decision maker in his choice contrary to the Hungarian method of Kuhn [12]. In this work, four numerical experiments have allowed us to confirm our results.

Mots-clés

transportation problem, assignment problem, MOMA-plus method, Hungarian method