\(\text{MA}\mid\text{PM}\): memetic algorithms with population management

DOI10.1016/j.cor.2004.09.011zbMath1126.90081MaRDI QIDQ2496020

Kenneth Sörensen, Marc Sevaux

Publication date: 30 June 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.011

zbMATH Keywords

memetic algorithm; population management; diversification; distance measures

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

A hybrid evolutionary algorithm for the periodic location-routing problem, Chaotic catfish particle swarm optimization for solving global numerical optimization problems, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Coordination of production planning and distribution, A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Experiments concerning sequential versus simultaneous maximization of objective function and distance, A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling, The close-open mixed vehicle routing problem, A memetic algorithm with dynamic population management for an integrated production-distribution problem, TABU SEARCH FOR MULTIPROCESSOR SCHEDULING: APPLICATION TO HIGH LEVEL SYNTHESIS, Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• A genetic algorithm for the multidimensional knapsack problem
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• Dynamic tabu list management using the reverse elimination method
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Finding approximate patterns in strings
• Feature Article—Genetic Algorithms for the Operations Researcher
• The String-to-String Correction Problem
• Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
• Scheduling using tabu search methods with intensification and diversification