arbiter
JournalsAccount

Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach

Rajnish Kumar et al.

INFORMS Journal on Applied Analytics2018https://doi.org/10.1287/inte.2018.0950article
AJG 2ABDC B
Weight
0.46

Abstract

The authors developed a model based on constraint programming to provide the best feasible solution(s) for minimizing the dispatching delays within a given planning horizon.

8 citations

Open via your library →

Cite this paper

https://doi.org/https://doi.org/10.1287/inte.2018.0950

Or copy a formatted citation

@article{rajnish2018,
  title        = {{Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach}},
  author       = {Rajnish Kumar et al.},
  journal      = {INFORMS Journal on Applied Analytics},
  year         = {2018},
  doi          = {https://doi.org/https://doi.org/10.1287/inte.2018.0950},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.46

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.29 × 0.4 = 0.12
M · momentum0.80 × 0.15 = 0.12
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.