Pages that link to "Item:Q1365052"
From MaRDI portal
The following pages link to Algorithms for railway crew management (Q1365052):
Displaying 39 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- The multiple team formation problem using sociometry (Q342525) (← links)
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
- Rostering in a rail passenger carrier (Q835560) (← links)
- The crew timetabling problem: an extension of the crew scheduling problem (Q867544) (← links)
- A column generation approach for the rail crew re-scheduling problem (Q869160) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Crew scheduling of light rail transit in Hong Kong: From modeling to implementation. (Q1406701) (← links)
- An integrated optimization model for train crew management (Q1610909) (← links)
- A model and computational tool for crew scheduling in train transportation of mine materials by using a local search strategy (Q1617107) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Optimizing railway crew schedules with fairness preferences (Q1707668) (← links)
- Workforce planning in a lotsizing mail processing problem (Q1781576) (← links)
- Human resources management at a marine container terminal (Q1877919) (← links)
- A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground (Q1888187) (← links)
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms (Q1929495) (← links)
- Modeling and algorithms of the crew rostering problem with given cycle on high-speed railway lines (Q1954542) (← links)
- An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport (Q1959179) (← links)
- An efficient column generation approach for practical railway crew scheduling with attendance rates (Q2030362) (← links)
- A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system (Q2259030) (← links)
- Railway crew scheduling: models, methods and applications (Q2286960) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- Short-term manpower planning for MRT carriage maintenance under mixed deterministic and stochastic demands (Q2430593) (← links)
- Effective search space control for large and/or complex driver scheduling problems (Q2468754) (← links)
- Two-level decomposition algorithm for crew rostering problems with fair working condition (Q2514878) (← links)
- On solving multi-type railway line planning problems (Q2569037) (← links)
- Vehicle and crew scheduling for urban bus lines (Q2575569) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- Modeling and solving the crew rostering problem (Q2781158) (← links)
- Staff rostering for the station personnel of a railway company (Q3585718) (← links)
- Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains (Q4692061) (← links)
- A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
- A genetic algorithm for public transport driver scheduling (Q5921677) (← links)
- A three-phase heuristic for the fairness-oriented crew rostering problem (Q6109557) (← links)
