Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem

Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20081710
Country: United Kingdom
Volume: 39
Issue: 1
Start Page Number: 69
End Page Number: 85
Publication Date: Jan 2007
Journal: Engineering Optimization
Authors: , ,
Keywords: manufacturing industries, heuristics: genetic algorithms
Abstract:

In this work, an approach for solving the job shop scheduling problem using a cultural algorithm is proposed. Cultural algorithms are evolutionary computation methods that extract domain knowledge during the evolutionary process. Additional to this extracted knowledge, the proposed approach also uses domain knowledge given a priori (based on specific domain knowledge available for the job shop scheduling problem). The proposed approach is compared with respect to a Greedy Randomized Adaptive Search Procedure (GRASP), a Parallel GRASP, a Genetic Algorithm, a Hybrid Genetic Algorithm, and a deterministic method called shifting bottleneck. The cultural algorithm proposed in this article is able to produce competitive results with respect to the two approaches previously indicated at a significantly lower computational cost than at least one of them and without using any sort of parallel processing.

Reviews

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