Izabela Żółtowska

Dr. Izabela Żółtowska

Warsaw Univeristy of Technology
orcid

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 September 2009 in European Journal of Operational Research
Verified
Journal Article
Closed access
ETEugeniusz Toczyłowski
Eugeniusz Toczyłowski
IŻIzabela Żółtowska
Izabela Żółtowska

1 July 2003 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
Mariusz KaletaMariusz Kaleta
Mariusz Kaleta
WOWłodzimierz Ogryczak
Włodzimierz Ogryczak
ETEugeniusz Toczyłowski
Eugeniusz Toczyłowski
IŻIzabela Żółtowska
Izabela Żółtowska

4 August 2021 in Energies
Verified
Journal Article
Open access
PDF file
IŻIzabela Żółtowska
Izabela Żółtowska
JLJeremy Lin
Jeremy Lin
This study aims to plan a cost-minimizing charging schedule for electric buses with fast charging stations. The paper conceptualizes the problem as a three-stage procedure, which is oriented around the participation of an electric bus aggregator in a day-ahead energy auction. First, the aggregation stage determines the bid parameters of buses. With bid parameters, aggregated cost-minimizing charging plans are obtained in the second stage conceived as the hourly day-ahead auction. The disaggregation of hourly plans into feasible minutely charging schedules is the third stage. The main contribution is the formulation of mixed-integer linear programming aggregation models to determine charging availability expressed as minimum and maximum hourly energy requirements taking into account detailed, minutely characteristics and constraints of the charging equipment and the buses. No price forecasts are required, and the plans adjust to the wholesale prices of energy. Defining only a few aggregated bids parameters used in linear programming constraints and incorporating them into the auction model is another contributing factor of this paper, allowing the scheduling of storage-based participants economically. The proposed methodology has been verified on a recently published case study of a real-world bus service operated on the Ohio State University campus. We show that the auction-based charging of all 22 buses outperforms as-soon-as-possible schedules by 7% to even 28% of daily cost savings. Thanks to the aggregated bids, buses can flexibly shift charges between high- and low-price periods while preserving constraints of the charging equipment and timetables.

17 June 2022 in Computers & Operations Research
Verified
Journal Article
Open access
Mariusz KaletaMariusz Kaleta
Mariusz Kaleta
MKMałgorzata Kęsik-Brodacka
Małgorzata Kęsik-Brodacka
KNKarolina Nowak
Karolina Nowak
Robert OlszewskiRobert Olszewski
Robert Olszewski
TŚTomasz Śliwiński
Tomasz Śliwiński
IŻIzabela Żółtowska
Izabela Żółtowska
In this paper, we consider the problem of planning non-pharmaceutical interventions to control the spread of infectious diseases. We propose a new model derived from classical compartmental models; however, we model spatial and population-structure heterogeneity of population mixing. The resulting model is a large-scale non-linear and non-convex optimisation problem. In order to solve it, we apply a special variant of covariance matrix adaptation evolution strategy. We show that results obtained for three different objectives are better than natural heuristics and, moreover, that the introduction of an individual's mobility to the model is significant for the quality of the decisions. We apply our approach to a six-compartmental model with detailed Poland and COVID-19 disease data. The obtained results are non-trivialand sometimes unexpected; therefore, we believe that our model could be applied to support policy-makers in fighting diseases at the long-term decision-making level.

1 January 2016 in Energy Economics
Verified
Journal Article
Closed access
IŻIzabela Żółtowska
Izabela Żółtowska

11 September 2015 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
IŻIzabela Żółtowska
Izabela Żółtowska
Auctions with non-convexities, as considered in this paper, use a multi-period optimal power flow (OPF) model based on generators' offers to calculate efficient schedules. The standard locational marginal prices (LMPs) may not support these schedules and uplifts are needed to help the generators break even. This paper presents a direct minimum-uplift (DMU) pricing model, which is formulated as a mixed integer linear programming problem with uplift minimization objective. New DMU prices are major variables constrained with decomposition formula based on shift factors, similar to the actual practice of developing LMPs. The remaining constraints reflect the generators' profits and uplifts modeled as functions of the DMU prices. The main feature of the DMU model is individual rationality attained in pool-based auction, under prices properly reflecting network constraints, complemented with minimum uplifts. The model is validated on several cases, including the IEEE 24-node system.