Thierry Benoist

Innovation24 / LocalSolver 

Biography

Thierry Benoist is in charge of operations research projects at Innovation 24, a service company and software editor expert in the field of Operations Research (OR), spun off from Bouygues (e-lab) in 2012.
Since 2000, he has been in charge of many Operations Research projects leading to operational software in the Bouygues Group and beyond. Graduated from the École Polytechnique (1998), he holds a PhD in computer science from Avignon University (2004). Having resulted in several papers in top OR journals, his researches in applied combinatorial optimization have been distinguished by several awards.
Inspired by Frédéric Gardi, his team has undertaken in 2007 the design and implementation of LocalSolver, a
new-generation  mathematical programming solver integrating neighborhood techniques, in partnership with the University of Marseille (Bertrand Estellon and Karim Nouioua).

Research Interests

  • Local Search Programming
  • Analysis and resolution of practical OR problems, including:
    • The Inventory Routing Problem
    • The Partially Ordered LineTSP.
  • We also strive to share the OR project management principles that we have progessively introduced for e-lab projects. On this topic, see the article co-written with Frédéric Gardi and Antoine Jeanjean in Informs Interfaces

Awards

Euro Excellence In Practice Award 2012: finalist
This prize, awarded year by the EURO Society, recognizes outstanding accomplishments in the practice of Operational Research. With Frédéric Gardi and Antoine Jeanjean we presented our work on the optimization of advertisement revenue for TF1 (see the video of our presentation).

Robert Faure 2006: 3rd prize
This prize, awarded every three years by the French Operations Research Society, distinguishes young researchers for their contribution to OR, combining theoretical and practical aspects, in the spirit of Robert Faure works.

ASTI 2005: 1st prize in the “Innovative Applications” category
This prize recognizes the best applied PhD thesis in the Science and Technologies of Information and Communication defended in France in the period 2003/2004 (see the notice from the jury).
Décompositions combinatoires et applications industrielles

International communications (in English english)

Journal Papers

T. Benoist, J. Darlay, B. Estellon, F. Gardi, R. Megel (2013). Integrating Local Search Techniques into a  Mathematical Programming Solver. In IFORS newsletter September 2013.
T. Benoist, F.Gardi, A. Jeanjean 
 Lessons learned from 15 years of operations research for French TV channel TF1.  In Informs Interfaces 42(6), pp. 577-584. (preprint)
