Skip to Main content Skip to Navigation
Conference papers

Algorithm comparison by automatically configurable stochastic local search frameworks: a case study using flow-shop scheduling problems

Abstract : The benefits of hybrid stochastic local search (SLS) methods, in comparison with more classical (non-hybrid) ones are often difficult to quantify, since one has to take into account not only the final results obtained but also the effort spent on finding the best configuration of the hybrid and of the classical SLS method. In this paper, we study this trade-off by means of tools for automatic algorithm design, and, in particular, we study the generation of hybrid SLS algorithms versus selecting one classical SLS method among several. In addition, we tune the parameters of the classical SLS method separately and compare the results with the ones obtained when selection and tuning are done at the same time. We carry out experiments on two variants of the permutation flowshop scheduling problem that consider the minimization of weighted sum of completion times (PFSP-WCT) and the minimization of weighted tardiness (PFSP-WCT). Our results indicate that the hybrid algorithms we instantiate are able to match and improve over the best classical SLS method.
Complete list of metadatas

https://hal.inria.fr/hal-01094683
Contributor : Marie-Eléonore Kessaci <>
Submitted on : Friday, December 12, 2014 - 5:16:55 PM
Last modification on : Thursday, June 4, 2020 - 10:24:07 AM

Identifiers

Citation

Franco Mascia, Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Marie-Eléonore Marmion, Thomas Stützle. Algorithm comparison by automatically configurable stochastic local search frameworks: a case study using flow-shop scheduling problems. HM 2014 - 9th International Workshop Hybrid Metaheuristics , Jun 2014, Hamburg, Germany. pp.30-44, ⟨10.1007/978-3-319-07644-7_3⟩. ⟨hal-01094683⟩

Share

Metrics

Record views

216