2023
DOI: 10.1111/itor.13279
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the location problem of emergency attendance teams for a railroad through optimization

Abstract: Rail operators worldwide are seeing an increase in demand for services, driven by expanding global trade and the use of export commodities. Punctual service in a train stopped on the railroad is extremely important since the delay in service significantly impacts performance, asset utilization, and railroad productivity. The present work addresses the development and the solution of an optimization model for locating railway service teams that serve locomotives that need emergency maintenance on a Brazilian ra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 52 publications
0
2
0
Order By: Relevance
“…The papers by Cardei et al (2006), Plastria and Carrizosa (1999), Suzuki and Drezner (2003), Yang et al (2006), andBerman et al (2009) are typical examples of such approaches. More recently, Troian et al (2023) proposed a double coverage model for the location of attendance teams along railway lines and developed a hypercube algorithm for its solution.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The papers by Cardei et al (2006), Plastria and Carrizosa (1999), Suzuki and Drezner (2003), Yang et al (2006), andBerman et al (2009) are typical examples of such approaches. More recently, Troian et al (2023) proposed a double coverage model for the location of attendance teams along railway lines and developed a hypercube algorithm for its solution.…”
Section: Introductionmentioning
confidence: 99%
“…More recently, Troian et al. (2023) proposed a double coverage model for the location of attendance teams along railway lines and developed a hypercube algorithm for its solution.…”
Section: Introductionmentioning
confidence: 99%