Pages that link to "Item:Q2459391"

The following pages link to Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem (Q2459391):

Displaying 18 items.

• A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern (Q319599) (← links)
• Optimizing schedules of rail train circulations by tabu search algorithm (Q460124) (← links)
• A hybrid soft computing approach for subset problems (Q474017) (← links)
• A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters (Q657257) (← links)
• A model for bus crew scheduling problem with multiple duty types (Q714275) (← links)
• Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation (Q1642066) (← links)
• The driver and vehicle routing problem (Q1651584) (← links)
• A column generation based hyper-heuristic to the bus driver scheduling problem (Q1723438) (← links)
• Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820) (← links)
• An efficient multistart heuristic for the driver and vehicle routing problem (Q2108177) (← links)
• Set covering problem with conflict constraints (Q2147026) (← links)
• A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (Q2327625) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern (Q2355861) (← links)
• Integrated Vehicle Scheduling and Vehicle Assignment (Q4584652) (← links)
• Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
• An Integrated Vehicle-Crew-Roster Problem with Days-Off Pattern (Q5232823) (← links)
• The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)