Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Adrien Goëffon"'
Publikováno v:
Natural Computing
Natural Computing, Springer Verlag, 2020, ⟨10.1007/s11047-020-09822-2⟩
Natural Computing, Springer Verlag, 2020, ⟨10.1007/s11047-020-09822-2⟩
A major issue while conceiving or parameterizing an optimization heuristic is to ensure an appropriate balance between exploitation and exploration of the search. Evolution strategies and neighborhood-based metaheuristics constitute relevant high-lev
Publikováno v:
International Transactions in Operational Research
International Transactions in Operational Research, Wiley, 2021, 20 (3), pp.345-361. ⟨10.1111/itor.12906⟩
International Transactions in Operational Research, Wiley, 2021, 20 (3), pp.345-361. ⟨10.1111/itor.12906⟩
International audience
Publikováno v:
International Transactions in Operational Research
International Transactions in Operational Research, Wiley, 2021, ⟨10.1111/itor.12983⟩
International Transactions in Operational Research, Wiley, 2021, ⟨10.1111/itor.12983⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9810b1bdc4c4a4c5ae7e574fb4e16c71
https://hal.archives-ouvertes.fr/hal-03384306
https://hal.archives-ouvertes.fr/hal-03384306
Publikováno v:
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2020, Baltimore, France. pp.564-571, ⟨10.1109/ICTAI50040.2020.00093⟩
ICTAI
2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2020, Baltimore, France. pp.564-571, ⟨10.1109/ICTAI50040.2020.00093⟩
ICTAI
Local search algorithms consist in evolving a solution guided by a fitness function, which is usually directly derived from the objective function of the problem. Solving difficulties appear when the fitness landscape, naturally induced by the proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8adaf7423469286688a27fe51d5fa595
https://hal.archives-ouvertes.fr/hal-03421013
https://hal.archives-ouvertes.fr/hal-03421013
Publikováno v:
GECCO Companion
GECCO '20: Genetic and Evolutionary Computation Conference
GECCO '20: Genetic and Evolutionary Computation Conference, Jul 2020, Cancún Mexico, France. pp.101-102, ⟨10.1145/3377929.3390025⟩
GECCO '20: Genetic and Evolutionary Computation Conference
GECCO '20: Genetic and Evolutionary Computation Conference, Jul 2020, Cancún Mexico, France. pp.101-102, ⟨10.1145/3377929.3390025⟩
Solving an optimization problem with a local search algorithm consists in navigating within a search landscape, guided by a fitness function often directly defined from the objective function of the problem. The exploration of the resulting fitness l
Publikováno v:
Operations Research/Computer Science Interfaces Series ISBN: 9783319582528
Recent Developments of Metaheuristics
Recent Developments of Metaheuristics, 2018
Recent Developments of Metaheuristics
Recent Developments of Metaheuristics, 2018
Many combinatorial optimization problem solvers are based on stochastic local search algorithms, which mainly differ by their move selection strategies, also called pivoting rules. In this chapter, we aim at determining pivoting rules that allow hill
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72f1f58d746a5683cdc6fb0f25e67fcb
https://doi.org/10.1007/978-3-319-58253-5_7
https://doi.org/10.1007/978-3-319-58253-5_7
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2017, 257 (1), pp.41-54. ⟨10.1016/j.ejor.2016.07.056⟩
European Journal of Operational Research, Elsevier, 2017, 257 (1), pp.41-54. ⟨10.1016/j.ejor.2016.07.056⟩
International audience; The Maximum Vertex Weight Clique Problem (MVWCP) is an important generalization of the well-known NP-hard Maximum Clique Problem. In this paper, we introduce a generalized move operator called PUSH, which generalizes the conve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc5a618150a0445e0a9cdace52dfd710
https://hal.archives-ouvertes.fr/hal-01426414
https://hal.archives-ouvertes.fr/hal-01426414
Publikováno v:
International Conference on Artificial Evolution (EA)
International Conference on Artificial Evolution (EA), 2017, Paris, France. pp.53-64
Lecture Notes in Computer Science ISBN: 9783319781327
Artificial Evolution
International Conference on Artificial Evolution (EA), 2017, Paris, France. pp.53-64
Lecture Notes in Computer Science ISBN: 9783319781327
Artificial Evolution
In this paper we present and investigate partial neighborhood local searches, which only explore a sample of the neighborhood at each step of the search. We particularly focus on establishing link between the structure of optimization problems and th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fce02f269337953cf3e3516f0d034cde
https://hal.univ-angers.fr/hal-02715062
https://hal.univ-angers.fr/hal-02715062
Publikováno v:
GECCO (Companion)
Despite the huge number of studies in the metaheuristic field, it remains difficult to understand the relative impact of their elementary components. A major aspect determining the general efficiency of metaheuristics resides in the way to exploit a
Publikováno v:
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2016, 32 (2), pp.469-491. ⟨10.1007/s10878-015-9964-9⟩
Journal of Combinatorial Optimization, Springer Verlag, 2016, 32 (2), pp.469-491. ⟨10.1007/s10878-015-9964-9⟩
International audience; This paper presents a three-phased local search heuristic CPP-P3 for solving the Clique Partitioning Problem (CPP). CPP-P3 iterates a descent search, an exploration search and a directed perturbation. We also define the Top Mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86d37845cf7b3c0d12f6003f8d95c8d2
https://hal.archives-ouvertes.fr/hal-01412533
https://hal.archives-ouvertes.fr/hal-01412533