| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8050625 | Revista Iberoamericana de Automática e Informática Industrial RIAI | 2016 | 8 Pages |
Abstract
In this paper we proposed a solution to the Job-Shop Scheduling Problem using the Traveling Salesman Problem solved by Genetic Algorithms. We proposed a genetic algorithm where we compare two types of selection: tournament and roulette. Different tests are performed to solve the Traveling Salesman Problem with the two types of selection under different parameters: number of individuals, number of iterations, crossover probability and mutation probability. Then the best type of selection and the best parameters are used to solve the Job-Shop Scheduling Problem with Genetic Algorithms for the Traveling Salesman Problem. The proposal is presented solving different examples of Job Sequencing Problem and compare them with the results obtained in the literature.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
G.E. Anaya Fuentes, E.S. Hernández Gress, J.C. Seck Tuoh Mora, J. Medina MarÃn,