Skip to main content
Journal Article

Hybridizing a genetic algorithm with local search and heuristic seeding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2687 329-336
DOI: 10.1007/3-540-44869-1_42
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We confront scheduling problems by means of a Genetic Algorithm that is hybridized with a local search method and specialized for a family of problems by seeding with heuristic knowledge. We also report experimental results that demonstrate the effect of both strategies on the GA performance. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Puente, J., Vela, C. R., Prieto, C., & Varela, R. (2003). Hybridizing a genetic algorithm with local search and heuristic seeding. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2687, 329–336. https://doi.org/10.1007/3-540-44869-1_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free