论文信息 - Hybridizing a Genetic Algorithm with Local Search and Heuristic Seeding

Hybridizing a Genetic Algorithm with Local Search and Heuristic Seeding

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.

Carlos Prieto | Jorge Puente | Camino R. Vela | Ramiro Varela

[1] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .

[2] C. Bierwirth. A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[3] Jorge Puente,et al. Initialization in Genetic Algorithms for Constraint Satisfaction Problems , 2001, IWANN.

[4] Alberto Gómez,et al. A knowledge-based evolutionary strategy for scheduling problems with bottlenecks , 2003, Eur. J. Oper. Res..

[5] Norman M. Sadeh,et al. Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[6] Dirk C. Mattfeld,et al. Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

[7] Christian Bierwirth,et al. Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[8] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .