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

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

Marc Sevaux, Kenneth Sörensen

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 algorithmpopulation managementdiversificationdistance measures

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (26)

Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ A memetic algorithm with dynamic population management for an integrated production-distribution problem ⋮ A memetic algorithm for the travelling salesperson problem with hotel selection ⋮ The production routing problem: a review of formulations and solution algorithms ⋮ The close-open mixed vehicle routing problem ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ Optimization of a two-echelon location lot-sizing routing problem with deterministic demand ⋮ Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics ⋮ Coordination of production planning and distribution ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ TABU SEARCH FOR MULTIPROCESSOR SCHEDULING: APPLICATION TO HIGH LEVEL SYNTHESIS ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem ⋮ A diversification operator for genetic algorithms ⋮ Human urbanization algorithm: a novel metaheuristic approach ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ 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 ⋮ Chaotic catfish particle swarm optimization for solving global numerical optimization problems ⋮ Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor Backend facility ⋮ A memetic algorithm for the orienteering problem with hotel selection ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints ⋮ 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 ⋮ Speeding up a memetic algorithm for the max-bisection problem ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

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

This page was built for publication: \(\text{MA}\mid\text{PM}\): memetic algorithms with population management