Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Matthieu Basseur"'
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
Autor:
Rong-Qiang Zeng, Matthieu Basseur
Publikováno v:
Intelligent Computing Theories and Application ISBN: 9783031138690
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef54fb906e12a5e349d02e5c8a8054fb
https://doi.org/10.1007/978-3-031-13870-6_10
https://doi.org/10.1007/978-3-031-13870-6_10
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:
Applied Soft Computing
Applied Soft Computing, Elsevier, 2018, 70, pp.814-825. ⟨10.1016/j.asoc.2018.06.024⟩
Applied Soft Computing, Elsevier, 2018, 70, pp.814-825. ⟨10.1016/j.asoc.2018.06.024⟩
International audience; Local search algorithms constitute a growing area of interest to approximate the Pareto sets of multi-objective combinatorial problem instances. In this study, we focus on the multi-objective knapsack problem and its optimizat
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2019, 104, pp.1-14. ⟨10.1016/j.cor.2018.12.003⟩
Computers and Operations Research, Elsevier, 2019, 104, pp.1-14. ⟨10.1016/j.cor.2018.12.003⟩
International audience; The set of Paretonondominated solutionsobtained in some practical cases of multiobjective optimization problems can be huge, rendering decision making difficult. Applying Lorenz dominance instead of Pareto dominance during the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed3897505ec53e8882d20406a59b46fb
https://hal.archives-ouvertes.fr/hal-02309987
https://hal.archives-ouvertes.fr/hal-02309987
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:
Expert Systems with Applications
Expert Systems with Applications, Elsevier, 2017, 71, pp.457-468. ⟨10.1016/j.eswa.2016.11.007⟩
Expert Systems with Applications, Elsevier, 2017, 71, pp.457-468. ⟨10.1016/j.eswa.2016.11.007⟩
We consider an action plan optimization problem in social and medico-social sector.The multiobjective knapsack model is used to formulate the studied application.Iterated local search based on quality indicators is adopted as the solution method.Comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f974307e367145af12191fde4b12f4c7
https://hal.archives-ouvertes.fr/hal-01426411v2/file/chabanebasseurhaoeswa2016.pdf
https://hal.archives-ouvertes.fr/hal-01426411v2/file/chabanebasseurhaoeswa2016.pdf
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:
Applied Soft Computing
Applied Soft Computing, Elsevier, 2013, 13 (10), pp.4118-4132. ⟨10.1016/j.asoc.2013.05.018⟩
Applied Soft Computing, Elsevier, 2013, 13 (10), pp.4118-4132. ⟨10.1016/j.asoc.2013.05.018⟩
This paper presents and investigates different ways to integrate path relinking techniques into the hypervolume-based multi-objective local search algorithm (HBMOLS). We aim to evaluate the effectiveness of different path relinking strategies, these
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