To access the full text documents, please follow this link: http://hdl.handle.net/2117/81738
dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
dc.contributor.author | Ferrer Biosca, Alberto |
dc.contributor.author | Guimarans, Daniel |
dc.contributor.author | Ramalhinho Lourenço, Helena |
dc.contributor.author | Juan Pérez, Ángel Alejandro |
dc.date | 2016-02-01 |
dc.identifier.citation | Ferrer, A., Guimarans, D., Ramalhino , H., Juan, Á. A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs. "Expert systems with applications", 01 Febrer 2016, vol. 44, p. 177-186. |
dc.identifier.citation | 0957-4174 |
dc.identifier.citation | 10.1016/j.eswa.2015.09.011 |
dc.identifier.uri | http://hdl.handle.net/2117/81738 |
dc.description.abstract | This paper analyzes a realistic variant of the Permutation Flow-Shop Problem (PFSP) by considering a non-smooth objective function that takes into account not only the traditional makespan cost but also failure-risk costs due to uninterrupted operation of machines. After completing a literature review on the issue, the paper formulates an original mathematical model to describe this new PFSP variant. Then, a Biased-Randomized Iterated Local Search (BRILS) algorithm is proposed as an efficient solving approach. An oriented (biased) random behavior is introduced in the well-known NEH heuristic to generate an initial solution. From this initial solution, the algorithm is able to generate a large number of alternative good solutions without requiring a complex setting of parameters. The relative simplicity of our approach is particularly useful in the presence of non-smooth objective functions, for which exact optimization methods may fail to reach their full potential. The gains of considering failure-risk costs during the exploration of the solution space are analyzed throughout a series of computational experiments. To promote reproducibility, these experiments are based on a set of traditional benchmark instances. Moreover, the performance of the proposed algorithm is compared against other state-of-the-art metaheuristic approaches, which have been conveniently adapted to consider failure-risk costs during the solving process. The proposed BRILS approach can be easily extended to other combinatorial optimization problems with similar non-smooth objective functions. |
dc.description.abstract | Peer Reviewed |
dc.language.iso | eng |
dc.rights | info:eu-repo/semantics/openAccess |
dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra |
dc.subject | Algorithms |
dc.subject | Heuristic algorithms |
dc.subject | Biased randomization |
dc.subject | Iterated Local Search |
dc.subject | Scheduling |
dc.subject | Flow-shop |
dc.subject | Non-smooth objective functions |
dc.subject | Algorismes |
dc.title | A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |