Recherche

Afficher tous les résultats pour

Accueil

Publication

DUCT: An upper confidence bound approach to distributed constraint optimization problems

Publications associées (27)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Data-based model maintenance in the era of industry 4.0: A methodology

Dimitrios Kyritsis, Antoine Pélissier, Foivos Psarommatis Giannakopoulos

Despite the high number of investments for data-based models in the expansion of Industry 4.0, too little effort has been made to ensure the maintenance of those models. In a data-streaming environment, data-based models are subject to concept drifts. A co ...

ELSEVIER SCI LTD2022

Integrating advanced discrete choice models in mixed integer linear optimization

Michel Bierlaire, Meritxell Pacheco Paneque, Bernard Gendron

In many transportation systems, a mismatch between the associated design and planning decisions and the demand is typically encountered. A tailored system is not only appealing to operators, which could have a better knowledge of their operational costs, b ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Automated Design: A Journey Across Modelling, Optimization, and Education

Cyril Picard

Machine intelligence greatly impacts almost all domains of our societies. It is profoundly changing the field of mechanical engineering with new technical possibilities and processes. The education of future engineers also needs to adapt in terms of techni ...

EPFL2021

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

ASSOC COMPUTING MACHINERY2021

A Novel Decomposition Solution Approach for the Restoration Problem in Distribution Networks

Sidi-Rachid Cherkaoui, Hossein Sekhavatmanesh

The distribution network restoration problem is by nature a mixed integer and non-linear optimization problem due to the switching decisions and Optimal Power Flow (OPF) constraints, respectively. The link between these two parts involves logical implicati ...

IEEE Institute of Electrical and Electronics Engineers2020

The electric autonomous dial-a-ride problem

Claudia Bongiovanni

This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a ...

EPFL2020

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Cong Wang, Roman Rudnik, Jagdish Prasad Achara

An electric vehicle (EV) charging method which considers the EVs heterogeneity, taking into account the absence of any information about future arrivals and departures, and of the amount of time any charging will take. The method further considers both swi ...

2020

A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features

Ali H. Sayed, Sulaiman A S A E Alghunaim, Ming Yan

This work studies multi-agent sharing optimization problems with the objective function being the sum of smooth local functions plus a convex (possibly non-smooth) function coupling all agents. This scenario arises in many machine learning and engineering ...

IEEE2020

Waste collection inventory routing with non-stationary stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We solve a rich routing problem inspired from practice, in which a heterogeneous fixed fleet is used for collecting recyclable waste from large containers over a finite planning horizon. Each container is equipped with a sensor that communicates its level ...

PERGAMON-ELSEVIER SCIENCE LTD2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Page 2 sur 3

ASSOC COMPUTING MACHINERY2021

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

Jean-Yves Le Boudec, Mario Paolone, Lorenzo Enrique Reyes Chamorro, Cong Wang, Roman Rudnik, Jagdish Prasad Achara

2020