Column Penalty Method for Solving assignment Problems

Abstract

The Assignment Problem is one of the combinatorialessentialoptimization problems in the fieldof Operations Research. The objectiveof the assignment problem is to reduce the time or cost of complementa number of activities by a number of resources. The maincharacteristic isequalitybetween the number of sources and the number of destinations. In this paper, Column Penalty Method (CPM) for solving assignment problem is proposed. It can be seen that the results obtained by the proposed Column Penalty method reduces order of the matrix, number of tables and the number of iterations. It is anefficient method that will reduce steps in order toget optimal solution. The result of suggested method is also compared with the wellknown Hungarian Method and other existing methods. This method can also be used to solve any real physical world problem such as production planning, telecommunication design, traveling salesman problem, and the Airline Crew Assignment Problem (ACAP).