A Gentle Introduction to Memetic Algorithms

DOI10.1007/0-306-48056-5_5zbMath1107.90459OpenAlexW27366642MaRDI QIDQ4452894

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

Mathematics Subject Classification ID

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

Related Items (49)

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

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