Resumen de Deterministic Crowding in genetic algorithm to solve a real-scheduling problem: Part 2: Application
Mª Elena Pérez Vázquez, Ángel Manuel Gento Municio
The genetic algorithms (GAs) belong to the metaheuristics approaches, that is, they need to be adapted to the characteristics of the problem. In this work we will develop the realized implementation to solve a real and complex scheduling problem. Due to the high complexity, the problem has been mainly divided in three independent parts. For them, we will need to establish the parameters system of the GAs that direct the search. To prove the power and utility of the developed process we will analyze two practical instances that the enterprise had to solve by a previous method and the results obtained will be compared.
