A two year engineer position dedicated to 3D robot pallet loading is open within project Gril4all.
[Read more]
A three-year PhD position at EDF with the Inria center of the University of Bordeaux (EDGE team) is open.
[Read more]
[Read more]
A three-year PhD position at Saint-Gobain Recherche with the Inria center of the University of Bordeaux (EDGE team) is open.
[Read more]
[Read more]
A two year postdoc position in our team is open.
[Read more]
[Read more]
A one year engineer position in our team is open.
[Read more]
[Read more]
CATIE (Centre Aquitain des Technologies de l’Information et Électroniques) is a non-profit organization created in 2014 based in the Région Nouvelle-Aquitaine. As a technology resources center specialized in digital technology, its main mission is to support SMEs and intermediate size companies in their digital transformation and to help them embracing and integrating related technologies.
Our collaboration with CATIE is about machine learning and optimization. We focus on problems related to shortest path problem with side constraints.
[Read more]
EDF is the major French multinational electric utility company owned by the French state. Our collaboration is about solving the short-term hydro unit commitment and scheduling problem in a hydro valley using decomposition and aggregation techniques.
[Read more]
[Read more]
Renault is a French multinational automobile manufacturer established in 1899. The company produces a range of cars and vans and in the past, has manufactured trucks, tractors, tanks, buses/coaches, aircraft and aircraft engines, and autorail vehicles.
[Read more]
A C++ implementation of the Benders by batch algorithm for two-stage stochastic linear problems.
[Read more]
[Read more]
A six-month internship at the Inria center of the University of Bordeaux (EDGE team) is open.
[Read more]
[Read more]
Authors: Fulin Yan, François Clautiaux, Aurélien Froger
Abstract: Arc flow formulations derived from dynamic programs have been used to solve many hard combinatorial optimization problems. They generally have strong linear relaxations, but they may contain a pseudo-polynomial or exponential number of arcs, making [Read more]
Abstract: Arc flow formulations derived from dynamic programs have been used to solve many hard combinatorial optimization problems. They generally have strong linear relaxations, but they may contain a pseudo-polynomial or exponential number of arcs, making [Read more]
Authors: François Clautiaux, Pierre Pesneau
Abstract: In this document, we study integer linear programming formulations to find the maximum chordal subgraph of an arbitrary graph: given a graph $G = (V, E)$, find the largest subset $F \subseteq E$ such that $(V, F)$ is chordal. We propose and compare t [Read more]
Abstract: In this document, we study integer linear programming formulations to find the maximum chordal subgraph of an arbitrary graph: given a graph $G = (V, E)$, find the largest subset $F \subseteq E$ such that $(V, F)$ is chordal. We propose and compare t [Read more]
Authors: Arthur Léonard, François Clautiaux
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Authors: Fulin Yan, François Clautiaux, Aurélien Froger, Boris Albar
Abstract: In this work, we propose a generic heuristic for the resource-constrained shortest path problem derived from dynamic programming reformulations of hard combinatorial optimization problems. The approach is a machine-learning (ML)-augmented beam search [Read more]
Abstract: In this work, we propose a generic heuristic for the resource-constrained shortest path problem derived from dynamic programming reformulations of hard combinatorial optimization problems. The approach is a machine-learning (ML)-augmented beam search [Read more]
In November, we had the first workshop for project ACME et Ecole Nationale des Ponts et Chaussées.
Project ACME is funded by PEPR MOBIDEC. The program aims to mobilize the national research community and transportation ecosystem stakeholders to:
- Understand mobility of goods and peopleand anticipate the mobility of goods and people
- Help collect, structure, and interpret mobility data
- Provide decision-making tools to simulate the impact of public policies and evaluate the relevance of new transport solutions
Our projet studies optimization methods for horizontal collaboration in logistics.
[Read more]
Authors: Arthur Léonard, François Clautiaux
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Authors: Cécile Dupouy, François Clautiaux, Walid Klibi, Olivier Labarthe
Abstract: This work explores the integration of public transport networks for urban freight deliveries within the framework of Hyperconnected City Logistics (HCL), focusing on multi- stakeholder perspectives. By synergizing freight and passenger networks, the [Read more]
Abstract: This work explores the integration of public transport networks for urban freight deliveries within the framework of Hyperconnected City Logistics (HCL), focusing on multi- stakeholder perspectives. By synergizing freight and passenger networks, the [Read more]
Authors: François Clautiaux , Ivana Ljubić
Abstract: Mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is driven by the enhanced efficiency of modern solvers, which can today find globally optimal solutions within seconds for problems that were out of reach a [Read more]
Abstract: Mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is driven by the enhanced efficiency of modern solvers, which can today find globally optimal solutions within seconds for problems that were out of reach a [Read more]
Authors: Luis Marques, François Clautiaux, Aurélien Froger
Abstract: We study the problem of designing a cabinet made up of a set of shelves that contain compartments whose contents slide forward on opening. Considering a set of items candidate to be stored in the cabinet over a given time horizon, the problem is to d [Read more]
Abstract: We study the problem of designing a cabinet made up of a set of shelves that contain compartments whose contents slide forward on opening. Considering a set of items candidate to be stored in the cabinet over a given time horizon, the problem is to d [Read more]
The presentation is about the following submitted paper:
François Clautiaux, Siham Essodaigui, Alain Nguyen, Ruslan Sadykov, Nawel Younes. (2023). Models and algorithms for configuring and testing prototype cars. (hal-04185248)
Authors: François Clautiaux, Siham Essodaigui, Alain Nguyen, Ruslan Sadykov, Nawel Younes
Abstract: In this paper, we consider a new industrial problem, which occurs in the context of the automobile industry. This problem occurs during the testing phase of a new vehicle. It involves determining all the variants of the vehicle to be manufactured in [Read more]
Abstract: In this paper, we consider a new industrial problem, which occurs in the context of the automobile industry. This problem occurs during the testing phase of a new vehicle. It involves determining all the variants of the vehicle to be manufactured in [Read more]
Authors: Xavier Blanchot, François Clautiaux, Aurélien Froger, Manuel Ruiz
Abstract: In this paper, we study how a regulatory constraint limiting a measure of unserved demand, called Loss Of Load Expectation (LOLE), can be incorporated into a strategic version of a stochastic generation and transmission expansion planning problem. Th [Read more]
Abstract: In this paper, we study how a regulatory constraint limiting a measure of unserved demand, called Loss Of Load Expectation (LOLE), can be incorporated into a strategic version of a stochastic generation and transmission expansion planning problem. Th [Read more]
The project:
Project ACME is funded by PEPR MOBIDEC. The program aims to mobilize the national research community and transportation ecosystem stakeholders to:
- Understand mobility of goods and peopleand anticipate the mobility of goods and people
- Help collect, structure, and interpret mobility data
- Provide decision-making tools to simulate the impact of public policies and evaluate the relevance of new transport solutions
Our projet studies optimization methods for horizontal collaboration in logistics.
[Read more]
We consider general aggregation/disaggregation techniques to address optimization problems that are expressed with the help of sequential decision processes. Our main goals are threefold: a generic formalism that encompasses the aforementioned techniques ; more efficient algorithms to control the aggregation procedures ; open-source codes that leverage and integrate these algorithms to efficiently solve hard combinatorial problems in different application fields.
[Read more]
[Read more]
Supervisor
- François Clautiaux (Edge)
New results
Authors: Arthur Léonard, François Clautiaux
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Authors: Arthur Léonard, François Clautiaux
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Abstract: We propose a generic solver for computing integral flows in decision hypergraphs, subject to upper bound constraints on some hyperarcs. This framework captures an entire class of cutting problems, including the guillotine 2-dimensional knapsack probl [Read more]
Seminars
On s’intéresse au problème de maximiser la valeur d’un flot dans un hypergraphe de décision. Ce formalisme permet de modéliser toute une classe de problèmes de découpe guillotine, en particulier le problème du sac à dos guillotine 2D. Je présenterai notre algorithme de résolution, basé sur un algorithme d’étiquettes muni de bornes supérieures améliorées, issues de la programmation linéaire.
En particulier, je rappellerai la méthodologie de génération d’hyperarcs déjà introduite dans la littérature qui permet de résoudre le LP très rapidement en pratique sur de grosses instances, puis je présenterai nos inégalités valides, ainsi qu’une manière dont les bornes peuvent être incluses dans un algorithme d’étiquettes. Je présenterai également les résultats expérimentaux, qui démontrent l’efficacité de notre algorithme par rapport aux autres méthodes proposées dans la littérature.
[Read more]On s’intéresse au problème d’optimiser une fonction objectif \(g(W x) + c^T x\) pour \(x\) entier, où chaque coordonnée de \(x\) est contrainte dans un intervalle. On suppose que la matrice \(W\) est à coefficient entiers de valeur absolue bornée par \(\Delta\), et qu’elle projette \(x\) sur un espace de petite dimension \(m << n\). Ce problème est une généralisation du résultat de Hunkenschröder et al. dans lequel \(g\) est séparable convexe, et \(x\) est dans un \(0-1\) hypercube.
[Read more]