Locomotive Assignment Problem with Heterogeneous Vehicle Fleet and Hiring

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F15%3A00227411" target="_blank" >RIV/68407700:21260/15:00227411 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.scopus.com/inward/record.url?eid=2-s2.0-84925310763&partnerID=MN8TOARS" target="_blank" >http://www.scopus.com/inward/record.url?eid=2-s2.0-84925310763&partnerID=MN8TOARS</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1155/2015/583909" target="_blank" >10.1155/2015/583909</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Locomotive Assignment Problem with Heterogeneous Vehicle Fleet and Hiring

Popis výsledku v původním jazyce

This paper focuses on solving the problem of how to assign locomotives to assembled trains optimally. To solve the problem, linear programming is applied. The situation we model in the paper occurs in the conditions of a transport operator that providesrail transport in the Czech Republic. In the paper, an extended locomotive assignment problem is modeled; the transport operator can use different classes of the locomotives to serve individual connections, some connections must be served by a predefinedlocomotive class, and the locomotives can be allocated to several depots at the beginning. The proposed model also takes into consideration the fact that some connections can be served by the locomotives of external transport companies or operators. Thepresented model is applied to a real example in order to test its functionality.

Název v anglickém jazyce

Locomotive Assignment Problem with Heterogeneous Vehicle Fleet and Hiring

Popis výsledku anglicky

This paper focuses on solving the problem of how to assign locomotives to assembled trains optimally. To solve the problem, linear programming is applied. The situation we model in the paper occurs in the conditions of a transport operator that providesrail transport in the Czech Republic. In the paper, an extended locomotive assignment problem is modeled; the transport operator can use different classes of the locomotives to serve individual connections, some connections must be served by a predefinedlocomotive class, and the locomotives can be allocated to several depots at the beginning. The proposed model also takes into consideration the fact that some connections can be served by the locomotives of external transport companies or operators. Thepresented model is applied to a real example in order to test its functionality.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JO - Pozemní dopravní systémy a zařízení

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Mathematical Problems in Engineering

ISSN

1024-123X

e-ISSN

—

Svazek periodika

2015

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

7

Strana od-do

—

Kód UT WoS článku

000352388600001

EID výsledku v databázi Scopus

2-s2.0-84925310763