Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10609/92914
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Ferrer, Albert | - |
dc.contributor.author | Guimarans, Daniel | - |
dc.contributor.author | Ramalhinho Lourenco, Helena | - |
dc.contributor.author | Juan, Angel A. | - |
dc.contributor.other | Universitat Politècnica de Catalunya (UPC) | - |
dc.contributor.other | National ICT Australia | - |
dc.contributor.other | Universitat Pompeu Fabra | - |
dc.contributor.other | Universitat Oberta de Catalunya. Internet Interdisciplinary Institute (IN3) | - |
dc.date.accessioned | 2019-04-04T16:56:42Z | - |
dc.date.available | 2019-04-04T16:56:42Z | - |
dc.date.issued | 2016-02-01 | - |
dc.identifier.citation | Ferrer Biosca, A., Guimarans, D., Ramalhinho, H. & Juan, A.A. (2016). A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs. Expert Systems with Applications, 44(), 177-186. doi: 10.1016/j.eswa.2015.09.011 | - |
dc.identifier.issn | 0957-4174MIAR | - |
dc.identifier.other | 2-s2.0-84945298027 | - |
dc.identifier.uri | http://hdl.handle.net/10609/92914 | - |
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. | en |
dc.language.iso | eng | - |
dc.publisher | Expert Systems with Applications | - |
dc.relation.ispartof | Expert Systems with Applications, 2016, 44 | - |
dc.relation.uri | https://upcommons.upc.edu/bitstream/2117/81738/6/manuscript_fsp_review.pdf | - |
dc.rights | CC BY-NC-ND | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | - |
dc.subject | biased randomization | en |
dc.subject | heuristic algorithms | en |
dc.subject | algoritmos heurísticos | es |
dc.subject | algorismes heurístics | ca |
dc.subject | funciones objetivas uniformes | es |
dc.subject | funcions objectives uniformes | ca |
dc.subject | flow shop | ca |
dc.subject | flow shop | es |
dc.subject | flow shop | en |
dc.subject | scheduling | en |
dc.subject | programación | es |
dc.subject | programació | ca |
dc.subject | iterated local search | en |
dc.subject | búsqueda local iterada | es |
dc.subject | cerca local iterada | ca |
dc.subject | aleatorización sesgada | es |
dc.subject | aleatorització esbiaixada | ca |
dc.subject.lcsh | Computer algorithms | en |
dc.title | A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs | - |
dc.type | info:eu-repo/semantics/article | - |
dc.subject.lemac | Algorismes computacionals | ca |
dc.subject.lcshes | Algoritmos computacionales | es |
dc.identifier.doi | 10.1016/j.eswa.2015.09.011 | - |
dc.gir.id | AR/0000004945 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/MTM2011-29064-C03-02 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/MTM2014-59179-C2-01 | - |
dc.relation.projectID | info:eu-repo/grantAgreement/TRA2013-48180-C3-P | - |
Aparece en las colecciones: | Articles cientÍfics Articles |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
brils.pdf | 334,51 kB | Adobe PDF | Visualizar/Abrir |
Comparte:
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons