Paralelismo e hibridización en un algoritmo de evolución diferencial para resolver el problema de planificación job shop flexible

dc.creatorMorero, Franco
dc.creatorBermúdez, Carlos
dc.creatorSalto, Carolina
dc.date2020-05
dc.date2020-06-01T15:59:51Z
dc.date.accessioned2023-07-14T20:30:33Z
dc.date.available2023-07-14T20:30:33Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/97202
dc.identifierissn:1666-6038
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7439515
dc.descriptionThe Flexible Job Shop Scheduling Problem (FJSSP) is one of the most challenging combinatorial optimization problems, with practical applicability in a real production environment. In this work, we propose a simple Differential Evolution (DE) algorithm to tackle this problem. To represent a FJSSP solution, a real value representation is adopted, which requires a very simple conversion mechanism to obtain a feasible schedule. Consequently, the DE algorithm still works on the continuous domain to explore the problem search space of the discrete FJSSP. Moreover, to enhance the local search ability and to balance the exploration and exploitation capabilities, a simple local search algorithm is embedded in the DE framework. Also, the parallelism of the DE operations is included to improve the efficiency of the whole algorithm. Experimental results confirm the significant improvement achieved by integrating the modifications introduced in this study. Additionally, test results show that our algorithm is competitive when compared with most existing approaches for FJSSP.
dc.descriptionFacultad de Informática
dc.formatapplication/pdf
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc/4.0/
dc.rightsCreative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
dc.subjectCiencias Informáticas
dc.subjectDifferential evolution
dc.subjectFlexible job shop scheduling
dc.subjectParallelism
dc.subjectEvolución diferencial
dc.subjectParalelismo
dc.subjectPlanificación de trabajos
dc.titleParallelism and Hybridization in Differential Evolution to solve the Flexible Job Shop Scheduling Problem
dc.titleParalelismo e hibridización en un algoritmo de evolución diferencial para resolver el problema de planificación job shop flexible
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución