Basic Background for Minimum Fuel Consumption Algorithms in Traction

583 Ogledov
200 Prenosov
Izvoz citacije: ABNT
LENART, Lado ;KOS, Leon ;KARIŽ, Zoran .
Basic Background for Minimum Fuel Consumption Algorithms in Traction. 
Strojniški vestnik - Journal of Mechanical Engineering, [S.l.], v. 45, n.9, p. 310-320, july 2017. 
ISSN 0039-2480.
Available at: <https://www.sv-jme.eu/sl/article/basic-background-for-minimum-fuel-consumption-algorithms-in-traction/>. Date accessed: 25 feb. 2020. 
doi:http://dx.doi.org/.
Lenart, L., Kos, L., & Kariž, Z.
(1999).
Basic Background for Minimum Fuel Consumption Algorithms in Traction.
Strojniški vestnik - Journal of Mechanical Engineering, 45(9), 310-320.
doi:http://dx.doi.org/
@article{.,
	author = {Lado  Lenart and Leon  Kos and Zoran  Kariž},
	title = {Basic Background for Minimum Fuel Consumption Algorithms in Traction},
	journal = {Strojniški vestnik - Journal of Mechanical Engineering},
	volume = {45},
	number = {9},
	year = {1999},
	keywords = {Slovenian Railways; timetables planning; algorithms; fuel consumption; },
	abstract = {The design of algorithms for solving some low level problems in timetable planning for Slovenian railways is described. The main aim is the use of the minimum amount of fuel. The algorithms are based on a solution of a variational problem with extensions to various types of boundary conditions. The use of the Hamiltonian theory has been avoided and the solutions are based on more simple derivations.},
	issn = {0039-2480},	pages = {310-320},	doi = {},
	url = {https://www.sv-jme.eu/sl/article/basic-background-for-minimum-fuel-consumption-algorithms-in-traction/}
}
Lenart, L.,Kos, L.,Kariž, Z.
1999 July 45. Basic Background for Minimum Fuel Consumption Algorithms in Traction. Strojniški vestnik - Journal of Mechanical Engineering. [Online] 45:9
%A Lenart, Lado 
%A Kos, Leon 
%A Kariž, Zoran 
%D 1999
%T Basic Background for Minimum Fuel Consumption Algorithms in Traction
%B 1999
%9 Slovenian Railways; timetables planning; algorithms; fuel consumption; 
%! Basic Background for Minimum Fuel Consumption Algorithms in Traction
%K Slovenian Railways; timetables planning; algorithms; fuel consumption; 
%X The design of algorithms for solving some low level problems in timetable planning for Slovenian railways is described. The main aim is the use of the minimum amount of fuel. The algorithms are based on a solution of a variational problem with extensions to various types of boundary conditions. The use of the Hamiltonian theory has been avoided and the solutions are based on more simple derivations.
%U https://www.sv-jme.eu/sl/article/basic-background-for-minimum-fuel-consumption-algorithms-in-traction/
%0 Journal Article
%R 
%& 310
%P 11
%J Strojniški vestnik - Journal of Mechanical Engineering
%V 45
%N 9
%@ 0039-2480
%8 2017-07-07
%7 2017-07-07
Lenart, Lado, Leon  Kos, & Zoran  Kariž.
"Basic Background for Minimum Fuel Consumption Algorithms in Traction." Strojniški vestnik - Journal of Mechanical Engineering [Online], 45.9 (1999): 310-320. Web.  25 Feb. 2020
TY  - JOUR
AU  - Lenart, Lado 
AU  - Kos, Leon 
AU  - Kariž, Zoran 
PY  - 1999
TI  - Basic Background for Minimum Fuel Consumption Algorithms in Traction
JF  - Strojniški vestnik - Journal of Mechanical Engineering
DO  - 
KW  - Slovenian Railways; timetables planning; algorithms; fuel consumption; 
N2  - The design of algorithms for solving some low level problems in timetable planning for Slovenian railways is described. The main aim is the use of the minimum amount of fuel. The algorithms are based on a solution of a variational problem with extensions to various types of boundary conditions. The use of the Hamiltonian theory has been avoided and the solutions are based on more simple derivations.
UR  - https://www.sv-jme.eu/sl/article/basic-background-for-minimum-fuel-consumption-algorithms-in-traction/
@article{{}{.},
	author = {Lenart, L., Kos, L., Kariž, Z.},
	title = {Basic Background for Minimum Fuel Consumption Algorithms in Traction},
	journal = {Strojniški vestnik - Journal of Mechanical Engineering},
	volume = {45},
	number = {9},
	year = {1999},
	doi = {},
	url = {https://www.sv-jme.eu/sl/article/basic-background-for-minimum-fuel-consumption-algorithms-in-traction/}
}
TY  - JOUR
AU  - Lenart, Lado 
AU  - Kos, Leon 
AU  - Kariž, Zoran 
PY  - 2017/07/07
TI  - Basic Background for Minimum Fuel Consumption Algorithms in Traction
JF  - Strojniški vestnik - Journal of Mechanical Engineering; Vol 45, No 9 (1999): Strojniški vestnik - Journal of Mechanical Engineering
DO  - 
KW  - Slovenian Railways, timetables planning, algorithms, fuel consumption, 
N2  - The design of algorithms for solving some low level problems in timetable planning for Slovenian railways is described. The main aim is the use of the minimum amount of fuel. The algorithms are based on a solution of a variational problem with extensions to various types of boundary conditions. The use of the Hamiltonian theory has been avoided and the solutions are based on more simple derivations.
UR  - https://www.sv-jme.eu/sl/article/basic-background-for-minimum-fuel-consumption-algorithms-in-traction/
Lenart, Lado, Kos, Leon, AND Kariž, Zoran.
"Basic Background for Minimum Fuel Consumption Algorithms in Traction" Strojniški vestnik - Journal of Mechanical Engineering [Online], Volume 45 Number 9 (07 July 2017)

Avtorji

Inštitucije

  • Institute Jožef Štefan, Ljubljana, Slovenia
  • Slovenian Railways, Ljubljana, Slovenia
  • University of Ljubljana, Faculty of Mechanical Engineering, Slovenia

Informacije o papirju

Strojniški vestnik - Journal of Mechanical Engineering 45(1999)9, 310-320

The design of algorithms for solving some low level problems in timetable planning for Slovenian railways is described. The main aim is the use of the minimum amount of fuel. The algorithms are based on a solution of a variational problem with extensions to various types of boundary conditions. The use of the Hamiltonian theory has been avoided and the solutions are based on more simple derivations.

Slovenian Railways; timetables planning; algorithms; fuel consumption;