Pages that link to "Item:Q1695036"

The following pages link to Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036):

Displaying 21 items.

• A constraint-based interactive train rescheduling tool (Q698087) (← links)
• A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany (Q1665246) (← links)
• Rescheduling railway traffic on real time situations using time-interval variables (Q2011607) (← links)
• Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays (Q2108176) (← links)
• A novel mixed integer programming model for freight train travel time estimation (Q2116880) (← links)
• Effective train routing selection for real-time traffic management: improved model and ACO parallel computing (Q2147150) (← links)
• Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances (Q2163779) (← links)
• A multi-objective optimization-simulation approach for real time rescheduling in dense railway systems (Q2184161) (← links)
• Timetable coordination in a rail transit network with time-dependent passenger demand (Q2239858) (← links)
• A decision making procedure for robust train rescheduling based on mixed integer linear programming and data envelopment analysis (Q2294838) (← links)
• A heuristic approach to solving the train traffic re-scheduling problem in real time (Q2331466) (← links)
• An integer linear programming model for integrated train stop planning and timetabling with time-dependent passenger demand (Q2669585) (← links)
• Real-time traffic control in railway systems (Q2917253) (← links)
• MILP formulations of cumulative constraints for railway scheduling -- a comparative study (Q2917320) (← links)
• A MIP-based local search method for the railway rescheduling problem (Q3076018) (← links)
• An Exact Decomposition Approach for the Real-Time Train Dispatching Problem (Q3195230) (← links)
• A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management (Q5129213) (← links)
• Set covering heuristics in a benders decomposition for railway timetabling (Q6047880) (← links)
• Capturing complexity over space and time via deep learning: an application to real-time delay prediction in railways (Q6168572) (← links)
• An efficient greedy heuristic for the real-time train platforming problem (Q6551135) (← links)
• Explainable real-time predictive analytics on employee workload in digital railway control rooms (Q6572886) (← links)