Article ID: | iaor20041666 |
Country: | China |
Volume: | 18 |
Issue: | 4 |
Start Page Number: | 46 |
End Page Number: | 49 |
Publication Date: | Jan 2002 |
Journal: | Journal of Mathematics for Technology |
Authors: | Wang Jun, Lu Chaorong |
Keywords: | scheduling, programming: integer |
This paper analyses the dispatch of public buses – a question from College Mathematical Modeling Competition – and sets up the achievement planning model and 0–1 planning model for dispatch. Assuming that passengers getting on or off at each bus stop are well-distributed, the writers specify the minimum of buses in motion is 52 by working out the solution to the models and list out the time of departure, including 225 shifts in up direction and 220 shifts in down direction. The models are simple and easy to solve and give consideration to conflicting interests.