An effective hybrid optimization strategy for job-shop scheduling problems

An effective hybrid optimization strategy for job-shop scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor20013898
Country: United Kingdom
Volume: 28
Issue: 6
Start Page Number: 585
End Page Number: 596
Publication Date: May 2001
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics, optimization: simulated annealing
Abstract:

Simulated annealing is a naturally serial algorithm, but its behavior can be controlled by the cooling schedule. Genetic algorithm exhibits implicit parallelism and can retain useful redundant information about what is learned from previous searches by its representation in individuals in the population, but GA may lose solutions and substructures due to the disruptive effects of genetic operators and it is not easy to regulate GA's convergence. By reasonably combining these two global probabilistic search algorithms, we develop a general, parallel and easily implemented hybrid optimization framework, and apply it to job-shop scheduling problems. Based on effective encoding scheme and some specific optimization operators, some benchmark job-shop scheduling problems are well solved by the hybrid optimization strategy, and the results are competitive with the best literature results. Besides the effectiveness and robustness of the hybrid strategy, the combination of different search mechanisms and structures can relax the parameter-dependence of GA and SA.

Reviews

Required fields are marked *. Your email address will not be published.