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 base...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2009 World Congress on Nature and Biologically Inspired Computing S. 1608 - 1611
Hauptverfasser: Deep, K., Chauhan, P., Bansal, J.C.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.12.2009
Schlagworte:
ISBN:1424450535, 9781424450534
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISBN:1424450535
9781424450534
DOI:10.1109/NABIC.2009.5393658