Solving a school bus scheduling problem with integer programming

DOI10.1016/j.ejor.2007.10.055zbMath1151.90007OpenAlexW2083115206MaRDI QIDQ954937

Armin Fügenschuh

Publication date: 18 November 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.055

zbMATH Keywords

vehicle schedulingreal-world applicationscoupled time windows

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Related Items (13)

Valid inequalities for the synchronization bus timetabling problem ⋮ The dial-A-ride problem with transfers ⋮ Optimal routing of multimodal mobility systems with ride‐sharing ⋮ The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment ⋮ Column generation-based stochastic school bell time and bus scheduling optimization ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows ⋮ A post-improvement procedure for the mixed load school bus routing problem ⋮ A school bus scheduling problem ⋮ A set partitioning reformulation of a school bus scheduling problem ⋮ The school bus routing and scheduling problem with transfers ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ The school bus routing problem: a review

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• A mixed-integer model for solving ordering problems with side constraints
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Technical Note—A Note on Zero-One Programming
• Faces for a linear inequality in 0–1 variables
• Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Computational Integer Programming and Cutting Planes
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Solving a school bus scheduling problem with integer programming