George Kiokes
George Kiokes has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Aris Dimeas
Power System Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9 Iroon Polytechniou St., 15780 Athens, Greece
2 shared publications - Andreas Gatos
Power System Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9 Iroon Polytechniou St., 15780 Athens, Greece
1 shared publication - Athanasios-Rafail Lagos
School of Electrical and Computer Engineering, National Technical University of Athens, Athens, Greece
1 shared publication - Emmanuel Karapidakis
Department of Electrical and Computer Engineering, Hellenic Mediterranean University, 71410 Heraklion, Greece
1 shared publication - Ioannis Karakitsios
Power System Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9 Iroon Polytechniou St., 15780 Athens, Greece
1 shared publication - Kyriakos Andresakis
Power System Laboratory, School of Electrical and Computer Engineering, National Technical University of Athens, 9 Iroon Polytechniou St., 15780 Athens, Greece
1 shared publication
Latest Publications
- Open Access
Benchmarking Copula-Based Scenario Models and Risk Criteria for Multi-Market BESS Scheduling in the Greek Electricity Market
This study presents an observed-day-ahead computational benchmark comparing Gaussian, Student-t, first-tree-truncated Gaussian D-vine, and single-parameter Clayton scenarios under expected-value (EV), lower-tail conditional value-at-risk (CVaR), and finite-scenario maximin scheduling of a 20 MWh/10 MW battery in the Greek electricity market. The day-ahead trajectory is fixed, and recourse decisions use complete daily scenarios. An 84-day experiment provides descriptive economic comparisons at finite solver gaps. An additional twelve-date assessment yields 67 accepted solutions out of 144, without a common accepted date across all four copulas under EV or CVaR. Independent recalculation verifies seven accepted EV–CVaR pairs with sampled lower-tail mean increases of EUR 0.17–10.40/day. These changes are interpreted descriptively in view of their magnitude relative to the objective gaps. Full-training D-vine ordering reproduces the historical chain for the supplied input. Source reconciliation identifies first-quarter-hour selection and a one-hour balancing-series offset across 5040 nominal rows in the exact workbook used by the additional experiment. The comparisons are conditional on this representation and assumed balancing-opportunity bounds; the retained records leave uncertainty about the source units and battery-specific interpretation. The study integrates dependence diagnostics, scheduling objectives, numerical precision, and input provenance within a computational benchmark, with operational market performance beyond its empirical scope.
Open AccessBenchmarking Copula-Based Scenario Models and Risk Criteria for Multi-Market BESS Scheduling in the Greek Electricity Market
This study presents an observed-day-ahead computational benchmark comparing Gaussian, Student-t, first-tree-truncated Gaussian D-vine, and single-parameter Clayton scenarios under expected-value (EV), lower-tail conditional value-at-risk (CVaR), and finite-scenario maximin scheduling of a 20 MWh/10 MW battery in the Greek electricity market. The day-ahead trajectory is fixed, and recourse decisions use complete daily scenarios. An 84-day experiment provides descriptive economic comparisons at finite solver gaps. An additional twelve-date assessment yields 67 accepted solutions out of 144, without a common accepted date across all four copulas under EV or CVaR. Independent recalculation verifies seven accepted EV–CVaR pairs with sampled lower-tail mean increases of EUR 0.17–10.40/day. These changes are interpreted descriptively in view of their magnitude relative to the objective gaps. Full-training D-vine ordering reproduces the historical chain for the supplied input. Source reconciliation identifies first-quarter-hour selection and a one-hour balancing-series offset across 5040 nominal rows in the exact workbook used by the additional experiment. The comparisons are conditional on this representation and assumed balancing-opportunity bounds; the retained records leave uncertainty about the source units and battery-specific interpretation. The study integrates dependence diagnostics, scheduling objectives, numerical precision, and input provenance within a computational benchmark, with operational market performance beyond its empirical scope.
- Open Access
Physics-Informed Transformer-Enhanced Graph Neural Networks with Rooted-Forest Repair for Distribution Network Reconfiguration
Distribution network reconfiguration requires switch-state decisions subject to topological and electrical constraints. This paper presents a graph-based surrogate with rooted-forest repair for a modified IEEE 69-bus, two-substation system. The model combines local graph propagation, node-index embeddings, global self-attention, multi-task prediction and physics-informed regularization. The model uses bus-level demand, distributed generation, network data and pre-decision electrical quantities, without including global scenario-scaling factors or the source-cost ratio as input features. The dataset contains 10,000 scenarios at a fixed source-cost ratio of 1.30. On 1500 held-out scenarios, the evaluated model achieved 100% repaired topological feasibility, 79.87% open-switch F1 and 24.93% exact-topology accuracy. A descriptive summary of five training runs yielded 80.09 ± 0.28% and 25.91 ± 0.90%, respectively. Mean inference-plus-repair time was 11.08 ms, compared with 0.151 s for Gurobi over 100 cases. Component-wise AC checks converged for 297 of 300 learned topologies, with no observed voltage or branch apparent-power violations among converged cases under relaxed source limits. The results support fast prediction with topological repair on this benchmark; source-capacity feasibility and optimality are not established by these checks.
Open AccessPhysics-Informed Transformer-Enhanced Graph Neural Networks with Rooted-Forest Repair for Distribution Network Reconfiguration
Distribution network reconfiguration requires switch-state decisions subject to topological and electrical constraints. This paper presents a graph-based surrogate with rooted-forest repair for a modified IEEE 69-bus, two-substation system. The model combines local graph propagation, node-index embeddings, global self-attention, multi-task prediction and physics-informed regularization. The model uses bus-level demand, distributed generation, network data and pre-decision electrical quantities, without including global scenario-scaling factors or the source-cost ratio as input features. The dataset contains 10,000 scenarios at a fixed source-cost ratio of 1.30. On 1500 held-out scenarios, the evaluated model achieved 100% repaired topological feasibility, 79.87% open-switch F1 and 24.93% exact-topology accuracy. A descriptive summary of five training runs yielded 80.09 ± 0.28% and 25.91 ± 0.90%, respectively. Mean inference-plus-repair time was 11.08 ms, compared with 0.151 s for Gurobi over 100 cases. Component-wise AC checks converged for 297 of 300 learned topologies, with no observed voltage or branch apparent-power violations among converged cases under relaxed source limits. The results support fast prediction with topological repair on this benchmark; source-capacity feasibility and optimality are not established by these checks.