Solving Fractional Programming Problems based on Swarm Intelligence

This paper presents a new approach to solve fractional programming problems (fpps) based on two different swarm intelligence (si) algorithms. the two algorithms are: particle swarm optimization, and firefly algorithm. the two algorithms are tested using several fpp benchmark examples and two selected industrial applications. the test aims to prove the capability of the si algorithms to solve any type of fpps. the solution results employing the si algorithms are compared with a number of exact and metaheuristic solution methods used for handling fpps. swarm intelligence can be denoted as an effective technique for solving linear or nonlinear, non-differentiable fractional objective functions. problems with an optimal solution at a finite point and an unbounded constraint set, can be solved using the proposed approach. numerical examples are given to show the feasibility, effectiveness, and robustness of the proposed algorithm. the results obtained using the two si algorithms revealed the superiority of the proposed technique among others in computational time. a better accuracy was remarkably observed in the solution results of the industrial application problems.