Multi-objective assignment problem solved by hybrid Jaya algorithm

Abstract

The objective of this paper is to search the efficient arrangements of huge multi-objective assignment problem (MOAP). Here, we have modified the Jaya algorithm with the help of product operator in exponential membership functions for solving MOAP. We have also provided one numerical illustration from the real world for verifying the results of proposed approach. At last, the results of the proposed approach are contrasted with reputed approaches and from that we can conclude that the proposed approach is better for solving the MOAP.

Subject Classification:

• 90C59
• 90B50
• 90B80
• 90C29
• 90C90

Keywords:

• Binary numbers
• Exponential membership functions
• Jaya algorithm
• Multi-objective assignment problem