Buscar en RiuNet

Listar

Mostrando ítems 1-3 de 3

A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times

Juan, Angel A.; Barrios, Barry B.; Vallada Regalado, Eva; Riera, Daniel; Jorba, Josep (Elsevier, 2014-08)

This paper describes a simulation optimization algorithm for the Permutation Flow shop Problem with Stochastic processing Times (PFSPST). The proposed algorithm combines Monte Carlo simulation with an Iterated Local ...
Application of Genetic Algorithms for the Optimization of Combinatorial Problems

Martí Gimeno, Pasqual (Universitat Politècnica de València, 2019-09-09)

[EN] Genetic algorithms (GA) are a good technique for obtaining near-optimal solutions to problems with no known strategy, saving computational power. However, without the adequate configuration of parameters, a GA will ...
Un algoritmo secuencial, aleatorio y óptimo para problemas de factibilidad robusta

Álamo, T.; Tempo, R.; Ramírez, D.R.; Luque, A.; Camacho, E.F. (Universitat Politècnica de València, 2013-01-13)

[ES] En este trabajo (del cual se presentó una versión preliminar en Alamo et al. (2007)) se propone un algoritmo aleatorio para determinar la factibilidad robusta de un conjunto de desigualdades lineales matriciales (Linear ...

Mostrando ítems 1-3 de 3