کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10347291 699116 2011 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
چکیده انگلیسی
In this paper, a new algorithm for solving constrained nonlinear programming problems is presented. The basis of our proposed algorithm is none other than the necessary and sufficient conditions that one deals within a discrete constrained local optimum in the context of the discrete Lagrange multipliers theory. We adopt a revised particle swarm optimization algorithm and extend it toward solving nonlinear programming problems with continuous decision variables. To measure the merits of our algorithm, we provide numerical experiments for several renowned benchmark problems and compare the outcome against the best results reported in the literature. The empirical assessments demonstrate that our algorithm is efficient and robust.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 8, August 2011, Pages 1164-1174
نویسندگان
, ,