A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Hybrid Jaya Algorithm for Solving Multi-Objective 0-1 Integer Programming Problem
2019
International Journal of Engineering and Advanced Technology
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
doi:10.35940/ijeat.b4963.129219
fatcat:4l7xs55bsbdi7gzc37y7w5xz4a