Loading...
Please wait, while we are loading the content...
Similar Documents
The school bus routing and scheduling problem with mixed loads and transfers
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bögl, Michael Doerner, Karl F. Parragh, Sophie N. Kepler, Johannes |
| Copyright Year | 2012 |
| Abstract | The school bus routing and scheduling problem deals with the transportation of pupils from home to school in the morning and from school to home in the evening. It is a problem in public transportation and differs from typical vehicle routing problems in several aspects, as for example pointed out in [6]. Variants of this problem are often studied in literature. A comprehensive overview of existing publications can be found in [4], with recent contributions, e.g., in [3, 5, 6]. This work is motivated by a real life problem with about 2400 pupils, 230 bus stations and 22 schools, where the area of operation is mostly rural. We consider the so called morning problem only, i.e., the transportation of the pupils to their respective school before it begins. The process is the same for every day, i.e., no periodic planning is necessary and a feasible solution for a single day can be used during the whole school year. The goal is to generate an efficient transportation plan (according to some objective) so that every pupil arrives at school on time. Our approach takes into account bus stop selection, bus routing and bus scheduling. Further, we consider multiple schools and pupils of different schools may share a single bus, which is referred to as mixed loads. Pupils can also change the bus during their way to school, which is called transfers. Transfers have not yet been extensively studied in the context of the school bus routing problem [5]. Transfers in the context of goods are for example described in Cortés et al. [1] using a pickup and delivery problem formulation. They have a predefined set of transfer points. In our case, every bus stop can be a transfer point. The literature distinguishes between the routing problem and the scheduling problem. School bus routing calculates the bus trips which are then scheduled to buses. Hence, a trip is serviced by a single bus but a bus may serve multiple trips. A model for handling routing and scheduling in a single model was proposed by Spada et al. [7]. In this work we handle both aspects of the problem. Our approach is based on the school bus scheduling model of Fügenschuh [2]. They propose a model |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://homepage.univie.ac.at/sophie.parragh/wp-content/uploads/2015/04/verolog_2012_boegl_doerner_parragh.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
