| dc.description.abstract | In recent years, with the increasing of universities in Taiwan, the number of students rises as a result. With this situation, the behavior of having inter-school classes appears. The University System of Taiwan is the best example. Nowadays, the inter-school bus is set up to service the teachers and students of The University System of Taiwan, but the schedule is manually performed by planning personnel with experience in current practice. Without a systematic analysis, it cannot satisfy the demands perfectly. Therefore, in this research, consider the properties of the inter-school bus problem and based on the perspective of school planner, we develop a system-optimized model. The model is expected to be an effective tool for the school, also, it can help planner to solve problems.
In this research, we employed network flow techniques and mathematical programming method, and build an inter-school bus scheduling model with many-to-many OD demand. The minimum number of vehicles and the minimum total weighted operating time is our target. In the network design, adds time window limit to meet the practical operating. Model is formulated as an integer multiple commodity network flow problem, which is characterized as NP-hard. To efficiently solve the problems whose sizes are expected to be huge in real practice, we developed a heuristic algorithm by use the problem decomposition strategy with CPLEX software. In addition, to evaluate the performance of inter-school bus model and solution algorithm practice, we take the University System of Taiwan as an example. Performing sensitive and scenario analysis for different parameters, and the result of the model test shows good. Finally, conclusions and suggestions are given.
Key words: Inter-school bus, Time-space network, Heuristic, Multiple commodity network flow problem.
| en_US |