GENETIC ALGORITHM BASED ON EXPLICIT MEMORY FOR SOLVING DYNAMIC PROBLEMS

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.

MOHAMMADPOUR MAJID; PARVIN HAMID

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

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2016 | Volume:7 | Issue:2 (24) Page(s): 53-68

Download Full-Text

View:

316

Download:

129

Cites:

Information Journal Paper

Title

GENETIC ALGORITHM BASED ON EXPLICIT MEMORY FOR SOLVING DYNAMIC PROBLEMS

Author(s)

MOHAMMADPOUR MAJID | PARVIN HAMID | Issue Writer Certificate

Keywords

DYNAMIC OPTIMIZATION

GENETIC ALGORITHM

EXPLICIT MEMORY

OFFLINE ERROR

Abstract

Nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. In the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). This is the idea underlining the use of memory in the field, which involves key design issues concerning the memory content, the process of memory update, and the process of memory retrieval. With use of the Aging Best Solution and Keeping Diversity in Population, the speed convergence of algorithm can be increased. This article presents a GENETIC ALGORITHM based on memory for dealing with DYNAMIC OPTIMIZATION problems and focuses on explicit placement of memory schemes, and performs a comprehensive analysis on current design of Moving Peaks Benchmark (MPB) problem. The MPB problem is the most proper benchmark for simulation of dynamic environments. The experimental study show the efficiency of the proposed approach for solving DYNAMIC OPTIMIZATION problems in comparison with other algorithms presented in the literature.

Cites

No record.

References

SOLVING THE TRAVELING SALESMAN PROBLEM BY AN EFFICIENT HYBRID METAHEURISTIC ALGORITHM

Cite

APA: Copy

MOHAMMADPOUR, MAJID, & PARVIN, HAMID. (2016). GENETIC ALGORITHM BASED ON EXPLICIT MEMORY FOR SOLVING DYNAMIC PROBLEMS. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 7(2 (24)), 53-68. SID. https://sid.ir/paper/328831/en

Vancouver: Copy

MOHAMMADPOUR MAJID, PARVIN HAMID. GENETIC ALGORITHM BASED ON EXPLICIT MEMORY FOR SOLVING DYNAMIC PROBLEMS. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2016;7(2 (24)):53-68. Available from: https://sid.ir/paper/328831/en

IEEE: Copy

MAJID MOHAMMADPOUR, and HAMID PARVIN, “GENETIC ALGORITHM BASED ON EXPLICIT MEMORY FOR SOLVING DYNAMIC PROBLEMS,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 7, no. 2 (24), pp. 53–68, 2016, [Online]. Available: https://sid.ir/paper/328831/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops