A NEW CRITERION FOR BALANCING GLOBAL SEARCH AND LOCAL SEARCH IN MEMETIC ALGORITHM

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:2015 | Volume:13 | Issue:1 Page(s): 63-69

Download Full-Text

Persian Verion

View:

804

Download:

Cites:

Information Journal Paper

Title

A NEW CRITERION FOR BALANCING GLOBAL SEARCH AND LOCAL SEARCH IN MEMETIC ALGORITHM

Author(s)

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

Keywords

GLOBAL SEARCHQ3

LEARNING AUTOMATA (LA)Q2

LOCAL SEARCHQ2

MEMETIC ALGORITHM (MA)Q2

MEMEQ2

Abstract

One of the problems with traditional genetic algorithms is its premature convergence that makes them incapable of searching good solutions of the problem. A MEMEtic algorithm (MA) which is an extension of the traditional genetic algorithm uses a LOCAL SEARCH method to either accelerate the discovery of good solutions, for which evolution alone would take too long to discover, or to reach solutions that would otherwise be unreachable by evolution or a LOCAL SEARCH method alone. In this paper, a MEMEtic algorithm based on learning automata (LA) and MEMEtic algorithm, called LA-MA, is introduced. This algorithm is composed of two parts, genetic section and MEMEtic section. Evolution is performed in genetic section and LOCAL SEARCH is performed in MEMEtic section. The basic idea of LA-MA is to use learning automata during the process of searching for solutions in order to create a balance between exploration performed by evolution and exploitation performed by LOCAL SEARCH. To evaluate the efficiency of LA-MA, it has been used to solve two optimization problems: OneMax and graph isomorphism problems. The results of computer experimentations have shown that different versions of LA-MA outperform the others in terms of quality of solution and rate of convergence.

Cites

No record.

References

No record.

Cite

APA: Copy

REZAPOOR MIRSALEH, M., & MEYBODI, M.R.. (2015). A NEW CRITERION FOR BALANCING GLOBAL SEARCH AND LOCAL SEARCH IN MEMETIC ALGORITHM. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 13(1), 63-69. SID. https://sid.ir/paper/228429/en

Vancouver: Copy

REZAPOOR MIRSALEH M., MEYBODI M.R.. A NEW CRITERION FOR BALANCING GLOBAL SEARCH AND LOCAL SEARCH IN MEMETIC ALGORITHM. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2015;13(1):63-69. Available from: https://sid.ir/paper/228429/en

IEEE: Copy

M. REZAPOOR MIRSALEH, and M.R. MEYBODI, “A NEW CRITERION FOR BALANCING GLOBAL SEARCH AND LOCAL SEARCH IN MEMETIC ALGORITHM,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 13, no. 1, pp. 63–69, 2015, [Online]. Available: https://sid.ir/paper/228429/en

Related Journal Papers