Results 151 to 160 of about 14,432 (202)
Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. [PDF]
Sci AdvShaydulin R +28 more
europepmc +1 more source
Research on joint vehicle routing optimization considering multiple distribution centers. [PDF]
PLoS OneLiu D, Li M, Lei Y, Yu P, Li B, Tang S.
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
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
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,
Nguyen Quang, Huy +3 more
openaire +2 more sources
Interval Multiobjective Optimization With Memetic Algorithms
IEEE Transactions on Cybernetics, 2020One of the most important and widely faced optimization problems in real applications is the interval multiobjective optimization problems (IMOPs). The state-of-the-art evolutionary algorithms (EAs) for IMOPs (IMOEAs) need a great deal of objective function evaluations to find a final Pareto front with good convergence and even distribution.
Jing Sun +5 more
openaire +2 more sources
Bioinspired Multi-memetic Algorithm
2021The paper considers a multi-memetic ant algorithm of discrete optimization. An algorithm has been developed for choosing and appropriate strategies for using a meme from a swarm of available memes. The work of multi-memetic ant algorithm of discrete optimization is illustrated by the example of a partition problem, which is widely used in solving ...
Boris K. Lebedev +2 more
openaire +1 more source
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.
M. T. Vakil-Baghmisheh +1 more
openaire +1 more source