Topic
Memetic Algorithms (opens in a new tab)
Ask This Paper
BETA
AI-Powered
Ask This Paper
BETA
AI-Powered
Unknown Error
An unexpected error occurred. Please try again.
No Answer Found
Ask another question that can be answered by this paper or rephrase your question.
We are still processing this paper
Please try again later.
Question Answering Unavailable
Please try again later.
No Response
The server took too long to answer your question. You can either rephrase your question or wait until it is less busy.
AI-Generated
Thank you for your feedback!
We're sorry, something went wrong while submitting this feedback.
Thank you for your feedback!
We're sorry, something went wrong while submitting this feedback.
Our system tries to constrain to information found in this paper. Results quality may vary. Learn more about how we generate these answers.
Feedback?
25 Citations
- Adan E. Aguilar-JustoE. Mezura-MontesC. Coello
- 2014
Computer Science, Engineering
2014 IEEE International Autumn Meeting on Power…
The memetic approach combining the Modified Artificial Bee Colony algorithm and the Hooke-Jeeves method to improve its performance to solve constrained numerical optimization problems outperforms those of the compared algorithms.
- 4
- PDF
- Rajiv KumarMinakshi Memoria
- 2020
Computer Science, Mathematics
Different types of selection techniques have been considered for the study and steady state selection technique shows better results than the existing selection operator.
- 6
- PDF
- J. I. PeláezJ. A. Gómez-RuizJ. VeintimillaGustavo F. VaccaroP. Witt
- 2017
Materials Science, Engineering
A memetic algorithm has been designed and compared with the main heuristics used in the design of laminated polymers in different scenarios to show that more effective and dynamic methods are obtained by using certain techniques based on systematic exploitation of knowledge of the problem.
- Y. Martínez-LópezRafael Falcón-Martínez
- 2013
Computer Science
This article is the development of a design for finding a configuration of the input vector to the work with the associative neural network.
- Marco Antonio Cruz ChávezOcotlán Díaz Parra
- 2010
Computer Science, Engineering
The results of MA demonstrate that the use of Constraints Satisfaction Technique permits MA to work more efficiently in the VRPTW.
- 4
- PDF
- Natalia PalomaresRony CuevaM. TupiaM. Bruzza
- 2020
Engineering, Environmental Science
ICAART
In present investigation, and based on previous works of the authors, a memetic algorithm is presented for optimization in the loading of kilns starting from a real production line.
- PDF
- Yenny Noa VargasStephen Y. Chen
- 2010
Computer Science, Engineering
MICAI
Two new techniques are introduced for particle swarm optimization: "resets" increase exploitation and "delayed updates" increase exploration, which helps more with the lbest topology which is moreExploration and exploitation are two important factors in the design of optimization techniques.
- 11
- M. DelgadoM. P. CuéllarMaria del Carmen Pegalajar Jiménez
- 2008
Computer Science
IEEE Transactions on Systems, Man, and…
This paper addresses the simultaneous training and topology optimization of RNNs using multiobjective hybrid procedures using the Baldwinian hybridization strategy and studies the effects of the selection of the objectives, crossover, and mutation in the diversity during evolution.
- 52
- Hossam M. J. MustafaM. AyobHisham A. ShehadehSawsan Abu-Taleb
- 2022
Computer Science
Neural Computing and Applications
The proposed multi-objective memetic differential evolution algorithm (MOMDE) for text clustering combines memetic and differential evolution algorithms to improve the search for optimal clustering by improving the balance between exploitation and exploration.
- 1
- L. A. D. SilveiraJ. L. Soncco-ÁlvarezM. Ayala-Rincón
- 2016
Computer Science
2016 IEEE Congress on Evolutionary Computation…
Two parallel treatments of the sequential memetic approach are introduced for solving the translocation distance problem for unsigned genomes and results show that the parallel approaches outperform the sequential Memetic algorithm.
- 7
- PDF
...
...
136 References
- P. MerzBernd Freisleben
- 1999
Computer Science, Mathematics
Proceedings of the 1999 Congress on Evolutionary…
A comparison of the proposed memetic algorithm with some of the currently best alternative approaches-reactive tabu search, robusttabu search and the fast ant colony system-demonstrates that the MA outperforms its competitors on all studied problem instances of practical interest.
- 184
- PDF
- Joshua D. KnowlesD. Corne
- 2000
Computer Science, Mathematics
Proceedings of the 2000 Congress on Evolutionary…
A memetic algorithm for tackling multiobjective optimization problems is presented. The algorithm employs the proven local search strategy used in the Pareto archived evolution strategy (PAES) and…
- 396
- PDF
- S. AreibiM. MoussaHussein A. Abdullah
- 2001
Computer Science, Engineering
This paper compares the performance of several constuctive based techniques for the circuit partitioning problem with the aim of determining the most robust and simple heuristics.
- 33
- E. BurkeAlistair J. Smith
- 1997
Computer Science, Engineering
ICONIP
The memetic algorithm presented here is essentially a genetic algorithm with an element of local search and the effectiveness of the method is tested through its application to real scale problems.
- 36
- C. CottaJ. M. Troya
- 1997
Computer Science
ICANNGA
A hybrid genetic algorithm based in local search is described, which exhibits a better overall performance in both cases when compared with other GA-based approaches and an exact technique.
- 102
- PDF
- Daniel Costa
- 1995
Engineering, Computer Science
The hybrid method developed in this paper is well suited for Open Shop Scheduling problems (OSSP), and the results obtained appear to be quite satisfactory.
- 134
- Peng We
- 1999
Computer Science
A new hybrid algorithm that incorporates the flexible polyhedron method into the orthogonal genetic algorithm (OGA) is presented in this paper and can achieve better performance by performing global search and local search alternately.
- 13
- P. Merz
- 2002
Computer Science
GECCO
A new generic recombination operator (GX) is proposed which is comprised of four phases which can be controlled by parameters reflecting the most important properties of recombination operators.
- 20
- PDF
- N. J. RadcliffePatrick D. Surry
- 1994
Computer Science
Evolutionary Computing, AISB Workshop
A formal, representation-independent form of a memetic algorithm—a genetic algorithm incorporating local search—is introduced, and the memetic algorithms performed very well on the travelling sales-rep problem.
- 262
- PDF
- P. ChuJ. Beasley
- 1998
Computer Science, Mathematics
J. Heuristics
A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach and is capable of obtaining high-quality solutions for problems of various characteristics.
- 870
...
...
Related Papers
Showing 1 through 3 of 0 Related Papers