The school bus routing problem: a review
From MaRDI portal
Publication:1039772
DOI10.1016/j.ejor.2009.05.017zbMath1175.90339OpenAlexW2062361991MaRDI QIDQ1039772
Publication date: 23 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.017
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
A constant-factor approximation for directed latency in quasi-polynomial time ⋮ A branch-and-price algorithm for the ring-tree facility location problem ⋮ A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem ⋮ Modified differential evolution algorithms for multi-vehicle allocation and route optimization for employee transportation ⋮ The school bus problem on trees ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ The time‐consistent dial‐a‐ride problem ⋮ 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 ⋮ On constructing a family of student delivery routes in minimal time ⋮ The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Real-time passenger bus routing problems with preferences and tradeoffs ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Fleet management: a vehicle and driver assignment model ⋮ The Surgical Patient Routing Problem: A Central Planner Approach ⋮ Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ The cumulative school bus routing problem: Polynomial‐size formulations ⋮ Optimization of blood sample collection with timing and quality constraints ⋮ A post-improvement procedure for the mixed load school bus routing problem ⋮ A school bus scheduling problem ⋮ A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ The school bus routing and scheduling problem with transfers ⋮ Finding the nucleolus of the vehicle routing game with time windows ⋮ A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads ⋮ The demand weighted vehicle routing problem ⋮ Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints ⋮ Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach ⋮ An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Capacitated ring arborescence problems with profits ⋮ School bus routing—a column generation approach ⋮ A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Location-routing: issues, models and methods
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Solving a school bus scheduling problem with integer programming
- A hybrid evolution strategy for the open vehicle routing problem
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Methods for routing with time windows
- The fleet size and mix vehicle routing problem
- The savings algorithm for the vehicle routing problem
- Vehicles scheduling with sliding time windows
- An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems
- An approach for solving a class of transportation scheduling problems
- Combined location-routing problems: A synthesis and future research directions
- Separating capacity constraints in the CVRP using tabu search
- School-bus routing for program scheduling
- Coordinated transportation systems: An alternative approach to traditional independent systems
- A variable neighbourhood search algorithm for the open vehicle routing problem
- An improved ant colony optimization for vehicle routing problem
- Multi-objective vehicle routing problems
- Integer linear programming formulations of multiple salesman problems and its variations
- Scatter search for the vehicle routing problem with time windows
- The Vehicle Routing Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Scheduling School Buses
- Tabu search for a multi-objective routing problem
- Solving school bus routing problems through integer programming
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- The school bus routing problem: a case study
- A new tabu search heuristic for the open vehicle routing problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- A Location Based Heuristic for General Routing Problems
- Computer Solutions of the Traveling Salesman Problem
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
