Now showing items 1-10 of 297
Pareto or Non-Pareto: Bi-Criterion Evolution in Multi-Objective Optimization
It is known that Pareto dominance has its own weaknesses as the selection criterion in evolutionary multi-objective optimization. Algorithms based on Pareto dominance can suffer from slow convergence to the optimal front, ...
Adapting the pheromone evaporation rate in dynamic routing problems
An ant system with direct communication for the capacitated vehicle routing problem.
(University of Manchester., 2011)
In Silico Discovery of Significant Pathways in Colorectal Cancer Metastasis Using a Two-Stage Optimization Approach
Accurate and reliable modelling of protein-protein interaction networks for complex diseases such as colorectal cancer can help better understand mechanism of diseases and potentially discover new drugs. Different machine ...
A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems.
Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, ...
A memetic particle swarm optimization algorithm for multimodal optimization problems.
(Elsevier B.V., 2012)
Recently, multimodal optimization problems (MMOPs) have gained a lot of attention from the evolutionary algorithm (EA) community since many real-world applications are MMOPs and may require EAs to present multiple optimal ...
Guest editorial: memetic computing in the presence of uncertainties.
Hybrid meta-heuristic algorithms for independent job scheduling in grid computing
The term ’grid computing’ is used to describe an infrastructure that connects geographically distributed computers and heterogeneous platforms owned by multiple organizations allowing their computational power, storage ...
Adaptive crossover in genetic algorithms using statistics mechanism
(MIT Press, 2002)
Genetic Algorithms (GAs) emulate the natural evolution process and maintain a population of potential solutions to a given problem. Through the population, GAs implicitly maintain the statistics about the search space. ...