Solving nonconvex trim loss problem using an efficient hybrid Particle Swarm Optimization

Trim loss is one of the most common problem arising in process industries. Its mathematical model is a nonconvex mixed integer nonlinear programming problem subject to several constraints. In this paper we consider four hypothetical cases, taken from literature and propose an efficient approach based on particle swarm optimization namely ILXPSO for solving trim loss problem. The numerical results when compared with the results available in literature show the efficiency and robustness of the proposed algorithm.