Gleb Belov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Gleb Belov has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
G. Scheithauer
6 shared publications- Mark Wallace
Monash University
4 shared publications - Maria Garcia de la Banda
Monash University, Australia
3 shared publications - Michael Wybrow
Monash University, Melbourne, Australia
3 shared publications - Tobias Czauderna
Faculty of Applied Computer Sciences and Biosciences , University of Applied Sciences Mittweida , Mittweida , Germany
3 shared publications Guntram Scheithauer
Institute of Numerical Mathematics, Technische Universität Dresden, Mommsenstr. 13, 01062 Dresden, Germany
2 shared publications
Latest Publications
- Open Access
Refresh Rate-Based Caching and Prefetching Strategies for Internet of Things Middleware
One of the research directions in Internet of Things (IoT) is the field of Context Management Platforms (CMPs) which is a specific type of IoT middleware. CMPs provide horizontal connectivity between vertically oriented IoT silos resulting in a noticeable difference in how IoT data streams are processed. As these context data exchanges can be monetised, there is a need to model and predict the context metrics and operational costs of this exchange to provide relevant and timely context in a large-scale IoT ecosystem. In this paper, we argue that caching all transient context information to satisfy this necessity requires large amounts of computational and network resources, resulting in tremendous operational costs. Using Service Level Agreements (SLAs) between the context providers, CMP, and context consumers, where the level of service imperfection is quantified and linked to the associated costs, we show that it is possible to find efficient caching and prefetching strategies to minimize the context management cost. So, this paper proposes a novel method to find the optimal rate of IoT data prefetching and caching. We show the main context caching strategies and the proposed mathematical models, then discuss how a correctly chosen proactive caching strategy and configurations can help to maximise the profit of CMP operation when multiple SLAs are defined. Our model is accurate up to 0.0016 in Root Mean Square Percentage Error against our simulation results when estimating the profits to the system. We also show our model is valid using the t-test value tending to 0 for all the experimental scenarios.
Open AccessRefresh Rate-Based Caching and Prefetching Strategies for Internet of Things Middleware
One of the research directions in Internet of Things (IoT) is the field of Context Management Platforms (CMPs) which is a specific type of IoT middleware. CMPs provide horizontal connectivity between vertically oriented IoT silos resulting in a noticeable difference in how IoT data streams are processed. As these context data exchanges can be monetised, there is a need to model and predict the context metrics and operational costs of this exchange to provide relevant and timely context in a large-scale IoT ecosystem. In this paper, we argue that caching all transient context information to satisfy this necessity requires large amounts of computational and network resources, resulting in tremendous operational costs. Using Service Level Agreements (SLAs) between the context providers, CMP, and context consumers, where the level of service imperfection is quantified and linked to the associated costs, we show that it is possible to find efficient caching and prefetching strategies to minimize the context management cost. So, this paper proposes a novel method to find the optimal rate of IoT data prefetching and caching. We show the main context caching strategies and the proposed mathematical models, then discuss how a correctly chosen proactive caching strategy and configurations can help to maximise the profit of CMP operation when multiple SLAs are defined. Our model is accurate up to 0.0016 in Root Mean Square Percentage Error against our simulation results when estimating the profits to the system. We also show our model is valid using the t-test value tending to 0 for all the experimental scenarios.
- Open Access
- 1 June 2023
- Published by Springer Nature in Constraints
- Vol. 28 (2) , 203-243
Human-centred feasibility restoration in practice
Decision systems for solving real-world combinatorial problems must be able to report infeasibility in such a way that users can understand the reasons behind it, and determine how to modify the problem to restore feasibility. Current methods mainly focus on reporting one or more subsets of the problem constraints that cause infeasibility. Methods that also show users how to restore feasibility tend to be less flexible and/or problem-dependent. We describe a problem-independent approach to feasibility restoration that combines existing techniques from the literature in novel ways to yield meaningful, useful, practical, and flexible user support. We evaluated the resulting framework on three real-world applications and conducted a qualitative expert user study with participants from different application domains.
- 1 June 2023
- Published by Springer Nature in Constraints
- Vol. 28 (2) , 203-243
Open AccessHuman-centred feasibility restoration in practice
Decision systems for solving real-world combinatorial problems must be able to report infeasibility in such a way that users can understand the reasons behind it, and determine how to modify the problem to restore feasibility. Current methods mainly focus on reporting one or more subsets of the problem constraints that cause infeasibility. Methods that also show users how to restore feasibility tend to be less flexible and/or problem-dependent. We describe a problem-independent approach to feasibility restoration that combines existing techniques from the literature in novel ways to yield meaningful, useful, practical, and flexible user support. We evaluated the resulting framework on three real-world applications and conducted a qualitative expert user study with participants from different application domains.
- 14 January 2020
- Published by Springer Nature in Journal of Heuristics
- Vol. 26 (2) , 269-300
Logistics optimization for a coal supply chain
- 14 January 2020
- Published by Springer Nature in Journal of Heuristics
- Vol. 26 (2) , 269-300
Logistics optimization for a coal supply chain
- 23 August 2018
- Published by Springer Nature
- p. 473-489
Process Plant Layout Optimization: Equipment Allocation
- 23 August 2018
- Published by Springer Nature
- p. 473-489
Process Plant Layout Optimization: Equipment Allocation
- 23 August 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 321-337
An Optimization Model for 3D Pipe Routing with Flexibility Constraints
- 23 August 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 321-337
An Optimization Model for 3D Pipe Routing with Flexibility Constraints
- 1 August 2017
- Published by International Joint Conferences on Artificial Intelligence
- p. 473-479
Estimating the size of search trees by sampling with domain knowledge
We show how recently-defined abstract models of the Branch-and-Bound algorithm can be used to obtain information on how the nodes are distributed in B&B search trees. This can be directly exploited in the form of probabilities in a sampling algorithm given by Knuth that estimates the size of a search tree. This method reduces the offline estimation error by a factor of two on search trees from Mixed-Integer Programming instances.
- 1 August 2017
- Published by International Joint Conferences on Artificial Intelligence
- p. 473-479
Estimating the size of search trees by sampling with domain knowledge
We show how recently-defined abstract models of the Branch-and-Bound algorithm can be used to obtain information on how the nodes are distributed in B&B search trees. This can be directly exploited in the form of probabilities in a sampling algorithm given by Knuth that estimates the size of a search tree. This method reduces the offline estimation error by a factor of two on search trees from Mixed-Integer Programming instances.
- 23 August 2016
- Published by Springer Nature
- p. 49-65
Improved Linearization of Constraint Programming Models
- 23 August 2016
- Published by Springer Nature
- p. 49-65
Improved Linearization of Constraint Programming Models
- 1 January 2014
- Published by Springer Nature
- p. 159-175
Local Search for a Cargo Assembly Planning Problem
- 1 January 2014
- Published by Springer Nature
- p. 159-175
Local Search for a Cargo Assembly Planning Problem
- 1 April 2013
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 61 (2) , 483-497
LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
We consider the feasibility problem OPP (orthogonal packing problem) in higher-dimensional orthogonal packing: given a set of d-dimensional (d ≥ 2) rectangular items, decide whether all of them can be orthogonally packed in the given rectangular container without rotation. The one-dimensional (1D) “bar” LP relaxation of OPP reduces the latter to a 1D cutting-stock problem where the packing of each stock bar represents a possible 1D stitch through an OPP layout. The dual multipliers of the LP provide us with another kind of powerful bounding information (conservative scales). We investigate how the set of possible 1D packings can be tightened using the overlapping information of item projections on the axes, with the goal to tighten the relaxation. We integrate the bar relaxation into an interval-graph algorithm for OPP, which operates on such overlapping relations. Numerical results on 2D and 3D instances demonstrate the efficiency of tightening leading to a speedup and stabilization of the algorithm.
- 1 April 2013
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 61 (2) , 483-497
LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
We consider the feasibility problem OPP (orthogonal packing problem) in higher-dimensional orthogonal packing: given a set of d-dimensional (d ≥ 2) rectangular items, decide whether all of them can be orthogonally packed in the given rectangular container without rotation. The one-dimensional (1D) “bar” LP relaxation of OPP reduces the latter to a 1D cutting-stock problem where the packing of each stock bar represents a possible 1D stitch through an OPP layout. The dual multipliers of the LP provide us with another kind of powerful bounding information (conservative scales). We investigate how the set of possible 1D packings can be tightened using the overlapping information of item projections on the axes, with the goal to tighten the relaxation. We integrate the bar relaxation into an interval-graph algorithm for OPP, which operates on such overlapping relations. Numerical results on 2D and 3D instances demonstrate the efficiency of tightening leading to a speedup and stabilization of the algorithm.
- 1 October 2012
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (10) , 2425-2438
LP bounds in various constraint programming approaches for orthogonal packing
- 1 October 2012
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (10) , 2425-2438
LP bounds in various constraint programming approaches for orthogonal packing