摘要
通过建模求解了2001年大学生数学建模竞赛B题,文中根据在最大程度上照顾乘客和公司双方的利益及调度方便的要求把该问题归结为多目标决策问题,利用逐段最优算法求出最优调度方案,并求得了发车时刻表及所需最少车辆数.
This paper designs a plan for dispatching buses, based on the premise that the interests of both passengers and BUS Company are largely considered, as well as easy dispatching, and the balance of work each bus. Applying multigoals programming to solve the problem, the method used is subsection optimum arithmetic.
出处
《大学数学》
2003年第5期39-41,共3页
College Mathematics
关键词
多目标优化理论
乘客及公司抱怨度
逐段最优算法
multi-goals optimum theory
the complaint index of passengers and Bus Company
subsection optimum arithmetic
