The school bus routing and scheduling problem with transfers
From MaRDI portal
Publication:4642460
DOI10.1002/net.21589zbMath1390.90055OpenAlexW2063039911WikidataQ41814872 ScholiaQ41814872MaRDI QIDQ4642460
Karl F. Doerner, Sophie N. Parragh, Michael Bögl
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21589
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Optimal routing of multimodal mobility systems with ride‐sharing ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Dynamic courier routing for a food delivery service ⋮ Solving routing problems with pairwise synchronization constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A post-improvement procedure for the mixed load school bus routing problem
- A school bus scheduling problem
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Solving a school bus scheduling problem with integer programming
- The school bus routing problem: a review
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- Temporal constraint networks
- Variable neighborhood search
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Variable neighborhood search for the dial-a-ride problem
- Solving school bus routing problems through integer programming
- A new tabu search heuristic for the open vehicle routing problem
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
This page was built for publication: The school bus routing and scheduling problem with transfers
