A Brief Review of Solving Dynamic Optimization Problems
Publish Year: 1394
نوع سند: مقاله کنفرانسی
زبان: English
View: 719
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ITCC01_190
تاریخ نمایه سازی: 9 فروردین 1395
Abstract:
Dynamic environments are those which possess the potentiality of changes over time. These changes can appear on parameters and different environmental agents. In this regard, some problems, called Dynamic Optimization Problems (DOPs), are defined both theoretically and practically in the real world. The most important challenge in solving these kinds of problems is related to how to become compatible with the newly changed environment as much as possible. Therefore, it is necessary to track and follow up the new optimum (optima) of the search space in optimization process. Moreover, finding the optimum (optima) as accurately as possible is another necessity of this compatibility. In order to meet the challenges, researchers intended to benefit from applying swarm intelligence, evolutionary algorithms inspired by the principle of evolving process and a set of special mechanisms. This paper reviews the methods of solving DOPs with some of their previous works. Diversity Scheme, Memory and Diversity Scheme, Multi-Population Scheme and Other Solutions are emphasized on these methods.
Keywords:
Authors
Nazanin Fouladgar
Computer Engineering Department, College of Nabi Akram, Tabriz, Iran
Shahriar Lotfi
Computer Science Department, University of Tabriz, Tabriz, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :