Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Radio Electronics, C...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Radio Electronics, Computer Science, Control
Article . 2020 . Peer-reviewed
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Radio Electronics, Computer Science, Control
Article
License: CC BY SA
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

METHOD OF SOLUTION OF COMPLEX OPTIMIZATION PROBLEM FOR FORMATION OF COMPONENT COLUMN OF TECHNIQUE AND ROUTE SELECTION OF ITS MOVEMENT BY NON-STATIONARY ROAD NETWORK

Authors: Borovyk, O. V.; Rachok, R. V.; Borovyk, L. V.; Basaraba, I. O.;

METHOD OF SOLUTION OF COMPLEX OPTIMIZATION PROBLEM FOR FORMATION OF COMPONENT COLUMN OF TECHNIQUE AND ROUTE SELECTION OF ITS MOVEMENT BY NON-STATIONARY ROAD NETWORK

Abstract

Context. Effective solution of a number of application problems related to transportation, as a rule, depends on the solution of two problems: the correct formation of the composition of the column of technique and the successful choice of the route of its movement. Each of the problems is optimization, the methods of solving which are currently being worked out. Theoretical studies of each of the individual problems and their practical applications indicate their interdependence, which has not yet been fully studied. Practical applications necessitate the development of a suitable scientific and methodological apparatus.Objective. The purpose of this work is development of a method for solving a complex optimization problem of forming a column of vehicles and choosing the route of its movement on a non-stationary road network.Method. The mathematical model of solving the optimization problem of complex formation of the composition of the column of machinery and the choice of its route of motion is proposed. A heterogeneous set was used to describe the array from which the vehicles were selected. A graph was used to describe the road network. As a criterion for the optimality of the complex problem is the minimization of time spent on moving. The peculiarity of the model is to take into account the possibility of dynamically changing the time weights of edges of the graph when implementing the movement of a column of machinery along the chosen route. Based on the use of this model, a method is proposed, which provides a comprehensive choice of the composition of the column of equipment and optimal routes of its movement on a non-stationary road network.Results. The article proposes an algorithm that provides the solution of the optimization problem of complex formation of the composition of machinery column and the choice of its route of motion in terms of time-fixed edges that describe the network of roads. The features of application of the proposed algorithm are given. Using the developed software, the choice of technique from an existing inhomogeneous array and the choice of a route on a graph with a non-stationary time weight of edges was investigated. The example shows the imperfection of decisions regarding the complex formation of the column composition and the choice of its optimal route of travel on a non-stationary network of roads obtained using classical methods.Conclusions. Not taking into account the impact of a possible change in traffic conditions, as evidenced by a change in the time weights of the edges of the graph describing the road network, on the composition of the column of machinery can lead to suboptimality of the obtained solutions using classical methods of forming the composition of the column and finding the shortest route in the graph. The method proposed in this study can be used to obtain the optimum composition of the column and the route, taking into account the change in road conditions during the movement of the column. The obtained results extend the possibilities of the theory of discrete optimization and the theory of graphs.

Related Organizations
Keywords

Kомплексность, оптимизационная задача, граф, нестационарность, метод., Комплексність, оптимізаційна задача, граф, нестаціонарність, метод., Complexity, optimization problem, graph, non-stationarity, method.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
gold