A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
From MaRDI portal
Publication:1711659
DOI10.1016/j.jda.2018.11.001zbMath1408.90042OpenAlexW2899806789WikidataQ128954728 ScholiaQ128954728MaRDI QIDQ1711659
Publication date: 18 January 2019
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/116689/1/paper.pdf
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An iterated local search heuristic for the split delivery vehicle routing problem
- A tabu search algorithm for the multi-period inspector scheduling problem
- A column generation approach for a school bus routing problem with resource constraints
- A post-improvement procedure for the mixed load school bus routing problem
- A school bus scheduling problem
- The school bus routing problem: a review
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- The school bus routing problem: an analysis and algorithm
- Algorithms for the variable sized bin packing problem
- A review of dynamic vehicle routing problems
- The Truck Dispatching Problem
- Split delivery routing
- The Split Delivery Vehicle Routing Problem: A Survey
- Savings by Split Delivery Routing
- A Greedy Heuristic for the Set-Covering Problem
- School bus routing—a column generation approach
- Reducibility among Combinatorial Problems
- Improvements to the Or-opt heuristic for the symmetric travelling salesman problem
- gCol
This page was built for publication: A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
