dc.creatorFrutos, Mariano
dc.creatorTohmé, Fernando Abel
dc.date.accessioned2018-06-12T22:39:48Z
dc.date.accessioned2018-11-06T16:19:04Z
dc.date.available2018-06-12T22:39:48Z
dc.date.available2018-11-06T16:19:04Z
dc.date.created2018-06-12T22:39:48Z
dc.date.issued2015-04
dc.identifierFrutos, Mariano; Tohmé, Fernando Abel; Choice of a PISA selector in a hybrid algorithmic structure for the FJSSP; Growing Science; Decision Science Letters; 4; 2; 4-2015; 247-260
dc.identifier1929-5804
dc.identifierhttp://hdl.handle.net/11336/48487
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1906930
dc.description.abstractThis paper analyzes the choice of a PISA selector for a Hybrid Algorithm integrating it as a MultiObjective Evolutionary Algorithm (MOEA) with a path-dependent search algorithm. The interaction between these components provides an efficient procedure for solving Multi-Objective Problems (MOPs) in operations scheduling. In order to choose the selector, we consider both NSGA and SPEA as well as their successors (NSGAII and SPEAII). NSGAII and SPEAII are shown to be the most efficient candidates. On the other hand, for the path-dependent search at the end of each evolutionary phase we use the multi-objective version of Simulated Annealing.
dc.languageeng
dc.publisherGrowing Science
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://dx.doi.org/10.5267/j.dsl.2014.11.001
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://www.growingscience.com/dsl/Vol4/dsl_2014_40.pdf
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectFlexible Job-Shop Scheduling Problem
dc.subjectPISA Selector
dc.subjectMulti-Objective Hybrid Evolutionary Algorithm
dc.titleChoice of a PISA selector in a hybrid algorithmic structure for the FJSSP
dc.typeArtículos de revistas
dc.typeArtículos de revistas
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución