2018
DOI: 10.1016/j.trb.2018.09.004
|View full text |Cite
|
Sign up to set email alerts
|

SpeedRoute: Fast, efficient solutions for school bus routing problems

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(7 citation statements)
references
References 31 publications
0
7
0
Order By: Relevance
“…Accordingly, a bi-objective function was designed to solve the bus-routing problem with maximum trip compatibility and minimum total travel time. In comparison with the traditional single-load solving algorithm, this method improved the total efficiency by approximately 25% (Shafahi et al, 2018). Eguizábal et al (2018) divided SBRP into two sub-problems: bus route generation and bus fleet planning.…”
Section: Multiple-school School Bus Routing Problem (M-sbrp) Without mentioning
confidence: 99%
“…Accordingly, a bi-objective function was designed to solve the bus-routing problem with maximum trip compatibility and minimum total travel time. In comparison with the traditional single-load solving algorithm, this method improved the total efficiency by approximately 25% (Shafahi et al, 2018). Eguizábal et al (2018) divided SBRP into two sub-problems: bus route generation and bus fleet planning.…”
Section: Multiple-school School Bus Routing Problem (M-sbrp) Without mentioning
confidence: 99%
“…After they obtained an initial solution, the authors improved it with LS, TS, and SA. On the other hand, Shafahi et al [20] used Minimum Cost Matching-Based Insertion and improved a hybrid solution using TS and SA.…”
Section: Rq5: What Kind Of Solution Methods Are Used In the Area Of S...mentioning
confidence: 99%
“…The STM generally consists of a list of tabu rules which exist for a set tenure before being dropped from the tabu list. Hybrids of the two algorithms have been shown in a number of recent combinatorial optimization studies to perform better than pure TS or SA alone [1,2,31,47].…”
Section: Hybrid Tabu Search/simulated Annealing Solution Algorithmmentioning
confidence: 99%