需求响应式公交系统路径优化算法

将需求响应式公交系统路径选择问题抽象为在图中寻找覆盖若干条指定边的欧拉圈问题，提出乘客数量不大于公交车容量和乘客数量大于公交车容量两种情况下的公交车运营组织方式，对第一种情况设计了有效的图论算法，对第二种方式则给出转化为动态规划问题的思路。论文引理证明，第一种算法能寻找到覆盖若干条指定边的最小欧拉圈，并通过有关算例进行了说明。

Optimal Path Algorithm for Demand Responsive Transit System

This paper discusses the problem of finding Euler circle covering some certain edges in urban traffic network. It comes from path selection problem in Demand Responsive Transit System, in which passengers distribute at certain streets. By providing two organization methods, settling a bus as soon as the reserving passengers getting certain amounts, say bus capacity, or settling a number of buses when the reserving passengers get more. This paper solves the first case by providing an algorithm to find the minimum Euler circle covering some certain edges. Then it offers some methods to transform the second case to a dynamic planning problem.