This approach solves MOAP based on the IHA while using distance-based approaches. The weighted goal programming approach is developed, which is focused on decreasing the distances between ideal objectives and achievable objective space. It presents finest compromise approach for MOLPP. MOLPP is addressed by the suggested model by addressing a sequence of single goal sub-problems, where the objectives are turned into constraints. The provided compromise solution can be improved by setting priority in terms of weights. A criterion for determining the best compromise solution is also proposed. The proposed methodology will tackle the multi-objective assignment problems while using the improved Hungarian algorithm used for mono-objective assignment problems. The suggested technique will be useful in solving transportation and assignment problems with various and competing objectives.

Key Words: Multi-objective programming; Distance-based Method; Optimization,