Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Dynamic tabu list management using the reverse elimination method
Annals of Operations Research - Special issue on Tabu search
The String-to-String Correction Problem
Journal of the ACM (JACM)
Intensification and diversification with elite tabu search solutions for the linear ordering problem
Computers and Operations Research
Scheduling using tabu search methods with intensification and diversification
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Using Genetic Algorithms with Small Populations
Proceedings of the 5th International Conference on Genetic Algorithms
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
INFORMS Journal on Computing
Distance measures based on the edit distance for permutation-type representations
Journal of Heuristics
A Memetic Algorithm with Population Management (MA|PM) for the Periodic Location-Routing Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
Computers and Operations Research
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
Transportation Science
Hi-index | 0.01 |
A new metaheuristic for (combinatorial) optimization is presented: memetic algorithms with population management or MA|PM. An MA|PM is a memetic algorithm, that combines local search and crossover operators, but its main distinguishing feature is the use of distance measures for population management. Population management strategies can be developed to dynamically control the diversity of a small population of high-quality individuals, thereby avoiding slow or premature convergence, and achieve excellent performance on hard combinatorial optimization problems. The new algorithm is tested on two problems: the multidimensional knapsack problem and the weighted tardiness single-machine scheduling problem. On both problems, population management is shown to be able to improve the performance of a similar memetic algorithm without population management.