Modelling of freight trains classification using queueing system subject to breakdowns (Q459736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / review text
 
Summary: The paper presents a mathematical model and a simulation model of the freight trains classification process. We model the process as a queueing system with a server which is represented by a hump at a marshalling yard. We distinguish two types of shunting over the hump; primary shunting represents the classification of inbound freight trains over the hump (it is the primary function of marshalling yards), and secondary shunting is, for example, represented by the classification of trains of wagons entering the yard via industrial sidings. Inbound freight trains are considered to be customers in the system, and all needs of secondary shunting are failures of the hump because performing secondary shunting occupies the hump, and therefore inbound freight trains cannot be sorted. All random variables of the model are considered to be exponentially distributed with the exception of customer service times which are Erlang distributed. The mathematical model was created using method of stages and can be solved numerically employing a suitable software tool. The simulation model was created using coloured Petri nets. Both models are tested in conditions of a marshalling yard.
Property / review text: Summary: The paper presents a mathematical model and a simulation model of the freight trains classification process. We model the process as a queueing system with a server which is represented by a hump at a marshalling yard. We distinguish two types of shunting over the hump; primary shunting represents the classification of inbound freight trains over the hump (it is the primary function of marshalling yards), and secondary shunting is, for example, represented by the classification of trains of wagons entering the yard via industrial sidings. Inbound freight trains are considered to be customers in the system, and all needs of secondary shunting are failures of the hump because performing secondary shunting occupies the hump, and therefore inbound freight trains cannot be sorted. All random variables of the model are considered to be exponentially distributed with the exception of customer service times which are Erlang distributed. The mathematical model was created using method of stages and can be solved numerically employing a suitable software tool. The simulation model was created using coloured Petri nets. Both models are tested in conditions of a marshalling yard. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B22 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6354216 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/307652 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153632587 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59025882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An queueing system with no damage service interruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal management of the \(N\)-policy \(M/E_{k}/1\) queuing system with a removable service station: A sensitivity investigation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Control of an M/E k /1 Queueing System with Removable Service Station Subject to Breakdowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost analysis of the unloader queueing system with a single unloader subject to breakdown with two types of trailers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solvable queueing network model for railway networks and its validation and applications for the Netherlands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models of multiserver queuing system for dynamic performance evaluation in port / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4877483 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:19, 9 July 2024

scientific article
Language Label Description Also known as
English
Modelling of freight trains classification using queueing system subject to breakdowns
scientific article

    Statements

    Modelling of freight trains classification using queueing system subject to breakdowns (English)
    0 references
    0 references
    0 references
    13 October 2014
    0 references
    Summary: The paper presents a mathematical model and a simulation model of the freight trains classification process. We model the process as a queueing system with a server which is represented by a hump at a marshalling yard. We distinguish two types of shunting over the hump; primary shunting represents the classification of inbound freight trains over the hump (it is the primary function of marshalling yards), and secondary shunting is, for example, represented by the classification of trains of wagons entering the yard via industrial sidings. Inbound freight trains are considered to be customers in the system, and all needs of secondary shunting are failures of the hump because performing secondary shunting occupies the hump, and therefore inbound freight trains cannot be sorted. All random variables of the model are considered to be exponentially distributed with the exception of customer service times which are Erlang distributed. The mathematical model was created using method of stages and can be solved numerically employing a suitable software tool. The simulation model was created using coloured Petri nets. Both models are tested in conditions of a marshalling yard.
    0 references

    Identifiers