Thibaut Lust
Maître de conférences / Associate Professor

Sorbonne Université
Computer Science Laboratory of Paris 6
Decision Team
Boite courrier 169, Couloir 26-00, Etage 4, Bureau 405
UPMC, 4 place Jussieu, 75005 Paris, France
Phone: +33 1 44 27 24 40
Thibaut (dot) Lust (at) lip6 (dot) fr

   




Publications

Books (chapter) (1)

  1. T. Lust, J. Teghem, The multiobjective traveling salesman problem: a survey and a new approach, Chapter for the Springer book on Advances in multi-objective nature inspired computing, C. Coello Coello, C. Dhaenens, L. Jourdan, editors, volume 272, pages 119-141, 2010.

Journal articles (12)

  1. T. Lust, Les metaheuristiques pour traiter les problemes NP-difficiles , Tangente, pages 20-22, 2020.
  2. L. Costa, T. Lust, R. Kramer, A. Subramanian, A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem, Networks, pages 311-336, 2018.
  3. A. Jaszkiewicz and T. Lust, ND-tree-based update: a fast algorithm for the dynamic non-dominance problem, IEEE Transactions on Evolutionary Computation, 22(5): pages 778-791, 2018.
  4. A. Jaszkiewicz, T. Lust, Proper balance between search towards and along Pareto front: biobjective TSP case study, Annals of Operations Research, 254(1-2): pages 111-130, 2017.
  5. V.N. Coelho, T.A. Oliveira, I.M. Coelho, B.N. Coelho, P.J. Fleming, F.G. Guimaraes, H. Ramalhinho Dias Lourenco, M.J.F. Souza, E-G. Talbi, T. Lust: Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign, Computers and Operations Research, volume 78, pages 578-587, 2017.
  6. T. Lust, D. Tuyttens, Variable and large neighborhood search to solve the multiobjective set covering problem, Journal of Heuristics, volume 20, issue 2, pages 165-188, 2014.
  7. T. Lust, A. Rolland, Choquet optimal set in biobjective combinatorial optimization, Computers and Operations Research, volume 40, issue 10, pages 2260-2269, 2013.
  8. T. Lust, J. Teghem, The multiobjective multidimensional knapsack problem: a survey and a new approach, International Transactions in Operational Research, volume 19, issue 4, pages 495-520, 2012.
  9. T. Lust, A. Jaszkiewicz, Speed-up techniques for solving large-scale biobjective TSP, Computers and Operations Research, volume 37, pages 521-533, 2010.
  10. T. Lust, J. Teghem, Two-phase Pareto local search for the biobjective traveling salesman problem, Journal of Heuristics, volume 16, number 3, pages 475-510, 2010.
  11. T. Lust, O. Roux, F. Riane, Exact and heuristic methods for the selective maintenance problem, European Journal of Operational Research, volume 197, number 3, pages 1166-1177, 2009.
  12. T. Lust, J. Teghem, MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization, RAIRO Operations Research, volume 42, pages 3-33, 2008.

