Integer formulations of freight train design and scheduling problems

We consider the problem of cars-to-train assignments, routing and scheduling, which is to minimize the weighted average time of transportation orders execution by consistently choosing the compound of trains, their routes from origins to destinations, and schedules. We offer the new integer problem settings to account for different cases of practical constraints.