An efficient solution methodology for the airport slot allocation problem with preprocessing and column generation

Airport coordination is a demand control mechanism that maximizes the use of existing infrastructure at congested airports. Aircraft operators submit a list of regular flights that they wish to operate over a five to seven-month period and a designated coordinator is responsible for allocating the available airport slots, which represent the permission to operate a … Read more

ADMM-based Unit and Time Decomposition for Price Arbitrage by Cooperative Price-Maker Electricity Storage Units

Decarbonization via the integration of renewables poses significant challenges for electric power systems, but also creates new market opportunities. Electric energy storage can take advantage of these opportunities while providing flexibility to power systems that can help address these challenges. We propose a solution method for the optimal control of multiple price-maker electric energy storage … Read more

Design of Poisoning Attacks on Linear Regression Using Bilevel Optimization

Poisoning attack is one of the attack types commonly studied in the field of adversarial machine learning. The adversary generating poison attacks is assumed to have access to the training process of a machine learning algorithm and aims to prevent the algorithm from functioning properly by injecting manipulative data while the algorithm is being trained. … Read more

Market Integration of Behind-the-Meter Residential Energy Storage

A new business opportunity beckons with the emergence of prosumers. This article proposes an innovative business model to harness the potential of aggregating behind-the-meter residential storage in which the aggregator compensates participants for using their storage system on an on-demand basis. A bilevel optimization model is developed to evaluate the potential of this proposed business … Read more

Adaptable Energy Management System for Smart Buildings

This paper presents a novel adaptable energy management system for smart buildings. In this framework we model the energy consumption of a living unit, and its energy exchange with the surroundings. We explicitly consider the impact of the outside environment and design features such as building orientation, automatic shading, and double facade. We formulate this … Read more

A note on the Lasserre hierarchy for different formulations of the maximum independent set problem

In this note, we consider several polynomial optimization formulations of the max- imum independent set problem and the use of the Lasserre hierarchy with these different formulations. We demonstrate using computational experiments that the choice of formulation may have a significant impact on the resulting bounds. We also provide theoretical justifications for the observed behavior. … Read more

Computational study of a branching algorithm for the maximum k-cut problem

This work considers the graph partitioning problem known as maximum k-cut. It focuses on investigating features of a branch-and-bound method to efficiently obtain global solutions. An exhaustive experimental study is carried out for two main components of a branch-and-bound algorithm: computing bounds and branching strategies. In particular, we propose the use of a variable neighborhood … Read more

Optimal time-and-level-of-use price setting for an energy retailer

This paper presents a novel price setting optimization problem for an energy retailer in the smart grid. In this framework the retailer buys energy from multiple generators via bilateral contracts, and sells it to a population of smart homes using Time-and-Level-of-Use prices (TLOU). TLOU is an energy price structure recently introduced in the literature, where … Read more

Near-optimal Robust Bilevel Optimization

Bilevel optimization studies problems where the optimal response to a second mathematical optimization problem is integrated in the constraints. Such structure arises in a variety of decision-making problems in areas such as market equilibria, policy design or product pricing. We introduce near-optimal robustness for bilevel problems, protecting the upper-level decision-maker from bounded rationality at the … Read more

CONICOPF: Conic relaxations for AC optimal power flow computations

Computational speed and global optimality are key needs for practical algorithms for the optimal power flow problem. Two convex relaxations offer a favorable trade-off between the standard second-order cone and the standard semidefinite relaxations for large-scale meshed networks in terms of optimality gap and computation time: the tight-and-cheap relaxation (TCR) and the quadratic convex relaxation … Read more