Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Thibaut Lust"'
Publikováno v:
Algorithmic Decision Theory ISBN: 9783030877552
ADT
ADT
Various practical optimization problems can be formalized as the search of an optimal independent set in a matroid. When the set function to be optimized is additive, this problem can be exactly solved using a greedy algorithm. However, in some situa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf3259b3908341ba7499c8f3248fa8f4
https://doi.org/10.1007/978-3-030-87756-9_20
https://doi.org/10.1007/978-3-030-87756-9_20
Publikováno v:
Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI'20)
The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20)
The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), Feb 2020, New York, United States
AAAI
The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20)
The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), Feb 2020, New York, United States
AAAI
International audience; We propose a new approach consisting in combining genetic algorithms and regret-based incremental preference elicitation for solving multi-objective combinatorial optimization problems with unknown preferences. For the purpose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3632b53eab1b6e82e95fb02d44de410c
https://hal.sorbonne-universite.fr/hal-02445320/document
https://hal.sorbonne-universite.fr/hal-02445320/document
Autor:
Thibaut Lust, Nawal Benabbou
Publikováno v:
SUM 2019-The 13th international conference on Scalable Uncertainty Management
SUM 2019-The 13th international conference on Scalable Uncertainty Management, Dec 2019, Compiègne, France
Lecture Notes in Computer Science ISBN: 9783030355135
SUM
SUM 2019-The 13th international conference on Scalable Uncertainty Management, Dec 2019, Compiègne, France
Lecture Notes in Computer Science ISBN: 9783030355135
SUM
International audience; In this paper, we develop a general interactive polyhedral approach to solve multi-objective combinatorial optimization problems with incomplete preference information. Assuming that preferences can be represented by a paramet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7c1cdbdbe29722e2809a27b2b3e875f
https://hal.sorbonne-universite.fr/hal-02308626
https://hal.sorbonne-universite.fr/hal-02308626
Autor:
Thibaut Lust, Andrzej Jaszkiewicz
Publikováno v:
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation, Institute of Electrical and Electronics Engineers, 2018, 22 (5), pp.778-791. ⟨10.1109/TEVC.2018.2799684⟩
IEEE Transactions on Evolutionary Computation, Institute of Electrical and Electronics Engineers, 2018, 22 (5), pp.778-791. ⟨10.1109/TEVC.2018.2799684⟩
International audience; In this paper, we propose a new method called ND-Tree-based update (ND-Tree) for the dynamic nondominance problem, i.e., the problem of online update of a Pareto archive composed of mutually nondominated points. It uses a new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab5a73c86eb06bfb73a166c6c4eaec51
https://hal.sorbonne-universite.fr/hal-02076624
https://hal.sorbonne-universite.fr/hal-02076624
Publikováno v:
Networks
Networks, Wiley, 2018, 72 (3), pp.311-336
Networks, Wiley, 2018, 72 (3), pp.311-336
International audience; This article deals with the bi‐objective pollution‐routing problem (bPRP), a vehicle routing variant that arises in the context of green logistics. The two conflicting objectives considered are the minimization of the CO2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a24dab0d9099efe4e17d6eccb086671
https://hal.sorbonne-universite.fr/hal-01944039
https://hal.sorbonne-universite.fr/hal-01944039
Autor:
Andrzej Jaszkiewicz, Thibaut Lust
Publikováno v:
Annals of Operations Research
Annals of Operations Research, 2017, 254 (1-2), pp.111-130. ⟨10.1007/s10479-017-2415-5⟩
Annals of Operations Research, Springer Verlag, 2017, 254 (1-2), pp.111-130. ⟨10.1007/s10479-017-2415-5⟩
Annals of Operations Research, 2017, 254 (1-2), pp.111-130. ⟨10.1007/s10479-017-2415-5⟩
Annals of Operations Research, Springer Verlag, 2017, 254 (1-2), pp.111-130. ⟨10.1007/s10479-017-2415-5⟩
International audience; In this paper we propose simple yet efficient version of the two-phase Pareto local search (2PPLS) for solving the biobjective traveling salesman problem (bTSP). In the first phase the powerful Lin–Kernighan heuristic is use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad059d3fc6fd2571dce7c1ba64bd9200
https://hal.sorbonne-universite.fr/hal-02076619
https://hal.sorbonne-universite.fr/hal-02076619
Autor:
Frederico Gadelha Guimarães, Thibaut Lust, Peter J. Fleming, Helena Ramalhinho, Vitor Nazário Coelho, Igor Machado Coelho, El-Ghazali Talbi, Thays A. Oliveira, Marcone Jamilson Freitas Souza, Bruno Nazário Coelho
Publikováno v:
Computers and Operations Research
Computers and Operations Research, 2017, 78, pp.578-587. ⟨10.1016/j.cor.2016.09.008⟩
Computers and Operations Research, Elsevier, 2017, 78, pp.578-587. ⟨10.1016/j.cor.2016.09.008⟩
Computers and Operations Research, 2017, 78, pp.578-587. ⟨10.1016/j.cor.2016.09.008⟩
Computers and Operations Research, Elsevier, 2017, 78, pp.578-587. ⟨10.1016/j.cor.2016.09.008⟩
Cross-selling campaigns seek to offer the right products to the set of customers with the goal of maximizing expected profit, while, at the same time, respecting the purchasing constraints set by investors. In this context, a bi-objective version of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd5bcf820876ac0b6e9155b0ccb098f5
https://inria.hal.science/hal-01654721
https://inria.hal.science/hal-01654721
Autor:
Thibaut Lust, Antoine Rolland
Publikováno v:
Computers and Operations Research
Computers and Operations Research, 2013, 40 (10), pp.2260-2269. ⟨10.1016/j.cor.2013.04.003⟩
Computers and Operations Research, Elsevier, 2013, 40 (10), pp.2260-2269. ⟨10.1016/j.cor.2013.04.003⟩
Computers and Operations Research, 2013, 40 (10), pp.2260-2269. ⟨10.1016/j.cor.2013.04.003⟩
Computers and Operations Research, Elsevier, 2013, 40 (10), pp.2260-2269. ⟨10.1016/j.cor.2013.04.003⟩
International audience; We study in this paper the generation of the Choquet optimal solutions of biobjective combinatorial optimization problems. Choquet optimal solutions are solutions that optimize a Choquet integral. The Choquet integral is used
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6c9f20b024073d415f81b12aff3a46f
https://doi.org/10.1016/j.cor.2013.04.003
https://doi.org/10.1016/j.cor.2013.04.003
Autor:
Andrzej Jaszkiewicz, Thibaut Lust
Publikováno v:
Computers & Operations Research. 37:521-533
In this paper, we present the Two-Phase Pareto Local Search (2PPLS) method with speed-up techniques for the heuristic resolution of the biobjective traveling salesman problem. The 2PPLS method is a state-of-the-art method for this problem. However, b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::587faed755a360b7efbfab1459a63877
https://doi.org/10.1016/j.cor.2009.01.005
https://doi.org/10.1016/j.cor.2009.01.005