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

Author

Deep, Kusum ; Chauhan, Pinkey ; Bansal, Jagdish Chand

Author_Institution

Dept. of Math., Indian Inst. of Technol., Roorkee, India

fYear

2009

fDate

9-11 Dec. 2009

Firstpage

1608

Lastpage

1611

Abstract

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.

Keywords

concave programming; integer programming; manufacturing industries; particle swarm optimisation; production management; ILXPSO; hybrid particle swarm optimization; mathematical model; nonconvex mixed integer nonlinear programming problem; nonconvex trim loss problem; process industry; Cost function; Glass industry; Linear programming; Mathematical model; Mathematical programming; Mathematics; Optimization methods; Particle swarm optimization; Pulp and paper industry; Textile industry; hybrid particle swarm optimization; nonconvex nonlinear programming; trim loss problem; waste minimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on

Conference_Location

Coimbatore

Print_ISBN

978-1-4244-5053-4

Type

conf

DOI

10.1109/NABIC.2009.5393658

Filename

5393658