Pages that link to "Item:Q1321800"
From MaRDI portal
The following pages link to A fast heuristic for the train scheduling problem (Q1321800):
Displaying 28 items.
- Optimizing schedules of rail train circulations by tabu search algorithm (Q460124) (← links)
- Optimizing the simplon railway corridor (Q475174) (← links)
- Locating optimal timetables and vehicle schedules in a transit line (Q490235) (← links)
- Optimising a coal rail network under capacity constraints (Q656055) (← links)
- Exact methods for the robotic cell problem (Q656059) (← links)
- Railway track allocation: Models and methods (Q657061) (← links)
- Exact train pathing (Q835603) (← links)
- Mathematical model applied to single-track line scheduling problem in Brazilian railways (Q904294) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
- Scheduling trains as a blocking parallel-machine job shop scheduling problem (Q1017462) (← links)
- Mathematical solutions for solving periodic railway transportation (Q1036453) (← links)
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations (Q1652116) (← links)
- Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints (Q1743650) (← links)
- Nominal and robust train timetabling problems (Q1926692) (← links)
- Balanced train timetabling on a single-line railway with optimized velocity (Q1991474) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- An efficient train scheduling algorithm on a single-track railway system (Q2327960) (← links)
- The train frequency compatibility problem (Q2328084) (← links)
- A branch and bound algorithm for scheduling trains in a railway network (Q2371354) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- The problem of trains formation and scheduling: integer statements (Q2441252) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- Heuristic techniques for single line train scheduling (Q2567841) (← links)
- An integer linear programming model for integrated train stop planning and timetabling with time-dependent passenger demand (Q2669585) (← links)
- An experimental study of bicriteria models for robust timetabling (Q2868921) (← links)
- Optimal algorithms for train shunting and relaxed list update problems (Q2918966) (← links)
