Grade compulations on Paret’s set with two indexes

Authors

  • V. V. Lahuta Dnipropetrovsk National University of Railway Transport named after Academician V. Lazaryan, Ukraine

DOI:

https://doi.org/10.15802/stp2011/6838

Keywords:

optimum traction calculations, dynamic programming, vector optimization in traction calculations, effective paths of train motion

Abstract

The problem of train traction calculations is considered as the one of resource allocation in a vector formulation.  The solution is based on dynamic programming using a set of points of the optimal Pareto objective function values (energy, time).

Author Biography

V. V. Lahuta, Dnipropetrovsk National University of Railway Transport named after Academician V. Lazaryan

В. В. Лагута

Published

2011-09-25

How to Cite

Lahuta, V. V. (2011). Grade compulations on Paret’s set with two indexes. Science and Transport Progress, (38), 194–200. https://doi.org/10.15802/stp2011/6838

Issue

Section

TRANSPORT AND ECONOMIC TASKS MODELING