T. Benoist, B. Estellon, F.Gardi, R. Megel, K. Nouioua (2011).  LocalSolver 1.x: a black-box local-search solver for 0-1 programming. In 4OR, A Quarterly Journal of Operations Research 9(3), pp. 299-316 (preprint
T. Benoist, B. Estellon, F.Gardi, A. Jeanjean (2011).  Randomized local search for real-life inventory routing. In Transportation Science 45(3), pp. 381-398 (preprint)   
T. Benoist, A. Jeanjean, P. Molin (2009).  Minimum Formwork Stock Problem on residential buildings construction sites. In 4OR: A Quarterly Journal of Operations Research, Volume 7, Issue 3, Oct 2009, Pages 275 – 288.
T.Benoist, E. Bourreau (2008). Fast Global Filtering for Eternity II. In Constraint Programming Letters, Volume 3, Pages 35-50.
T. Benoist (2008). Soft car sequencing with colors: Lower bounds and optimality proofs. In European Journal of Operational Research Volume 191, Issue 3, 16 December 2008, Pages 957-971. (preprint)
T. Benoist (2007).
Towards optimal formwork pairing on construction sites. In RAIRO Operations Research vol 41 n° 4 (2007) 381-398.
(preprint)
T. Benoist, E. Bourreau and B. Rottembourg (2007). The TV-Break Packing Problem. In European Journal of Operational Research Volume 176, Issue 3, 1 February 2007, Pages 1371-1386. (preprint)
T. Benoist, B. Rottembourg (2004). Upper Bounds of the Maximal Revenue of an Earth Observation Satellite. In 4OR: A Quarterly Journal of Operations Research, Volume 2, Issue 3, Oct 2004, Pages 235 – 249. (preprint)

Refereed Conference & Workshop Papers

T. Benoist, A. Jeanjean, V. Jost (2014). Call-Based Dynamic Programming for the Precedence Constrained Line Traveling Salesman.In CPAIOR 2014, Cork (Ireland).
T. Benoist, B. Estellon, F. Gardi, K. Nouioua (2010). Toward local search programming: LocalSolver 1.0. In CPAIOR 2010 Workshop : Open Source Tools for Constraint Programming and Mathematical Programming.
Bologna (Italy). 
T. Benoist (2010).
Characterization and automation of matching-based neigborhood. CPAIOR'10, Bologna (Italy).
T. Benoist, B. Estellon, F. Gardi A. Jeanjean (2009). High-Performance Local Search for Solving Real-Life Inventory Routing Problems. SLS'09, Brussels (Belgium).
T. Benoist, A. Jeanjean, G. Rochart, H. Cambazard, E. Grellier, N. Jussien (2006). Subcontractors scheduling on residential buildings construction sites. ISS'06 International Scheduling Symposium, Technical Report JSME-06-203, pp. 32-37, Japan Society of Mechanical Engineers, 2006
T. Benoist (2005). Constraint Modelling Challenge 2005:A dynamic programming approach. In proceedings of the First Constraint Modelling Challenge (pp 21-23). IJCAI 2005, Edinburgh, Scotland.
T. Benoist and E. Bourreau (2003). Improving Global Constraints Support by Local Search. In CP’03 Workshop on Cooperative Solvers in Constraint Programming, 2003.
T. Benoist and M. Lemaître (2003). An Elegant and Efficient Implementation of Russian Dolls Search for Variable Weighted CSP. In CP’03 Workshop on Soft Constraints, 2003.
T. Benoist, E. Gaudin, B. Rottembourg (2002). Constraint Programming Contribution to Benders Decomposition: A Case Study. In Proceedings CP'02, LNCS 2470, pages 603-617, Springer 2002
T. Benoist, E. Bourreau, Y. Caseau, B. Rottembourg (2001). Towards Stochastic Constraint Programming: A Study of On-Line Multi-Choice Knapsack with Deadlines. In Proceedings CP'01, LNCS 2239, pages 61-76, Springer 2001.

Invited Paper

T. Benoist, B. Rottembourg (2005). 10 OR Applications at Bouygues. In OR47 keynote proceedings, Chester, England, 2005.

Research Report

T. Benoist (2008). How many edges can be shared by N square tiles on a board ? e-lab Research Report - April 2008.
Thierry Benoist, Hadrien Cambazard, Antoine Jeanjean, and Guillaume Rochart (2007).
Solution counts. e-lab research report, October 2007.
T. Benoist, F. Chauvet (2001). Complexity of FPP related problems. e-lab research report, December 2001.

Talks

T. Benoist, J. Darlay, B. Estellon, F. Gardi, R. Megel, (2013). Mathematical Programming by Local Search. In ECCO 2013, Paris,France.
T. Benoist, J. Darlay, B. Estellon, F. Gardi, R. Megel (2013).
LocalSolver: Mathematical Programming by Local Search. In OR 55, the 55th Annual Conference of the OR Society. Exeter, United-Kingdom.
T. Benoist, R. Megel (2013). Long Term Planning with LocalSolver. In OR 55, the 55th Annual Conference of the OR Society. Exeter, United-Kingdom.
T. Benoist, J. Darlay, B. Estellon, F. Gardi, R. Megel, K. Nouioua (2012).
ROADEF/EURO/Google Challenge: how a 100-line LocalSolver model qualifies for the final round. In EURO 2012, the 25th European Conference of Operational Research.Vilnius, Lithuania.
T.Benoist (2011).
Operations Research and Local Search for Construction and TV Businesses. In Informs Conference on Business Analytics and Operations Research, Chicago, US.
T. Benoist, B. Estellon, F. Gardi, S. Jain, A. Jeanjean, E. Patay
 (2009). Inventory routing optimization for bulk gas transportation. In INFORMS 2009, Annual Meeting. San Diego, US-CA.
T. Benoist (2008). Operations Research for TV and internet advertising. In  Conference on Optimization and Practices in Industry (COPI'08), Paris. Invited by Laetitia Andrieu.
T. Benoist (2007). Hybrid Algorithms for Construction, TV Advertising and Civil Contracts. In CP-AI-OR'07, Brussels. Invited by Pascal Van Hentenryck and Laurence Wolsey.
T. Benoist, B. Rottembourg (2005). Ten years of corporate OR at Bouygues : agnostic optimisation solutions for Telecom, TV & construction. In OR47 Annual Conference, Chester, England, 2005. Invited by Ian Turner.
T. Benoist, B. Rottembourg (2005). Modelling Highway Management PFIs with OR : a £400m cost function with QoS constraints. In OR47 Annual Conference, Chester, England, 2005. Invited by Ian Turner.
T. Benoist (2004). Upper bounds for the TV-Break Packing Problem. In Optimization Days 2004, Montréal.
T. Benoist, F. Chauvet, B. Rottembourg (2002). Lagrange relaxation based heuristics for multi-stage antenna location and configuration. In IFORS02, Edinburgh, UK, July 2002.
T. Benoist (2002). Towards optimal formwork pairing on construction sites. In Combinatorial Optimization, Paris, April 2002.
T. Benoist, E. Gaudin, B. Rottembourg (2001). Long Term Workforce Scheduling in Contact Centers. In Informs, Miami, November 2001.

National communications (in French french)

Livre

T. Benoist (2004). Décompositions combinatoires et applications industrielles. Lavoisier- Hermès, 2007.  ISBN 978-2-7462-1569-6. 

Thèse et chapitre de livre

T. Benoist (2004). Relaxations et décompositions combinatoires. PhD thesis, Université d’Avignon et des Pays de Vaucluse
T. Benoist, E. Gaudin, B. Rottembourg (2005). Planification de centres d’appels téléphoniques. In Gestion de Production et Ressources Humaines, Presses Internationales Polytechnique (Montréal).

Revues Nationales


T. Benoist, B. Martin (2007).
Partenariats Public Privés et Recherche Opérationnelle. Bulletin n° 18 de la Roadef, Printemps-été 2007.
T. Benoist, E. Gaudin, B. Rottembourg (2002). Métissages de Techniques d'optimisation pour la planification de ressources. In Génie Logiciel n° 63 pages 53-62, décembre 2002.

Conférences

T. Benoist, J. Darlay, B. Estellon, F. Gardi, R. Megel, (2013). Vers un solveur de programmation mathématique généralisée basé sur la recherche locale. In Roadef 2013, Troyes ,France.
F. Kamijo, T. Benoist (2013). Ordonnancement d'un atelier de peinture avec LocalSolver. In Roadef 2013, Troyes ,France.
JY Lucas, D. Marcel, T. Benoist, F. Gardi, R. Megel (2013)
Une modélisation LocalSolver pour le placement des assemblages combustibles en piscine. In Roadef 2013, Troyes ,France.
M. Quattrone, T. Benoist (2013).
Planification par LocalSolver de la distribution de bouteilles de gaz. In Roadef 2013, Troyes ,France.
T. Benoist, J. Darlay, B. Estellon, F. Gardi, R. Megel, K. Nouioua (2012).
LocalSolver 2.0 : premier solveur de programmation mathématique fondé sur la recherche locale. In Actes de ROADEF 2012, le 13ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision. Angers, France. (exposé semi-plénier).
T. Benoist  (2011).
Retour sur erreurs : analyse d’un projet de RO laborieux. In ROADEF 2011, Saint-Etienne.
T. Benoist,  A. Jeanjean, V. Jost (2011). Le problème du voyageur de commerce unidimensionnel avec précédences. In ROADEF 2011, Saint-Etienne.
T. Benoist, B. Estellon, F.Gardi, R. Megel, K. Nouioua (2011). Vers une programmation par recherche locale: LocalSolver 1.1. In ROADEF 2011, Saint-Etienne.
T. Benoist, B. Estellon, F.Gardi, R. Megel, K. Nouioua (2011).Génération automatique de voisinages de grande taille pour la recherche locale autonome. In ROADEF 2011, Saint-Etienne.
T. Benoist,  A. Jeanjean, V. Jost (2011). Optimisation de mouvements de terre sur des chantiers linéaires de terrassement. In Joournée d'optimisation dans les réseaux, Paris.
T. Benoist  (2010). Recherche Opérationnelle et recherche locale chez Bouygues. In ROADEF 2010, Toulouse. Invité par Christian Artigues et Pierre Lopez.
T. Benoist, B. Estellon, F. Gardi, K. Nouioua (2010). Vers une programmation par recherche locale : LocalSolver. In Actes de ROADEF 2010, le 11ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Toulouse, France.
T. Benoist, E. Bourreau (2008). 
La Programmation Par Contraintes à l’attaque d’Eternity II. In JFPC 2008- Quatrièmes Journées Francophones de Programmation par Contraintes, Nantes 2008.
T. Benoist (2008).
Problèmes légèrement sur-contraints en Programmation Par Contraintes. In Roadef'08,
Clermont-Ferrand.
F. Gardi, T. Benoist (2008). Programmation de campagnes publicitaires sur les chaînes thématiques du groupe TF1.
In Roadef'08, Clermont-Ferrand.
T. Benoist, A. Jeanjean (2008). Etude du comportement d’annulation d’une contre-proposition d’un spot publicitaire.
In Roadef'08, Clermont-Ferrand.
T. Benoist (2007).  La programmation par contraintes sur les chantiers de construction. In JFPC'07, Rocquencourt. Invité par François Fages.
T. Benoist, A. Jeanjean, P. Molin (2007), Affectation du matériel de coffrage sur des chantiers de construction. In Roadef'07, Grenoble.
T. Benoist, A. Jeanjean (2007), Annonce du temps d'attente dans un centre d'appel. In Roadef'07, Grenoble.
T. Benoist, M. Diamantini (2006). Contrainte de flot et RCPSP avec temps de transfert. In Roadef’06, Lille.
T. Benoist, A. Jeanjean, G. Rochart, C. Bellangeon, P.M. Argouet (2006). Planification des corps d’état secondaires sur des chantiers de constructions. In Roadef’06, Lille.
T. Benoist, G. Grotterud (2006). Gestion optimale de stocks : la vente par correspondance. In Roadef’06, Lille.
T. Benoist (2005). Relaxations et Décompositions Combinatoires (Prix ASTI 2005). 2èmes rencontres des Sciences et Technologies de l'Information, Clermont-Ferrand, France 2005.
T. Benoist (2005). Algorithmes Gloutons et Recherche Locale pour le Car Sequencing Problem. In Roadef’05, Tours, February 2005.
T. Benoist (2004). Bornes supérieures pour le TV-Break Packing Problem. Journées Franciliennes de la Recherche Opérationnelle, juin 2004. Invité par Claude Lemaréchal.
T. Benoist, M. Diamantini et B. Rottembourg (2003). Relaxation Lagrangienne et filtrage par coûts réduits appliqués à la production d'électricité. In Roadef'03, Avignon, February 2003
T. Benoist, E. Gaudin et B. Rottembourg (2003). Programmation par contraintes et décomposition de Benders : une étude de cas. In Roadef'03, Avignon, February 2003
T. Benoist et B. Rottembourg (2003). Maintenance d'un réseau routier par relaxation lagrangienne. In Roadef'03, Avignon, February 2003
T. Benoist, E. Bourreau, E. Guyot et B. Rottembourg (2003). Optimisation de l'offre commerciale de l'espace publicitaire des chaînes du câble et du satellite. In Roadef'03, Avignon, February 2003
T. Benoist et B. Rottembourg (2003). Calcul de bornes supérieures du revenu d'un satellite d'observation. In Roadef'03, Avignon, February 2003
T. Benoist et C. Nicolas (2002). Optimisation des accouplements de coffrages sur un chantier de construction. In Roadef'02, Paris, February 2002
T. Benoist, E. Gaudin, B. Rottembourg (2001). Relaxation lagrangienne et programmation par contraintes pour la résolution de problèmes d’emplois du temps. In Francoro III, Quebec, CA, May 2001.

Links

LocalSolver
A new generation, hybrid mathematical programming solver


My web page on Eternity IITM
Research papers, instance data, source code...


Co-authors and fellow researchers


Eric Bourreau Narendra Jussien
Hadrien Cambazard François Laburthe
Yves Caseau Bruno Martin
Fabrice Chauvet Romain Megel
Julien Darlay Karim Nouioua
Bertrand Estellon Guillaume Rochart
Frédéric Gardi Benoît Rottembourg
Etienne Gaudin
Antoine Jeanjean
Vincent Jost


last revised February 5, 2014