Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ejabati Seyyed Masoud; ZAHIRI SEYED HAMID

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2020 | Volume:16 | Issue:4 (42) Page(s): 27-43

Download Full-Text

Persian Verion

View:

839

Download:

Cites:

Information Journal Paper

Title

Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods

Author(s)

Ejabati Seyyed Masoud | ZAHIRI SEYED HAMID | Issue Writer Certificate

Keywords

Increase decrease particleQ1

Dynamic optimization problems (DOPs)Q1

Multi-population approachQ1

Particle swarm optimizationQ1

Abstract

In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environment. Accordingly, several researchers believe in the effectiveness of following a series of optimums compared to a global optimum. Therefore, when an environment is changed, following a global optimum in a series of best optimums is more efficient. Evolutionary algorithms (EA) were inspired by biological and natural evolution. Because of changing characteristic of nature, it can be a good option for dynamic optimization. In recent years, different methods have been proposed to improve EA of static environments. One of the most common methods is multi-population method. In this method, the whole space is divided into sub-spaces. Each sub-space covers some local optimums and represents a sub-population. The algorithm updates the particles of each sub-space and searches the best optimum. The most challenging issue of multi-population method is to create the desired number of sub-population and people to cover different sub-spaces in the search space. In the present study, in order to deal with the challenges, a new algorithm based on particle optimization algorithm, which is called decrement and increment particle optimization algorithm, was proposed. The algorithm is able to follow and find the number of time-varied optimum in an environment with invisible changes by increasing or decreasing the number of particles adaptively. Another challenging issue in dynamic optimization is the detection of environmental changes, due to the impossibility of this issue and failure of detection-based algorithms. In the proposed method, there is no need to detect the environmental changes and it always adapts itself to the environment. Furthermore, the terms of focused search area were defined to emphasize on promising spaces to accelerate the local search process and prevent early convergence. The results of the proposed algorithm were evaluated on moving peaks and compared with several valid algorithms. The results showed the positive effect of decrement/increment mechanism of particles on finding and following time of many optimums compared to other multi-population based optimization algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

Ejabati, Seyyed Masoud, & ZAHIRI, SEYED HAMID. (2020). Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods. SIGNAL AND DATA PROCESSING, 16(4 (42) ), 27-43. SID. https://sid.ir/paper/375630/en

Vancouver: Copy

Ejabati Seyyed Masoud, ZAHIRI SEYED HAMID. Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods. SIGNAL AND DATA PROCESSING[Internet]. 2020;16(4 (42) ):27-43. Available from: https://sid.ir/paper/375630/en

IEEE: Copy

Seyyed Masoud Ejabati, and SEYED HAMID ZAHIRI, “Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods,” SIGNAL AND DATA PROCESSING, vol. 16, no. 4 (42) , pp. 27–43, 2020, [Online]. Available: https://sid.ir/paper/375630/en

Related Journal Papers