Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
From MaRDI portal
Publication:2576699
DOI10.1007/s00291-005-0207-9zbMath1091.90018OpenAlexW2026014147MaRDI QIDQ2576699
Natalia Kliewer, Vitali Gintner, Leena M. Suhl
Publication date: 14 December 2005
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-005-0207-9
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (18)
Planning personnel retraining: column generation heuristics ⋮ Electric bus planning \& scheduling: a review of related problems and methodologies ⋮ A study on flow decomposition methods for scheduling of electric buses in public transport based on aggregated time-space network models ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ Mixed integer programming based heuristics for the patient admission scheduling problem ⋮ A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run ⋮ Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Scheduling the vehicles of bus rapid transit systems: a case study ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ Strategic planning of an underground mine with variable cut-off grades ⋮ The vehicle routing problem with coupled time windows ⋮ On single courier problem ⋮ Inbound and outbound flow integration for cross-docking operations ⋮ Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows ⋮ Stabilized dynamic constraint aggregation for solving set partitioning problems ⋮ Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
This page was built for publication: Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
