2021
DOI: 10.1016/j.cie.2020.106916
|View full text |Cite
|
Sign up to set email alerts
|

Solving school bus routing problem with mixed-load allowance for multiple schools

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
6
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 30 publications
1
6
0
Order By: Relevance
“…This is due to the fact that our upper bound is derived from the lower bound solution, which is consistent with Ref. [37]. We modify the solution of the lower bound in three cases: (1) If the pick-up requests are being served by more than one EB; (2) If both the pick-up and drop-off requests are not being served; (3) If the pick-up and drop-off requests are partially served.…”
Section: A Real-world Scenariosupporting
confidence: 89%
“…This is due to the fact that our upper bound is derived from the lower bound solution, which is consistent with Ref. [37]. We modify the solution of the lower bound in three cases: (1) If the pick-up requests are being served by more than one EB; (2) If both the pick-up and drop-off requests are not being served; (3) If the pick-up and drop-off requests are partially served.…”
Section: A Real-world Scenariosupporting
confidence: 89%
“…They formulated the interactive mechanism between passengers and the operator in an integrated decision-making framework. Shang et al (2021) proposed a timediscretized dynamic programming-based school bus routing problem to design students commuting to different schools.…”
Section: Related Workmentioning
confidence: 99%
“…Mokhtari and Ghezavati [8] introduced a novel mixed-load SBRP and used a biobjective mixed integer linear programming formulation to model it. Shang et al [9] proposed a time-discretized multicommodity network flow model and transformed the SBRP into a quadratic 0-1 programming model with linear flow balance constraints. Ren et al [10] considered both school bus stop location and mixed-load routing problem and developed a mixed integer programming model for them.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Accurate algorithms are suitable for the problem which involves less data. Shang et al [9] decomposed the model into a series of linear multicommodity network flow subproblems when dealing with mixed-load SBRP and used dynamic programming algorithms to solve them. Owing to the continuous expansion of research data and the requirements placed upon computational efficiency, heuristic algorithms are a current research hotspot; examples of such algorithms include the tabu search, ant colony, and genetic algorithms, as well as PSO.…”
Section: Literature Reviewmentioning
confidence: 99%