Solving a school bus scheduling problem with integer programming

DOI10.1016/J.EJOR.2007.10.055MaRDI QIDQ954937zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Solving school bus routing problems through integer programming
• A school bus scheduling problem
• School bus routing and scheduling problem
• Allocation of School Bus Contracts By Integer Programming
• The school bus routing and scheduling problem with transfers
• Publication:5284026
• A set partitioning reformulation of a school bus scheduling problem
• School-bus routing for program scheduling
• An Algorithm for Bus Scheduling Problems
• The school bus routing problem: an analysis and algorithm

Cites work

• scientific article; zbMATH DE number 5016779 (Why is no real title available?)
• scientific article; zbMATH DE number 1749226 (Why is no real title available?)
• scientific article; zbMATH DE number 2144390 (Why is no real title available?)
• 2-path cuts for the vehicle routing problem with time windows
• A mixed-integer model for solving ordering problems with side constraints
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Computational Integer Programming and Cutting Planes
• Faces for a linear inequality in 0–1 variables
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• Technical Note—A Note on Zero-One Programming

Cited in

(19)

• Solving school bus routing problems through integer programming
• Allocation of School Bus Contracts By Integer Programming
• Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows
• Column generation-based stochastic school bell time and bus scheduling optimization
• Optimal routing of multimodal mobility systems with ride‐sharing
• Combining constraint programming and linear programming on an example of bus driver scheduling
• Scheduling School Buses
• The school bus routing and scheduling problem with transfers
• A set partitioning reformulation of a school bus scheduling problem
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector
• Valid inequalities for the synchronization bus timetabling problem
• The dial-A-ride problem with transfers
• A multicriteria approach for optimizing bus schedules and school starting times
• A post-improvement procedure for the mixed load school bus routing problem
• A school bus scheduling problem
• The school bus routing problem: a review
• Public transport for smart cities: recent innovations and future challenges
• The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954937)