Compromise, optimal and tractional accounts on Pareto set

Authors

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

DOI:

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

Keywords:

criterion function, expense of energy, dynamic programming

Abstract

The problem of optimum traction calculations is considered as a problem about optimum distribution of a resource. The dynamic programming solution is based on a step-by-step calculation of set of points of Pareto-optimum values of a criterion function (energy expenses) and a resource (time).

Author Biography

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

В. В. Лагута

Downloads

Published

2011-06-25

How to Cite

Lahuta, V. V. (2011). Compromise, optimal and tractional accounts on Pareto set. Science and Transport Progress. Bulletin of Dnipropetrovsk National University of Railway Transport, (37), 195–199. https://doi.org/10.15802/stp2011/9448

Issue

No. 37 (2011): ISSUE 37

Section

TRANSPORT AND ECONOMIC TASKS MODELING

License

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).