User Guide
Why can I only view 3 results?
You can also view all results when you are connected from the network of member institutions only. For non-member institutions, we are opening a 1-month free trial version if institution officials apply.
So many results that aren't mine?
References in many bibliographies are sometimes referred to as "Surname, I", so the citations of academics whose Surname and initials are the same may occasionally interfere. This problem is often the case with citation indexes all over the world.
How can I see only citations to my article?
After searching the name of your article, you can see the references to the article you selected as soon as you click on the details section.
 Views 16
 Downloands 3
A new method for solving the problem on the organization of wagon flows under condition of energy efficiency of transportation
2017
Journal:  
Eastern-European Journal of Enterprise Technologies
Author:  
Abstract:

The paper considers solving a problem of rational organization of wagon flows in a polygon of selected technological railroad stations using a technique for solving a knapsack problem employing set functions. Based on the results of present work, the authors developed a method for solving a knapsack-type problem that makes it possible to adapt the algorithm of solving a vector optimization problem to the rational system of organizing wagon flows in trains without using differentiation operations and to solve a basic optimization problem employing the Lagrange multipliers. The applicability of the Lagrange method was proved for the problems on a conditional extremum in terms of set functions. Its special feature is the rejection of Boolean variables. We confirmed correctness of the mathematical notation of solution to a knapsack-type problem and proved adequacy of the proposed algorithm, as well as adapted it for adjusting a plan of freight trains formation in order to improve energy efficiency of transportation. By reducing the complexity of the problem, it has become possible to reduce computer processor time needed for calculation, and employ this algorithm when designing an automated work place (AWP) for an engineer responsible for planning the formation of trains. It should be specially noted that a reduction of the time needed to solve a problem makes it possible to timely adjust the plan of freight trains formation, to eliminate a lot of irrational variants when handling wagons at technical stations. The proposed algorithm helps identify variants to direct train flows to the most promising destinations at minimal energy cost for transportation. Limitations of the proposed approach include a closed cycle of routes of the loaded wagons and part of these routes traveled unloaded until the next loading. In some cases, there is a need to change a weight of the train composition, associated with fractures of weight, and, therefore, a change in the balance between wagon flows and train flows.  Author Biographies Oleksandr Papakhov, Dnipropetrovsk National University of Railway Transport named after academician V. Lazaryan Lazaryana str., 2, Dnipro, Ukraine, 49010 PhD, Associate Professor Department of operational management

Keywords:

Citation Owners
Information: There is no ciation to this publication.
Similar Articles












Eastern-European Journal of Enterprise Technologies

Field :   Fen Bilimleri ve Matematik

Journal Type :   Uluslararası

Metrics
Article : 4.764
Cite : 4.485
2023 Impact : 0.294
Eastern-European Journal of Enterprise Technologies