MA|PM: memetic algorithms with population management
- 31 May 2006
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 33 (5), 1214-1225
- https://doi.org/10.1016/j.cor.2004.09.011
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release datesEuropean Journal of Operational Research, 2004
- Guidelines for the use of meta-heuristics in combinatorial optimizationEuropean Journal of Operational Research, 2003
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 2002
- Scheduling using tabu search methods with intensification and diversificationComputers & Operations Research, 2001
- Intensification and diversification with elite tabu search solutions for the linear ordering problemComputers & Operations Research, 1999
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 1998
- Feature Article—Genetic Algorithms for the Operations ResearcherINFORMS Journal on Computing, 1997
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total TardinessPublished by Elsevier BV ,1977
- The String-to-String Correction ProblemJournal of the ACM, 1974