Mark Petrovich Bezmaslov

Mr. Mark Petrovich Bezmaslov

Saint Petesburg State University, Saint Petersburg, Sankt-Peterburg, Russia
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
18 October 2022 in Computation
Verified
Journal Article
Open access
PDF file
MBMark Petrovich Bezmaslov
Mark Petrovich Bezmaslov
DBDaniil Belyaev
Daniil Belyaev
VVVladimir Vasilev
Vladimir Vasilev
EDElizaveta Dolgintseva
Elizaveta Dolgintseva
LYLyubov Yamshchikova
Lyubov Yamshchikova
Ovanes PetrosianOvanes Petrosian
Ovanes Petrosian
This article covers a case study with homes equipped with multiple appliances for energy consumption. The central goal is to provide for aggregators’ flexibility in distribution networks by building an optimal schedule that takes advantage of load flexibility resources. This, in turn, allows for the re-scheduling of shifting/real-time home appliances to provision a request from a distribution system operator (DSO). The paper concludes with the consideration of the CBCC-RDG3, HyDE-DF, and genetic algorithms, which were used to find the best schedule that would be highly efficient and meet all the constraints associated with the problem that successfully demonstrate the effectiveness of this particular approach.

26 December 2025 in Smart Cities
Verified
Journal Article
Open access
PDF file
TCTatiana Churiakova
Tatiana Churiakova
IPIvan Platonov
Ivan Platonov
MBMark Petrovich Bezmaslov
Mark Petrovich Bezmaslov
VBVadim Bikbulatov
Vadim Bikbulatov
Ovanes PetrosianOvanes Petrosian
Ovanes Petrosian
SMSergey Mityagin
Sergey Mityagin
Metropolitan service-placement optimization is computationally challenging under strict evaluation budgets and regulatory constraints. Existing approaches either neglect capacity constraints, producing infeasible solutions, or employ population-based metaheuristics requiring hundreds of evaluations—beyond typical municipal planning resources. We introduce a two-stage optimization framework combining Bayesian optimization with domain-informed heuristics to address this constrained, mixed discrete–continuous problem. Stage 1 optimizes continuous service area allocations via the Tree-structured Parzen Estimator with empirical gradient prioritization, reducing effective dimensionality from 81 services to 10–15 per iteration. Stage 2 converts allocations into discrete unit placements via efficiency-ranked bin packing, ensuring regulatory compliance. Evaluation across 35 benchmarks on Saint Petersburg, Russia (117–3060 decision variables), demonstrates that our method achieves 99.4% of the global optimum under a 50-evaluation budget, outperforming BIPOP-CMA-ES (98.4%), PURE-TPE (97.1%), and NSGA-II (96.5%). Optimized configurations improve equity (Gini coefficient of 0.318 → 0.241) while maintaining computational feasibility (2.7 h for 109-block districts). Open-source implementation supports reproducibility and facilitates adoption in metropolitan planning practice.