Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Jérémie Dubois-Lacoste"'
Autor:
Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, Thomas Stützle
Publikováno v:
Operations Research Perspectives, Vol 3, Iss C, Pp 43-58 (2016)
Modern optimization algorithms typically require the setting of a large number of parameters to optimize their performance. The immediate goal of automatic algorithm configuration is to find, automatically, the best parameter settings of an optimizer
Externí odkaz:
https://doaj.org/article/36bc1e6a0c7645afb2917fd3a325a6f7
Publikováno v:
Computers & Operations Research. 81:160-166
We present a new iterated greedy algorithm for the permutation flowshop problem under makespan objective.Our algorithm applies local search on partial solutions after the destruction phase.Our algorithm compares favorably with others from the literat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a30e5f58d8a9b1f148457061b6969ca
https://doi.org/10.1016/j.cor.2016.12.021
https://doi.org/10.1016/j.cor.2016.12.021
Autor:
Mauro Birattari, Leslie Pérez Cáceres, Thomas Stützle, Jérémie Dubois-Lacoste, Manuel López-Ibáñez
Publikováno v:
Lopez-Ibanez, M, Dubois-Lacoste, J, Cáceres, L P, Birattari, M & Stützle, T 2016, ' The irace Package: Iterated Racing for Automatic Algorithm Configuration ', Operations Research Perspectives, vol. 3, no. 0, pp. 43-58 . https://doi.org/10.1016/j.orp.2016.09.002
Operations Research Perspectives, 3
Operations Research Perspectives, Vol 3, Iss C, Pp 43-58 (2016)
Operations Research Perspectives, 3
Operations Research Perspectives, Vol 3, Iss C, Pp 43-58 (2016)
Modern optimization algorithms typically require the setting of a large number of parameters to optimize their performance. The immediate goal of automatic algorithm configuration is to find, automatically, the best parameter settings of an optimizer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8dda1e58faf8cfe11469caf77470d2f
Publikováno v:
Journal of Heuristics, 24(6), 879-898
Journal of Heuristics
Journal of Heuristics
We study the empirical scaling of the running time required by state-of-the-art exact and inexact TSP algorithms for finding optimal solutions to Euclidean TSP instances as a function of instance size. In particular, we use a recently introduced stat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e6842dfa7b1f8ae87173f26fc51952c
http://hdl.handle.net/1887/69747
http://hdl.handle.net/1887/69747
Publikováno v:
Dubois-Lacoste, J, López-Ibáñez, M & Stützle, T 2015, ' Anytime Pareto local search ', European Journal of Operational Research, vol. 243, no. 2, pp. 369-385 . https://doi.org/10.1016/j.ejor.2014.10.062
European journal of operational research
European journal of operational research
Pareto Local Search (PLS) is a simple and effective local search method for tackling multi-objective combinatorial optimization problems. It is also a crucial component of many state-of-the-art algorithms for such problems. However, PLS may be not ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::077ca28befa35c4f1169e7179be6a316
https://doi.org/10.1016/j.ejor.2014.10.062
https://doi.org/10.1016/j.ejor.2014.10.062
Autor:
Jérémie Dubois-Lacoste, Thomas Stützle
Publikováno v:
CEC
In this paper, we present results on the automatic tuning of an adaptive traffic light controller. The traffic light controller is inspired by some swarm intelligence techniques and uses numerical values that are adapted by the principles of stigmerg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::802e40449753c7c5c2e3ed2642e67a80
https://doi.org/10.1109/cec.2017.7969288
https://doi.org/10.1109/cec.2017.7969288
Publikováno v:
Mascia, F, López-Ibáñez, M, Dubois-Lacoste, J & Stützle, T 2014, ' Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools ', Computers and Operations Research, vol. 51, pp. 190-199 . https://doi.org/10.1016/j.cor.2014.05.020
Several grammar-based genetic programming algorithms have been proposed in the literature to automatically generate heuristics for hard optimization problems. These approaches specify the algorithmic building blocks and the way in which they can be c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03b7d0a421d4de3a460438128f047c30
https://doi.org/10.1016/j.cor.2014.05.020
https://doi.org/10.1016/j.cor.2014.05.020
Autor:
Jérémie Dubois-Lacoste, Thomas Stützle
Publikováno v:
GECCO (Companion)
Effective traffic light control algorithms are of central importance for reducing congestion. While the currently most effective algorithms rely on expensive infrastructure to obtain knowledge of the traffic state, within the COLOMBO project, low-cos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38ae72c8760b4b4441a02c018a925fe9
https://doi.org/10.1145/2908961.2909054
https://doi.org/10.1145/2908961.2909054
Publikováno v:
Computers & operations research, 38 (8
This paper presents a new, carefully designed algorithm for five bi-objective permutation flow shop scheduling problems that arise from the pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b44bcd0540b4462026215c1fda99d21e
https://doi.org/10.1016/j.cor.2010.10.008
https://doi.org/10.1016/j.cor.2010.10.008
Publikováno v:
Annals of mathematics and artificial intelligence, 61 (12
Algorithms based on the two-phase local search (TPLS) framework are a powerful method to efficiently tackle multi-objective combinatorial optimization problems. TPLS algorithms solve a sequence of scalarizations, that is, weighted sum aggregations, o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e27f345abf2fde8b7a9652bcd519fcf
https://doi.org/10.1007/s10472-011-9235-0
https://doi.org/10.1007/s10472-011-9235-0