Hybrid Jaya Algorithm for Solving Multi-Objective 0-1 Integer Programming Problem
Surbhi Tilva1, Jayesh Dhodiya2
1Surbhi Tilva*, Applied Maths & Humanities Department, Sardar Vallabhbhai National Institute of Technology Surat, India.
2Jayesh Dhodiya, Applied Maths & Humanities Department, Sardar Vallabhbhai National Institute of Technology Surat, India.
Manuscript received on November 02, 2019. | Revised Manuscript received on November 15, 2019. | Manuscript published on December 30, 2019. | PP: 4867-4871 | Volume-9 Issue-2, December, 2019. | Retrieval Number: B4963129219/2019©BEIESP | DOI: 10.35940/ijeat.B4963.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The aim of this paper is to find the optimal solution of complex multi-objective 0-1 integer programming problem(IPP) where as other evolutionary approaches are fails to achieve optimal solution or it may take huge efforts for computation. This paper presents the Hybrid Jaya algorithm for solving Multi-objective 0-1 IPP with the use of exponential membership function. In this work, we have improved the Jaya algorithm by bring in the conception of binary and exponential membership function. To established the effectualness of the suggested algorithm, one mathematical illustration is given with a data set from the practical and sensible state. At the end, the response of the improved algorithm is compared with other reported algorithms and we found that the suggested algorithm is evenly good or better for obtaining the solution of multi-objective 0-1 IPP.
Keywords: α-Level sets, Exponential membership function, Jaya algorithm, Multi-Objective 0-1 Integer Programming Problem.