Solving mixed integer nonlinear programming problems with line-up competition algorithm

Line-up competition algorithm (LCA), a global optimization algorithm proposed recently, is applied to the solution of mixed integer nonlinear programming (MINLP) problems. Through using alternative schemes to handle integer variables, the algorithm reported previously for solving NLP problems can be...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & chemical engineering Vol. 28; no. 12; pp. 2647 - 2657
Main Authors:	Yan, Liexiang, Shen, Kun, Hu, Shenghua
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 15.11.2004
Subjects:	Global optimization Line-up competition algorithm Location-allocation problem Mixed integer nonlinear programming Multi-product batch chemical processes Global optimization Mixed integer nonlinear programming Multi-product batch chemical processes Line-up competition algorithm Location-allocation problem
ISSN:	0098-1354, 1873-4375
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Line-up competition algorithm (LCA), a global optimization algorithm proposed recently, is applied to the solution of mixed integer nonlinear programming (MINLP) problems. Through using alternative schemes to handle integer variables, the algorithm reported previously for solving NLP problems can be extended expediently to the solution of MINLP problems. The performance of the LCA is tested with several non-convex MINLP problems published in the literature, including the optimal design of multi-product batch chemical processes and the location-allocation problem. Testing shows that the LCA algorithm is efficient and robust in the solution of MINLP problems.
Bibliography:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0098-1354 1873-4375
DOI:	10.1016/j.compchemeng.2004.07.027