A Gentle Introduction to Memetic Algorithms

DOI10.1007/0-306-48056-5_5zbMATH Open1107.90459OpenAlexW27366642MaRDI QIDQ4452894FDOQ4452894

Carlos Cotta, Pablo Moscato

Publication date: 7 March 2004

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-306-48056-5_5

Recommendations

• scientific article; zbMATH DE number 2159378
• Memetic algorithms
• Memetic algorithms
• Memetic evolutionary algorithms
• scientific article; zbMATH DE number 1754719

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (59)

• An effective hybrid evolutionary algorithm for the clustered orienteering problem
• Solving a real-life multi-skill resource-constrained multi-project scheduling problem
• Adaptive multimeme algorithm for flexible job shop scheduling problem
• A linear ordering problem with weighted rank
• Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
• Repulsive assignment problem
• Title not available (Why is that?)
• Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis
• Solving the edge‐disjoint paths problem using a two‐stage method
• The \(k\)-feature set problem is \(W[2]\)-complete
• Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
• Memetic algorithms
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• A review of hyper-heuristics for educational timetabling
• The service allocation problem at the Gioia Tauro maritime terminal
• Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
• Speeding up a memetic algorithm for the max-bisection problem
• Heuristic search to the capacitated clustering problem
• A three-phased local search approach for the clique partitioning problem
• A memetic algorithm for the minimum sum coloring problem
• Title not available (Why is that?)
• Exact and approximate algorithms for variable selection in linear discriminant analysis
• Memetic algorithms for parallel code optimization
• Operational research in education
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• Industrial aspects and literature survey: fleet composition and routing
• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
• A hybrid metaheuristic approach for the capacitated arc routing problem
• Energy-oriented scheduling based on evolutionary algorithms
• Using and extending fix-and-relax to solve maritime inventory routing problems
• A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
• Analysis of new variable selection methods for discriminant analysis
• A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM
• Title not available (Why is that?)
• Iterative patching and the asymmetric traveling salesman problem
• Coupling a memetic algorithm to simulation models for promising multi-period asset allocations
• Memetic search for the max-bisection problem
• The robust set covering problem with interval data
• Region based memetic algorithm for real-parameter optimisation
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
• A tabu search based memetic algorithm for the Max-Mean dispersion problem
• FEMOEA: a fast and efficient multi-objective evolutionary algorithm
• A study on the use of ``self-generation in memetic algorithms
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants
• Recent advances in memetic algorithms.
• Industrial aspects and literature survey: Combined inventory management and routing
• A dynamic over-sampling procedure based on sensitivity for multi-class problems
• Hybridizations of Metaheuristics With Branch & Bound Derivates
• Scatter search with path relinking for phylogenetic inference
• Hybrid evolutionary search for the minimum sum coloring problem of graphs
• A memetic algorithm for bi-objective integrated forward/reverse logistics network design
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• Evolutionary optimization: pitfalls and booby traps
• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
• Local search-based hybrid algorithms for finding Golomb rulers

This page was built for publication: A Gentle Introduction to Memetic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452894)