A New Memetic Model based on the Fixed Structure Learning Automata

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.

REZAPOOR MIRSALEH M.; MEYBODI M.R.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2018 | Volume:16 | Issue:3 Page(s): 183-195

Download Full-Text

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

Persian Verion

View:

816

Download:

Cites:

Information Journal Paper

Title

A New Memetic Model based on the Fixed Structure Learning Automata

Author(s)

REZAPOOR MIRSALEH M. | MEYBODI M.R. | Issue Writer Certificate

Keywords

Memetic algorithmQ2

MemeQ2

local searchQ2

global searchQ2

learning automataQ3

object migration automataQ1

Abstract

Memetic algorithm/fa?page=1&sort=1&ftyp=all&fgrp=all&fyrs=all" target="_blank">Memetic algorithm (MA) is a kind of evolutionary algorithms (EAs) that searches the problem solving space using local search and global search. The balance between global search and local search is one of the key issues in this algorithm. In this paper a new model is proposed, called GALA2. This model is combined of genetic algorithm (GA) and object migration automata (OMA), which is a kind of fixed-structure learning automaton. In the proposed model, global search is performed by genetic algorithm and local learning is performed by learning automata. In this model, the Lamarckian and Baldwinian learning models have been used to increase the convergence rate and avoidance of premature convergence, simultaneously. In this evolutionary model, chromosomes are represented by object migration automata for the purpose of using positive effects of evolution and local learning. In order to show the superiority of the proposed model, GALA2 is used to solve the graph isomorphism problem.

Cites

No record.

References

Cite

APA: Copy

REZAPOOR MIRSALEH, M., & MEYBODI, M.R.. (2018). A New Memetic Model based on the Fixed Structure Learning Automata. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 16(3 ), 183-195. SID. https://sid.ir/paper/228412/en

Vancouver: Copy

REZAPOOR MIRSALEH M., MEYBODI M.R.. A New Memetic Model based on the Fixed Structure Learning Automata. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2018;16(3 ):183-195. Available from: https://sid.ir/paper/228412/en

IEEE: Copy

M. REZAPOOR MIRSALEH, and M.R. MEYBODI, “A New Memetic Model based on the Fixed Structure Learning Automata,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 16, no. 3 , pp. 183–195, 2018, [Online]. Available: https://sid.ir/paper/228412/en

Related Journal Papers