کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
481261 1446162 2008 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
General variable neighborhood search for the continuous optimization
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
General variable neighborhood search for the continuous optimization
چکیده انگلیسی

We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 191, Issue 3, 16 December 2008, Pages 753–770
نویسندگان
, , , ,