Guglielmo Lulli

Guglielmo Lulli

Auto-generated profile, based on publicly available information

Guglielmo Lulli

Università degli Studi di Milano-Bicocca

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2011 in Operations Research
Verified
Journal Article
Closed access
DBDimitris Bertsimas
Dimitris Bertsimas
GLGuglielmo Lulli
Guglielmo Lulli
AOAmedeo Odoni
Amedeo Odoni
This paper presents a new integer programming (IP) model for large-scale instances of the air traffic flow management (ATFM) problem. The model covers all the phases of each flight—i.e., takeoff, en route cruising, and landing—and solves for an optimal combination of flow management actions, including ground-holding, rerouting, speed control, and airborne holding on a flight-by-flight basis. A distinguishing feature of the model is that it allows for rerouting decisions. This is achieved through the imposition of sets of “local” conditions that make it possible to represent rerouting options in a compact way by only introducing some new constraints. Moreover, three classes of valid inequalities are incorporated into the model to strengthen the polyhedral structure of the underlying relaxation. Computational times are short and reasonable for practical application on problem instances of size comparable to that of the entire U.S. air traffic management system. Thus, the proposed model has the potential of serving as the main engine for the preliminary identification, on a daily basis, of promising air traffic flow management interventions on a national scale in the United States or on a continental scale in Europe.

1 November 2007 in Transportation Science
Verified
Journal Article
Closed access
GLGuglielmo Lulli
Guglielmo Lulli
AOAmedeo Odoni
Amedeo Odoni
Air traffic flow management in Europe has to deal as much with capacity constraints in en route airspace as with the more usual capacity constraints at airports. The en route sector capacity constraints, in turn, generate complex interactions among traffic flows. We present a deterministic optimization model for the European air traffic flow management (ATFM) problem. The model designs flow management strategies involving combinations of ground and airborne holding. The paper illustrates the complex nature of European (EU) ATFM solutions, the benefits that can be obtained by purposely assigning airborne holding delays to some flights, and the issues of equity that arise as a result of the interactions among traffic flows. In particular, we show that, in certain circumstances, it is better, in terms of total delay and delay cost, to assign to a flight a more expensive airborne holding delay than a ground delay. We also show that in the EU ATFM context, fundamental conflicts may often arise between the objectives of efficiency and equity (or “fairness”). This finding may have profound implications for the possibility of developing a “collaborative decision-making” environment for air traffic flow management in Europe.

1 June 2004 in Management Science
Verified
Journal Article
Closed access
GLGuglielmo Lulli
Guglielmo Lulli
SSSuvrajeet Sen
Suvrajeet Sen
In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications.

1 September 2014 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
LCLuca Corolli
Luca Corolli
GLGuglielmo Lulli
Guglielmo Lulli
LNLewis Ntaimo
Lewis Ntaimo

19 April 2017 in IEEE Transactions on Power Systems
Verified
Journal Article
Open access
SASemih Atakan
Semih Atakan
GLGuglielmo Lulli
Guglielmo Lulli
SSSuvrajeet Sen
Suvrajeet Sen
In this paper, we present the state-transition formulation for the unit commitment (UC) problem. This formulation uses new decision variables that capture the state transitions of the generators, instead of their on/off statuses. We show that this new approach produces a formulation which naturally includes valid inequalities, commonly used to strengthen other formulations. We demonstrate the performance of the state-transition formulation and observe that it leads to improved solution times especially in longer time-horizon instances. As an important consequence, the new formulation allows us to solve realistic instances in less than 12 minutes on an ordinary desktop PC, leading to a speed-up of a factor of almost two, in comparison to the nearest contender. Finally, we demonstrate the value of considering longer planning horizons in UC problems.

23 May 2008
Verified
Book Chapter
Closed access
PDF file
DBDimitris Bertsimas
Dimitris Bertsimas
GLGuglielmo Lulli
Guglielmo Lulli
AOAmedeo Odoni
Amedeo Odoni