Hybrid Jaya Algorithm for Solving Multi-Objective 0-1 Integer Programming Problem

  • Tilva S
  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Tilva, S., & Dhodiya, J. (2019). Hybrid Jaya Algorithm for Solving Multi-Objective 0-1 Integer Programming Problem. International Journal of Engineering and Advanced Technology, 9(2), 4867–4871. https://doi.org/10.35940/ijeat.b4963.129219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free