摘要
对 2 0 0 1年全国大学生数学建模竞赛的 B题——公交车调度问题进行了分析 ,建立了调度的目标规划模型及 0— 1规划模型 .在假设各站上、下车人数服从均匀分布的条件下 ,通过对模型的求解 ,求出了公交公司的最小运行车辆数 5 2辆 ,并给出了发车时刻表 ,其中上行方向运行 2 2 5班次 ,下行方向运行 2 2 0班次 .该模型简单 ,求解容易 。
This paper analyses the dispatch of public buses-a question from College Mathematical Modeling Competition, and set 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 respective interests.
出处
《工科数学》
2002年第4期46-49,共4页
Journal of Mathematics For Technology
