Pages that link to "Item:Q2576699"

The following pages link to Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice (Q2576699):

Displaying 18 items.

• A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
• Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
• The vehicle routing problem with coupled time windows (Q926344) (← links)
• On single courier problem (Q941049) (← links)
• Planning personnel retraining: column generation heuristics (Q1631648) (← links)
• Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
• A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run (Q1665593) (← links)
• Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows (Q1996750) (← links)
• Electric bus planning \& scheduling: a review of related problems and methodologies (Q2140186) (← links)
• A study on flow decomposition methods for scheduling of electric buses in public transport based on aggregated time-space network models (Q2155124) (← links)
• Strategic planning of an underground mine with variable cut-off grades (Q2218873) (← links)
• Inbound and outbound flow integration for cross-docking operations (Q2240064) (← links)
• Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
• Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach (Q6060690) (← links)
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
• Scheduling the vehicles of bus rapid transit systems: a case study (Q6092519) (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
• Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem (Q6189811) (← links)