A set partitioning reformulation of a school bus scheduling problem

DOI10.1007/S10951-011-0234-0MaRDI QIDQ657252zbMATH OpenOpenAlexFDO

Authors Armin Fügenschuh

Publication date 16 January 2012

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-011-0234-0

zbMATH Keywords

cutting planesinteger linear programmingset partitioningIP2single-depot vehicle scheduling with time windows

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Traffic problems in operations research (90B20)

Recommendations

• Solving a school bus scheduling problem with integer programming
• Scheduling School Buses
• scientific article; zbMATH DE number 5016779
• Solving school bus routing problems through integer programming
• A constraint programming pre-processor for a bus driver scheduling system

Cites work

• scientific article; zbMATH DE number 5016779 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1749223 (Why is no real title available?)
• scientific article; zbMATH DE number 1749226 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
• A multicriteria approach for optimizing bus schedules and school starting times
• Blocking and anti-blocking pairs of polyhedra
• Deciding Linear Inequalities by Computing Loop Residues
• Efficient algorithms for integer programs with two variables per constraint.
• Geometric algorithms and combinatorial optimization
• Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
• On the facial structure of set packing polyhedra
• On the solution of traveling salesman problems
• Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung
• School bus routing and scheduling problem
• Selected Topics in Column Generation
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Solving a school bus scheduling problem with integer programming
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• The vehicle routing problem
• The vehicle routing problem with coupled time windows
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Towards a Genuinely Polynomial Algorithm for Linear Programming

Cited in

(6)

• Scheduling School Buses
• An extension of set partitioning with application to scheduling problems
• Allocation of School Bus Contracts By Integer Programming
• Solving a school bus scheduling problem with integer programming
• On the integer properties of scheduling set partitioning models
• Column generation-based stochastic school bell time and bus scheduling optimization

Describes a project that uses

Uses Software

• VRP
• CPLEX

This page was built for publication: A set partitioning reformulation of a school bus scheduling problem

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