Deterministic Crowding in genetic algorithm to solve a real-scheduling problem: Part 2: Application

Pérez Vázquez, Mª Elena; Gento Municio, Ángel Manuel

Deterministic Crowding in genetic algorithm to solve a real-scheduling problemPart 2: Application

Libro:

Cruzando fronteras : tendencias de contabilidad directiva para el siglo XXI: actas VII Congreso Internacional de Costos y II Congreso de la Asociación Española de Contabilidad Directiva.

Editorial: Servicio de Publicaciones ; Universidad de León

ISBN: 84-7719-952-3

Ano de publicación: 2001

Páxinas: 335

Congreso: Instituto Internacional de Costos. Congreso (7. 2001. León)

Tipo: Achega congreso

DIALNET GOOGLE SCHOLAR

Resumo

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.

Fonte de datos: Dialnet