DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/16386

Arxiu Descripció MidaFormat
1319.pdf305,66 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Juan, A. [et al.]. "ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem". 2012.
Títol: ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem
Autor: Juan, Angel A.; Ramalhinho-Lourenço, Helena; Mateo Doll, Manuel Veure Producció científica UPC; Castellà, Quim; Barrios, Barry B.
Data: 29-feb-2012
Tipus de document: External research report
Citació: Working Paper 1319
Resum: From a managerial point of view, the more e cient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most e cient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can a ect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic ‘common sense’ rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate di erent alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.
URI: http://hdl.handle.net/2117/16386
Versió de l'editor: http://www.econ.upf.edu/docs/papers/downloads/1319.pdf
Apareix a les col·leccions:Altres. Enviament des de DRAC
EOLI - Enginyeria d´Organització i Logística Industrial. Reports de recerca
Departament d'Organització d'Empreses. Reports de recerca
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius