102 research outputs found

    Problems of choosing optimal solutions for systems with random and non-random perturbations

    No full text
    The problem of choosing an optimal solution in stochastic optimization problem containing both random perturbations with given distributions and nonrandom perturbations about which only the regions of their possible values are known. As a criterion of optimality, the quantile criterion is used, i.e. The objective function value guaranteed with some given probability is optimised. This problem is closely connected with the problem of the construction confidence estimates for a statistically uncertain random vector that is a random vector with an incompletely known distribution. A concept of the generalized confidence set is used for statistically uncertain vector, and its properties are studied. The quantile stochastic optimization problem under incomplete information is solved by means of an optimal choice of the generalized confidence region. © 2017 Author(s)

    Evaluation of origin-destination matrices based on analysis of data on transport passenger flows

    No full text
    The problem of reconstructing the origin-destination matrix for transport following fixed routes is studied. Estimates are based on statistics on passengers entering and leaving at each stop. Various models for estimating of origin-destination matrices are analyzed, including the entropy model and the generalized gravitational model. The properties of correspondences of duplicating and complementary routes are taken into account for comparing the models. © 2021 Author(s)

    Changes in properties of the transport network graph when using simplification algorithms

    No full text
    In the course of solving problems of managing and planning the development of large transport networks, a big amount of heterogeneous data from various sources is accumulated. The methods of graph theory are used to systematize information, process it, and calculate network characteristics. However, the problem arises of the enormous complexity and duration of computations over graphs of large networks. One of the approaches to solve this problem is the simplification of the original graph. In our report we study the influence of processing and basic graph simplification on the initial properties of the network. © 2019 Author(s).Russian Foundation for Basic Research, RFBR: number17-08-01123-aThe investigation was funded by RFBR, project number17-08-01123-a
    corecore