A set partitioning reformulation of a school bus scheduling problem

DOI10.1007/s10951-011-0234-0zbMath1229.90058OpenAlexW2088589818MaRDI QIDQ657252

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

integer linear programmingcutting planesset partitioningIP2single-depot vehicle scheduling with time windows

Mathematics Subject Classification ID

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

Related Items (1)

Column generation-based stochastic school bell time and bus scheduling optimization

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem with coupled time windows
• Solving a school bus scheduling problem with integer programming
• On the solution of traveling salesman problems
• Geometric algorithms and combinatorial optimization
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• A multicriteria approach for optimizing bus schedules and school starting times
• The Vehicle Routing Problem
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
• Deciding Linear Inequalities by Computing Loop Residues
• Optimierung des Schülerverkehrs durch gemischt ganzzahlige Programmierung
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
• On the facial structure of set packing polyhedra
• Selected Topics in Column Generation
• Blocking and anti-blocking pairs of polyhedra
• Efficient algorithms for integer programs with two variables per constraint.

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