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

   




Research

    • Multiobjective knapsack problem

      Instances
      250-2, 500-2, 750-2
      250-3, 500-3, 750-3

      Reference sets
      • Pareto non-dominated points (exact, epsilon-constraint method):
        250-2, 500-2, 750-2

      • Reference sets:
        250-3, 500-3, 750-3

      Heuristic results
      • MEMOTS (T. Lust, J. Teghem, MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization, RAIRO Operations Research, volume 42, pages 3-33, 2008):
        250-2, 500-2, 750-2
        250-3, 500-3, 750-3

      • 2PPLS (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):
        250-2, 500-2, 750-2

    • Multiobjective traveling salesman problem

      Instances
      KroAB100,KroAB150,KroAB200,KroAB300,KroAB400,KroAB500,KroAB750,KroAB1000
      KroAC100
      KroAD100
      KroBC100
      KroBD100
      KroCD100
      EuclAB100,EuclAB300,EuclAB500
      RdAB100,RdAB300,RdAB500
      MixedAB100,MixedAB300,MixedAB500
      ClusteredAB100,ClusteredAB300,ClusteredAB500

      Reference Sets

      Heuristic results
      • 2PPLS (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):
        Kro , Eucl , Rd , Mixed , Clustered
        Running times 2PPLS:

      • 2PPLS+SpeedP1 (T. Lust, A. Jaszkiewicz, Speed-up techniques for solving large-scale biobjective TSP, Computers and Operations Research, volume 37, pages 521-533, 2010):
        Kro(1) , Kro(2) , Eucl , Rd , Mixed , Clustered
        Running times 2PPLS+SpeedP1:

    • Multiobjective set covering problem

      Instances
      11a,11b,11c,11d,41a,41b,41c,41d,42a,42b,42c,42d,43a,43b,43c,43d,61a,61b,61c,61d,62a,62b,62c,62d,81a,81b,81c,81d,82a,82b,82c,82d 101a,101b,101c,101d,102a,102b,102c,102d,201a,201b,201c,201d
      Pareto non-dominated points (exact, epsilon-constraint method)
      11a,11b,11c,11d,41a,41b,41c,41d,42a,42b,42c,42d,43a,43b,43c,43d,61a,61b,61c,61d,62a,62b,62c,62d,81a,81b,81c,81d,82a,82b
      Heuristic results
      2PPLS (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):
      • Two criteria:
      • Three criteria: