摘要
本文把公交网络优化归纳为拟设线路起讫点站的配对优化及线路走向优化两个方面。起讫点配对优化采用数学规划中的“指派问题”(AssignmentProblem)方法,并以全服务区换乘次数最少(即直达乘客运输量最大)为目标;线路走向优化采用捷路法,以乘客总乘行时间(或乘行距离)最短为目标。该方法成功地解决了以往公交优化中普遍存在的“维数灾难”问题,能获得最优解。此外,本文提出了公交客流交通分配方法、线路客流分布均匀性检验及线路停靠能力检验等方法。
In this paper,the optimization of public traffic network is summarized as
two aspects:The optimum pair of O—D stops(points)for intended lines and the
optimal trend of lines.The former takes the method of“Assignment problem”
in mathematical programming with the aim of maximum quantity of nonstop
passengers;the latter takes the method of shortcut with the aim of minimization
of time or distance for passengers.They are successful in solving the problem
known as“catastrophe of dimensionality”in optimization.Besides,the methods
of traffic allocation,the inspection of passengers'well-distribution,and the
capacity pause of lines are advanced as well.
出处
《系统工程》
CSCD
1990年第2期42-49,共8页
Systems Engineering
基金
国家自然科学基金
