• COMPARATIVE STUDY OF HA, MOA AND NAA METHODS FOR SOLVING ASSIGNMENT PROBLEMS

Abstract

The assignment problem is a special case of the transportation problem in which the objective is to assign n number of resources to n number of activities at a minimum cost or maximum profit. In this paper we attempt to introduce the algorithms and solution steps for HA, MOA and NAA methods used to solve assignment problems. Finally we compare with the optimal solutions among these three methods.