Conference proceedings articles (26)

  1. N. Benabbou, C. Leroy, T. Lust, P. Perny, Interactive Optimization of Submodular Functions under Matroid Constraints, Proceedings of the 7th International Conference on Algorithmic Decision Theory (ADT'21).
  2. N. Benabbou, C. Leroy, T. Lust, P. Perny, Combining Preference Elicitation with Local Search and Greedy Search for Matroid Optimization, Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI'21).
  3. N. Benabbou, C. Leroy, T. Lust, Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators, ECAI, Santiago de Compostela (Spain), 419-426, 2020.
  4. N. Benabbou, C. Leroy, T. Lust, An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems, AAAI, New-York (USA), 2335-2342, 2020.
  5. N. Benabbou, C. Leroy, T. Lust, P. Perny, Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization, ADT, Durham (USA), pages 1-16, 2019.
  6. N. Benabbou, T. Lust, A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences, SOCS, Napa (USA), pages 164-165, 2019.
  7. N. Benabbou, T. Lust, An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information, SUM, Compiègne (France), pages 221-235, 2019.
  8. T. Lust, Interactive Pareto local search with imprecise trade-offs, DA2PL'2018 (From Multiple Criteria Decision Aid to Preference Learning), Nov. 2018.
  9. T. Lust, Choquet integral versus weighted sum in multicriteria decision contexts, 3rd International Conference on Algorithmic Decision Theory (ADT 2015), pages 288-304, Sept. 2015.
  10. L. Galand, T. Lust, Exact methods for computing all Lorenz optimal solutions to biobjective problems, 3rd International Conference on Algorithmic Decision Theory (ADT 2015), pages 305-321, Sept. 2015.
  11. L. Costa, A. Subramanian, T. Lust, R. Kramer, Uma Heuristica Baseada em Pareto Local Search para o Pollution-Routing Problem Bi-Objetivo, 18th Symposio Brasileiro de Pesquisa Operacional, Porto de Galinhas, Brazil, Aug. 2015.
  12. L. Galand, T. Lust, Multiagent Fair Optimization with Lorenz Dominance, AAMAS, Istanbul (Turkey), pages 1895-1896, 2015.
  13. T. Lust, A. Rolland, 2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems, Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU), Montpellier (France), pages 256-265, 2014.
  14. T. Lust, D. Tuyttens, Two-Phase Pareto Local Search to Solve the Biobjective Set Covering Problem, Technologies and Applications of Artificial Intelligence (TAAI), Taipei (Taiwan), pages 397-402, 2013.
  15. T. Lust, A. Rolland, On the Computation of Choquet Optimal Solutions in Multicriteria Decision Contexts, The 7th Multi-Disciplinary International Workshop on Artificial Intelligence (MIWAI), Krabi (Thailand), pages 131-142, 2013.
  16. V. N. Coelho, M. J. F. Souza, I. M. Coelho, F. G. Guimaraes, T. Lust, R. C. Cruz, Multi-objective approaches for the open-pit mining operational planning problem, Proceedings of the EURO Mini Conference XXVII on Variable Neighborhood Search, Electronic Notes in Discrete Mathematics, volume 39, pages 233-240, 2012.
  17. T. Lust, N. Meskens, T. Monteiro, Ordonnancement multiobjectif du bloc opératoire avec une prise en compte d'une affectation équilibrée des compétences des infirmières, Proceedings of the 9th International Conference on Modeling, Optimization and SIMulation (MOSIM'2012), Bordeaux (France), pages 8, 2012.
  18. T. Lust, J. Teghem, D. Tuyttens, Very-large scale neighborhood search for solving multiobjective combinatorial optimization problems, Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization (EMO 2011), Lecture Notes In Computer Science, Ouro Preto (Brazil), pages 254-268, 2011.
  19. T. Lust, J. Teghem, Multiobjective decomposition of positive integer matrices: application to radiotherapy, Proceedings of the 4th International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Lecture Notes In Computer Science, Nantes (France), pages 335-349, 2009.
  20. T. Lust, J. Teghem, Two Phase Stochastic Local Search Algorithms for the Biobjective Traveling Salesman Problem, Stochastic Local Search Workshop (SLS-DS 2007), IRIDIA, Brussels (Belgium), pages 21-25, 2007.
  21. T. Lust, J. Teghem, PRTS+D et MEMOTS : nouvelles métaheuristiques pour l'optimisation combinatoire multicritère, Actes de conférence de ROADEF, 7ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Lille (France), 6-8 Février, Presses Universitaires de Valenciennes, pages 137-151, 2006.
  22. T. Lust, F. Riane, O. Roux, P. Dehombreux, Approches exacte et heuristique pour l'optimisation de la fiabilité dans le cadre d'une maintenance sélective, Actes de conférence de MOSIM, 6ème Conférence Francophone de Modélisation et Simulation, 3-5 avril, Rabbat (Morocco), pages 8, 2006.
  23. T. Lust, J. Teghem, Multicriteria Maintenance Problem Solved by Tabu Search, Volumes des Preprints du 12th IFAC Symposium on Information Control Problems in Manufacturing (INCOM'2006), Saint-Etienne (France), 2006.
  24. T. Lust, J. Teghem, MEMOX: a memetic algorithm scheme for multiobjective optimization, 7th International Conference devoted to Multi-Objective Programming and Goal Programming, Tours (France), 2006.
  25. T. Lust, F. Riane, O. Roux, Plateforme de modélisation, de simulation et d'optimisation des actions de maintenance d'un système multi-composants, Actes du 6ème ès International Pluridisciplinaire Qualité et Sûreté de Fonctionnement, 16-18 Mars, Yves Dutuit, Daniel Noyes et François Pérès, editors, Bordeaux (France), Volume 2, pages 673-682,2005.
  26. T. Lust, O. Roux, F. Riane, P. Dehombreux, Simulation based Framework for Maintenance Optimization, Proceedings of the 3rd International Industrial Simulation Conference (ISC'2005), June 9th-11th, Philippe Geril, editor, Berlin (Germany), Pages 23-27, 2005.

Abstracts with referee (25)

  1. M.B. Bederina, D. Chaabane, T. Lust A parallel algorithm for finding the non-dominated set of multi-objective integer problems , ORBEL'37, 37st Belgien Conference on Operational Research, Liege (Belgium), 2023.
  2. N. Benabbou, C. Leroy, T. Lust, P. Perny, Local search and greedy search combined with preference elicitation for maximizing submodular functions under matroid constraints , EURO'31, 31st European Conference on Operational Research, Athens (Greece), 2021.
  3. N. Benabbou, C. Leroy, T. Lust, An Incremental Genetic Approachfor Multi-Objective Combinatorial Optimization with Imprecise Preferences , MOPGP'19, 13th International Conference on Multiple Objective and Goal Programming, Marrakech (Morocco), 2019.
  4. T. Lust, N. Benabbou, L. Galand, Experimental analysis of greedy strategies to minimize pairwise comparisons in multicriteria decision aiding , 90th meeting of the Euro working group on Multi-Criteria Decision Aiding (EWG-MCDA 90), Brest (France), 2019.
  5. T. Lust, Recherche Locale Pareto Interactive , 20eme congres annuel de la societe Francaise de Recherche Operationnelle et d'Aide a la Decision (ROADEF), Le Havre (France), 2019.
  6. A. Jaszkiewicz, T. Lust, ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive , 28th European Conference on Operational Research, Poznan (Poland), 2016.
  7. L. Galand, T. Lust, Two phase method for Lorenz dominance in biobjective combinatorial optimization, 26th European Conference on Operational Research, Rome (Italy), 2013.
  8. T. Lust, A. Rolland, Generation of the Choquet optimal set of multiobjective combinatorial optimization problems, 22nd International Conference on Multiple Criteria Decision Making, Malaga, 2013.
  9. T. Lust, A. Rolland, Génération de l'ensemble des solutions Choquet-optimales de problèmes d'optimisation combinatoire multi-objectifs, 14ème congrès annuel de la société française de recherche opérationnelle et d'aide à la décision, Troyes, 2013.
  10. T. Lust, N. Meskens, Ordonnancement multiobjectif du bloc opératoire, Colloque International sur les Systèmes Industriels et Logistiques, Casablanca (Maroc), 2011.
  11. L. Galand, T. Lust, Méthodes en deux phases pour la détermination des solutions Lorenz optimales en optimisation combinatoire biobjectif, 12ème congrès annuel de la société française de recherche opérationnelle et d'aide à la décision, Saint-Etienne (France), 2011.
  12. T. Lust, J. Teghem, Large neighborhood search for solving the multiobjective multidimensional knapsack problem, 24th EURO conference, Lisbon (Portugal), 2010.
  13. T. Lust, J. Teghem, Combining metaheuristics and exact methods to solve the multiobjective multidimensional knapsack problem, ORBEL, 24th Conference on Quantitative Methods for Decision Making, Liège (Belgium), 2010.
  14. T. Lust, J. Teghem, Multiobjective decomposition of positive integer matrices: application to radiotherapy, 23rd EURO conference, Bonn (Germany), 2009.
  15. T. Lust, Data dominance relations for solving large-scale biobjective TSP, ORBEL, 22nd Conference on Quantitative Methods for Decision Making, Brussels (Belgium), 2008.
  16. T. Lust, Speed-up Techniques for Solving Large-scale bTSP with the Two-Phase Pareto Local Search, MOPGP08, 8th International Conference on Multiple Objective and Goal Programming, Portsmouth (England), 2008.
  17. T. Lust, Speed-up Techniques for Solving large-scale bTSP with the Two-Phase Pareto Local Search, Genetic and Evolutionary Computation Conference, Atlanta (E-U), 2008.
  18. T. Lust, J. Teghem, Integration of the Lin-Kernighan Heuristic in the MEMOX Scheme for the Resolution of the Biobjective Traveling Salesman Problem, Fourth International Conference on Evolutionary Multi-Criterion Optimization (EMO2007), Matsushima/Sendai (Japan), 2007.
  19. T. Lust, J. Teghem, Integration of the Lin-Kernighan Heuristic into a Memetic Algorithm for the Resolution of the Biobjective Traveling Salesman Problem, 7th Metaheuristics International Conference (MIC'2007), Montreal (Canada), 2007.
  20. T. Lust, J. Teghem, Integration of the Lin-Kernighan Heuristic into a Memetic Algorithm for the Resolution of the Biobjective Traveling Salesman Problem, 22nd European Conference on Operational Research, Prague (Czech Republic), 2007.
  21. T. Lust, Two Phase Pareto Local Search Method for Multiobjective Optimization, Cost IC0602 International Doctoral School, Han-sur-Lesse (Belgium), 2007.
  22. O. Roux, T. Lust, F. Riane and P. Dehombreux, Optimisation de la fiabilité dans le cadre d'une maintenance sélective, Pentom, 3ème édition du colloque international francophone, Performances et nouvelles technologies en maintenance, Mons (Belgium), 2007.
  23. T. Lust, J. Teghem, MEMOTS: a memetic algorithm integrating tabu search for multiobjective optimization, ORBEL, 20th Conference on Quantitative Methods for Decision Making, Gent (Belgium), 2006.
  24. T. Lust, J. Teghem, MEMOTS: a memetic algorithm integrating tabu search for multiobjective optimization, EURO, 21st European Conference on Operational Research, Reykjavik (Iceland), 2006.
  25. T. Lust, J. Teghem, D. Tuyttens, Résolution du TSP multiobjectif avec l'algorithme mémétique MEMOX, Meta, Hammamet (Tunisia), 2006.

Invited Talks (23)

  1. T. Lust, Interactive multiobjective combinatorial optimization with imprecise trade-offs, Paris Dauphine, Seminaire Aide a la decision, 2018.
  2. T. Lust, Multiobjective combinatorial optimization: current and future challenges, IBM Research Dublin, Dublin, 2015.
  3. A. Rolland and T. Lust, Ensemble de solutions Choquet-optimales en optimisation multi-objectif, Centre d'économie de la Sorbonne, Séminaire de Mathématiques Discrètes, Optimisation et Décision, Paris, 2013.
  4. T. Lust and A. Rolland, k-additive Choquet optimal solutions in multiobjective combinatorial optimization, Guepard workshop, Paris, 2013.
  5. T. Lust, Génération de l'ensemble des solutions Choquet-optimales de problèmes d'optimisation combinatoire multi-objectifs, Université Paris Dauphine, Réunion ANR Guépard, Paris, 2012.
  6. T. Lust, Optimisation combinatoire multiobjectifs : méthodes et applications, Université de Lyon 2, Laboratoire ERIC, Bron (France), 2012.
  7. T. Lust, Multiobjective combinatorial optimization: methods and applications, University of Aberdeen, School of Natural and Computing Sciences, Aberdeen (Scotland), 2011.
  8. T. Lust, Multiobjective combinatorial optimization: methods and applications, Ecole Nationale Supérieure des Mines de Saint-Etienne, Saint-Etienne (France), 2011.
  9. T. Lust, How to deal with fairness in combinatorial optimization, Universidade Federal Fluminense, Instituto de Ciência da Computação, Niterói, Rio de Janeiro (Brazil), 2010.
  10. T. Lust, Multiobjective combinatorial optimization: methods and applications, Universidade Federal dos Voles do Jequitinhonha e Mucuri, Semana de Sistemas de Informação, Diamantina, Minas Gerais (Brazil), 2010.
  11. T. Lust, Multiobjective combinatorial optimization: methods and applications, Universidade Federal de Minas Gerais, Bel Horizonte (Brazil), 2010.
  12. T. Lust, Multiobjective combinatorial optimization: methods and applications, Universidade Federal de Ouro Preto, Computer Science Week, Ouro Preto, Minas Gerais (Brazil), 2010.
  13. T. Lust, Multiobjective combinatorial optimization: methods and applications, Universidade Federal Fluminense, Instituto de Ciência da Computação, Niterói, Rio de Janeiro (Brazil), 2010.
  14. T. Lust, J. Teghem, The multiobjective multidimensional knapsack problem: a survey and a new approach, Semi-plenary Session, MOPGP'10, Sousse (Tunisia), 2010.
  15. T. Lust, Metaheuristics for multiobjective combinatorial optimization problems, Université Pierre et Marie Curie (Paris 6), LIP6, 2010.
  16. T. Lust, Multiobjective combinatorial optimization, Meeting day Mathro-Umons, Mons (Belgium), 2010.
  17. T. Lust, J. Teghem, Multiobjective decomposition of positive integer matrices, Workshop on Optimization problems in intensity modulated radiation therapy, Rostock (Germany), 2009.
  18. T. Lust, J. Teghem, Intensity Modulated Radiation Therapy Application: a Multiobjective Approach, IDSS Seminar, Poznań (Poland), 2009.
  19. T. Lust, Metaheuristics for multiobjective combinatorial optimization problems, Journée de Formation doctorale, Aide à la Décision Multicritère, Modélisation des Préférences et Optimisation Multi-Objectifs, Bruxelles (Belgium), 2008.
  20. T. Lust, Speed-up techniques for solving the biobjective Traveling Salesman Problem, Mathro-SMG meeting, Mons (Belgium), 2008.
  21. T. Lust, Two-Phase Pareto Local Search for the Biobjective Traveling Salesman Problem, PM2O Groupe de Travail sur la Programmation Mathématique MultiObjectif, Lille (France), 2007.
  22. T. Lust, J. Teghem, Metaheuristics for the Multiobjective Traveling Salesman Problem, IDSS Seminar, Poznań (Poland), 2007.
  23. T. Lust, Metaheuristics in multicriteria optimization, Mathro-SMG meeting, Mons (Belgium), 2006.

Thesis

  1. 2009: New metaheuristics for solving MOCO problems: application to the knapsack, traveling salesman problems and IMRT optimization. PhD Thesis, University of Mons.
    The jury: