Flexible unit commitment of a network-constrained combined heat and power system

Alvaro Gonzalez-Castellanos; Priyanko Guha Thakurta; Aldo Bischi

Home/Archive/arXiv

arXiv · 1809.09508

Flexible unit commitment of a network-constrained combined heat and power system

Alvaro Gonzalez-Castellanos·Priyanko Guha Thakurta·Aldo Bischi

View original source ↗Read source document ↗Export metadata ↓

Abstract

Large Combined Heat and Power (CHP) plants are often employed in order to feed district heating networks, in Europe, in post soviet countries and China. Traditionally they have been operated following the thermal load with the electric energy considered as a by-product, while the modern trend includes them in the electric market to take advantage of the flexibility they could provide. This implies the necessity to consider the impact on the electric grid while filling the thermal load requests. A detailed Mixed Integer Linear Programming (MILP) optimization model for the solution of the network-constrained CHP unit commitment of the day-ahead operation is introduced. The developed model accounts for lossless DC network approximation of the electric power flow constraints, as well as a detailed characterization of the CHP units with useful effect, heat and power, function of one and two independent variables ("degrees-of-freedom"), and thermal energy storage. A computational validation of the outlined model on a CHP test system with multiple heating zones is presented in the form of computational test cases. The test cases illustrate the impact on the flexibility of the implementation of the energy storage, network constraints and joint multi-system operation. The conducted studies have highlighted the importance of a comprehensive and integrated analysis of multi-energy systems to exploit the operational flexibility provided by the cogeneration units. The joint operation of the thermal and electric system allows to reap economic, operational efficiency, and environmental benefits. The developed model can be easily extended to include diverse multi-energy systems and technologies, as well as more complex representations of the energy transmission networks, and the modeling of renewable energy resources dependent of one or more independent, weather-related, variables.

Explore related subjects

math.OC

Keep this discovery

BibTeX RIS

Alvaro Gonzalez-Castellanos, Priyanko Guha Thakurta, Aldo Bischi. 2018-09-25. Flexible unit commitment of a network-constrained combined heat and power system. https://arxiv.org/abs/1809.09508

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC↗

arXiv2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC↗

arXiv2026

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC↗