01626115

Component

https://doi.org/10.3141/2667-03

School bus planning is usually divided into routing and scheduling because of the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than from solving them together. When the minimal number of trips in the routing problem is being determined, neglecting trip compatibility could increase the number of buses needed in the scheduling problem. This paper proposes a new formulation for the multischool homogeneous fleet routing problem that maximizes trip compatibility while minimizing total travel time. This plan incorporates the trip compatibility for the scheduling problem in the routing problem. A proposed heuristic algorithm for solving this problem decomposes the problem by schools. To compare the performance of the model with traditional routing problems, eight midsize data sets were generated. Importing the generated trips of the routing problems into the bus scheduling (blocking) problem shows that the proposed model can reduce the buses needed by up to 25%. A sensitivity analysis on coefficients of the model illustrates the effect of the weight of trip compatibility.

01658386

17-01977

English

pp 17–27

2017

Transportation Research Record: Journal of the Transportation Research Board

9780309460446

Digital/other

Figures (6) ; References (33) ; Tables (2)

Optimization; Routing; Scheduling; School buses; School trips; Sensitivity analysis

Blocking (Schedules)

Highways; Operations and Traffic Management; Planning and Forecasting; Public Transportation

TRIS, TRB, ATRI

Dec 8 2016 10:42AM

• Characterization of Trip-Level Pace Variability Based on Taxi GPS Trajectory Data
• Consistency Between Convergence of Dynamic Assignment and Stochasticity of Microsimulation: Implication for Number of Runs
• Effectiveness of Predictive Weather-Related Active Transportation and Demand Management Strategies for Network Management
• Estimating Path Travel Costs for Heterogeneous Users on Large-Scale Networks: Heuristic Approach to Integrated Activity-Based Model–Dynamic Traffic Assignment Models
• Estimation of Time-Varying Origin–Destination Patterns for Design of Multipath Progression on a Signalized Arterial
• Improved Calibration Method for Dynamic Traffic Assignment Models: Constrained Extended Kalman Filter
• Maximization of Platoon Formation Through Centralized Routing and Departure Time Coordination
• Monitoring Signalized Urban Networks: Dynamic Equilibrium-Free Model Based on a Discrete-Time Optimal Control Formulation
• Multiclass Traffic Assignment Problem with Flow-Dependent Passenger Car Equivalent Value of Trucks
• Multiclass, Multicriteria Dynamic Traffic Assignment with Path-Dependent Link Cost and Entropy-Based Risk Preference
• Online Charging and Routing of Electric Vehicles in Stochastic Time-Varying Networks
• Reducing the Dimension of Online Calibration in Dynamic Traffic Assignment Systems
• Ridesharing User Equilibrium and Its Implications for High-Occupancy Toll Lane Pricing
• User and Operator Perspectives in Public Transport Timetable Synchronization Design