Publications by Matteo Salani | EPFL Graph Search

A rational decentralized generalized Nash equilibrium seeking for energy markets

Vasco Medici, Matteo Salani, Lorenzo Nespoli

We propose a method to design a decentralized energy market which guarantees individual rationality (IR) in expectation, in the presence of system-level grid constraints. We formulate the market as a welfare maximization problem subject to IR constraints, ...

IEEE2018

An integrated airline scheduling, fleeting and pricing model for a monopolized market

Michel Bierlaire, Matteo Salani, Bilge Atasoy

In airline schedule planning models, the demand and price information are usually taken as inputs to the model. Therefore, schedule and capacity decisions are taken separately from pricing decisions. In this article, we present an integrated scheduling, fl ...

Wiley-Blackwell2014

Impact analysis of a flexible air transportation system

Claudio Leonardi, Michel Bierlaire, Matteo Salani, Bilge Atasoy

The paper provides analytical evidence of the added-value of flexibility for air transportation systems. More specifically, the impact of a new innovative modular aircraft on the operations of an airline is deeply analyzed. The impact analysis is carried o ...

Editorial Board Ejtir2013

An exact algorithm for the integrated planning of berth allocation and quay crane assignment

Michel Bierlaire, Matteo Salani, Ilaria Vacca

In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch and pric ...

Informs2013

Integrated schedule planning with supply-demand interactions for a new generation of aircrafts

Michel Bierlaire, Matteo Salani, Bilge Atasoy

We present an integrated schedule planning model where the décisions of schedule design, fleeting and pricing are made simultaneously. Pricing is integrated through a logit demand model where itinerary choice is modeled by defining the utilities of the alt ...

2012

Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows

Matteo Salani, Ilaria Vacca

The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles' capacity and customer time windows. ...

2011

Uncertainty Feature Optimization: an implicit paradigm for problems with noisy data

Michel Bierlaire, Niklaus Eggenberg, Matteo Salani

Optimization problems with noisy data solved using stochastic programming or robust optimization approaches require the explicit characterization of an uncertainty set U that models the nature of the noise. Such approaches depend on the modeling of the unc ...

2011

A column generation algorithm for the vehicle routing problem with soft time windows

Matteo Salani

The Vehicle Routing Problem with Time Windows consists of computing a minimum cost set of routes for a fleet of vehicles of limited capacity visiting a given set of customers with known demand, with the additional constraint that each customer must be visi ...

2011

Ambush avoidance in Vehicle Routing for valuable delivery

Matteo Salani, Peter Swartz, Gaëtan Duyckaerts

2010

Modeling and Solving the Tactical Berth Allocation Problem

Matteo Salani, Ilaria Vacca

In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, whi ...

2010

Constraint-specific recovery networks for solving airline recovery problems

Michel Bierlaire, Niklaus Eggenberg, Matteo Salani

In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework that allows the consideration of operational constraints within a Column Gen ...

2010

Selected papers from the Triennial symposium on transportation analysis (TRISTAN), Phuket, Thailand, June 1115, 2007, Special Issue of Transportation Research Part C

Michel Bierlaire, Matteo Salani

2009

A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints

Matteo Salani

We present an optimization algorithm developed for a provider of software planning tools for distribution logistics companies. The algorithm computes a daily plan for a heterogeneous fleet of vehicles, that can depart from different depots and must visit a ...

2009

Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming

Matteo Salani

We present an exact optimization algorithm for the Orienteering Problem with Time Windows (OPTW). The algorithm is based on bi-directional and bounded dynamic programming with decremental state space relaxation. We compare different strategies proposed in ...

2009

New dynamic programming algorithms for the resource constrained shortest path problem

Matteo Salani

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...

2008

A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection

Matteo Salani

The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depot to a set of customers and the collection of waste from th ...

2006

Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Matteo Salani

When vehicle routing problems with additional constraints, such as capacity or time windows, are solved via column generation and branch-and-price, it is common that the pricing subproblem requires the computation of a minimum cost constrained path on a gr ...

2006