SOLVING MULTI-SCHOOL BUS ROUTING AND SCHEDULING PROBLEM
| dc.contributor.advisor | Haghani, Ali | en_US |
| dc.contributor.author | Wang, Zhongxiang | en_US |
| dc.contributor.department | Civil Engineering | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2017-09-13T05:33:22Z | |
| dc.date.available | 2017-09-13T05:33:22Z | |
| dc.date.issued | 2017 | en_US |
| dc.description.abstract | School bus routing and scheduling is of huge importance in school transportation system operations. It is usually treated as two separated problems and is solved sequentially. But it is shown that such separation will lead to a worse solution than solving them together with respect to the number of buses and travel time. The rationale behind it and the key point connecting routing and scheduling problem – trip compatibility – is thus deeply studied. A Mixed Integer Programming model is proposed along with a School Decomposition Algorithm. The model and algorithm are tested on eight sets of randomly-generated mid-size problems in comparison to the existing models. The results show that the proposed model and algorithm can find a better solution using up to 30% fewer buses than the best traditional models in a reasonable amount of time. | en_US |
| dc.identifier | https://doi.org/10.13016/M2639K564 | |
| dc.identifier.uri | http://hdl.handle.net/1903/19779 | |
| dc.language.iso | en | en_US |
| dc.subject.pqcontrolled | Transportation | en_US |
| dc.subject.pquncontrolled | Routing and Scheduling problem | en_US |
| dc.subject.pquncontrolled | School bus design | en_US |
| dc.subject.pquncontrolled | School decomposition algorithm | en_US |
| dc.subject.pquncontrolled | Trip compatibility | en_US |
| dc.title | SOLVING MULTI-SCHOOL BUS ROUTING AND SCHEDULING PROBLEM | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1