We formulate a railroad caller districting problem into a mixed-integer program.
We address service reliability, district compactness, congruity and load balance.
The model is solved using a customized construction and local search heuristic.
Numerical cases with empirical data are used to demonstrate model performance.