Results 161 to 170 of about 3,843 (214)
Optimization of multiple sampling for solving network boundary specification problem. [PDF]
Sci RepZhang R.
europepmc +1 more source
Stable approach based diagonal recurrent quantum neural networks for identification of nonlinear systems. [PDF]
Sci RepKhalil H, Elshazly O, Shaheen O.
europepmc +1 more source
Energy-efficient scheduling of AGV-assisted robotic flexible flowshops under learning and processing time uncertainty. [PDF]
Sci RepDehnavi S, Mokhtari H, Rezvan MT.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2016
Memetic algorithms provide one of the most effective and flexible metaheuristic approaches for tackling hard optimization problems. Memetic algorithms address the difficulty of developing high-performance universal heuristics by encouraging the exploitation of multiple heuristics acting in concert, making use of all available sources of information for
Cotta, Carlos +2 more
+4 more sources
Memetic algorithms provide one of the most effective and flexible metaheuristic approaches for tackling hard optimization problems. Memetic algorithms address the difficulty of developing high-performance universal heuristics by encouraging the exploitation of multiple heuristics acting in concert, making use of all available sources of information for
Cotta, Carlos +2 more
+4 more sources
A differential memetic algorithm
Artificial Intelligence Review, 2012Memetic algorithms have been devised to rectify the absence of a local search mechanism in evolutionary algorithms. This paper proposes a differential memetic algorithm (DMA). To this end, first we propose a differential bidirectional random search as a local search algorithm.
Mohammad-Taghi Vakil-Baghmisheh +1 more
openaire +1 more source
Memetic algorithms for timetabling
The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004Course timetabling problems are real world constraint optimization problems that are often coped with educational institutions, such as universities or high schools. In this paper, we present a variety of new operators that can be also applied in evolutionary algorithms for other timetabling problems, such as, exam timetabling.
Alpay Alkan, Ender Özcan
openaire +1 more source
Adaptive Cellular Memetic Algorithms
Evolutionary Computation, 2009A cellular genetic algorithm (CGA) is a decentralized form of GA where individuals in a population are usually arranged in a 2D grid and interactions among individuals are restricted to a set neighborhood. In this paper, we extend the notion of cellularity to memetic algorithms (MA), a configuration termed cellular memetic algorithm (CMA). In addition,
Quang Huy Nguyen 0001 +3 more
openaire +2 more sources
2007
The term memetic algorithms (MAs) was introduced in the late 1980s to denote a family of metaheuristics that have as central theme the hybridization of different algorithmic approaches for a given problem. Special emphasis was given to the use of a population-based approach in which a set of cooperating and competing agents was engaged in periods of ...
Moscato, Pablo, Cotta, Carlos
openaire +2 more sources
The term memetic algorithms (MAs) was introduced in the late 1980s to denote a family of metaheuristics that have as central theme the hybridization of different algorithmic approaches for a given problem. Special emphasis was given to the use of a population-based approach in which a set of cooperating and competing agents was engaged in periods of ...
Moscato, Pablo, Cotta, Carlos
openaire +2 more sources
1994
A formal, representation-independent form of a memetic algorithm—a genetic algorithm incorporating local search—is introduced. A generalised form of N-point crossover is defined together with representation-independentpatching and hill-climbing operators.
Nicholas J. Radcliffe, Patrick D. Surry
openaire +1 more source
A formal, representation-independent form of a memetic algorithm—a genetic algorithm incorporating local search—is introduced. A generalised form of N-point crossover is defined together with representation-independentpatching and hill-climbing operators.
Nicholas J. Radcliffe, Patrick D. Surry
openaire +1 more source