基于网络治理的公交服务总效益和各主体决策分析

为解决我国公交服务效率与公平难以兼容问题,本文引入网络治理理论假定政府、企业和社会群体三方合作的基础上,从最大化公交服务效益构建公交服务网络治理模型,剖析政府、企业和社会群体努力水平、控制权配置和产出效率对公交服务总效益的影响,并对模型分析结果进行数据模拟。结果表明:公交服务总效益与三方主体的努力水平、控制权和产出效率紧密相关,只有在合理范围内参与方的努力水平、控制权的提高有利于公交服务效益增加,当超出合理范围时会导致总效益的降低;而三方主体产出效率越高,公交服务总效益越大;控制权配置与自身的产出系数、努力水平相关,产出系数、努力水平越高,则其对应的控制权比例就越大。     

System Regularity and Overtaking Rules in Bus Services

A detailed analysis on the effects of different overtaking rules upon scheduled and unscheduled urban bus services was carried out. The analysis used computer models, which were developed to simulate bus operation strategies with or without overtaking and possibly parallel loading.Permitting overtaking in unscheduled services was found to reduce the journey time of the buses but resulted in a higher degree of irregularity in the service. Scheduled services, in contrast, appeared to be more reliable when overtaking was permitted. In such services, permission for overtaking reduced the waiting times of passengers as a result of faster journeys and a more regular service.     

Estimating bus passenger waiting times from incomplete bus arrivals data

This paper considers the problem of estimating bus passenger waiting times at bus stops using incomplete bus arrivals data. This is of importance to bus operators and regulators as passenger waiting time is a key performance measure. Average waiting times are usually estimated from bus headways, that is, time gaps between buses. It is both time-consuming and expensive to measure bus arrival times manually so methods using automatic vehicle location systems are attractive; however, these systems do not usually provide 100% data coverage and missing data are problematical. The paper contributes to the general theory of estimating headway variance using incomplete data. Various methods for replacing missing buses or discarding spurious bus headways are compared and tested on different data sets.     

公交枢纽内始发线路优化配置模型及其模拟退火算法

城市公交枢纽由于用地规模有限、公交线路集中,其内部始发站的设置不同于一般的公交首末站.本文提出了公交枢纽内始发站的布置方法,建立了公交线路和站台间优化配置模型,并提出运用模拟退火算法对模型进行求解.最后通过实例分析了提出的优化模型及解法的有效性.     

The school bus routing problem: A review

This paper aims to provide a comprehensive review of the school bus routing problem (SBRP). SBRP seeks to plan an efficient schedule for a fleet of school buses where each bus picks up students from various bus stops and delivers them to their designated schools while satisfying various constraints such as the maximum capacity of a bus, the maximum riding time of a student in a bus, and the time window of a school. This class of problem consists of different sub-problems involving data preparation, bus stop selection, bus route generation, school bell time adjustment, and bus scheduling. In this paper, the various assumptions, constraints, and solution methods used in the literature on SBRP are summarized. A list of issues requiring further research is also presented.     

电动公交枢纽直流快速充电模式及充电设施最优配置

发展电动公交能减少燃油消耗和城市污染物排放,对改善城市环境具有十分重要的意义.提出一种能显著减少电动公交运营成本的直流快速充电方式及相应的充电设施的建设模式.对公交枢纽直流快速充电模式下电动公交充电服务排队模型、高峰和平峰期充电设施最优配置模型进行了研究,并通过算例验证了这些模型的有效性.研究成果对我国电动公交的充电设施建设具有借鉴意义.     

Determination of active power limits at a bus of AC network

This work deals with the problem of determining the maximum volumes of the active power which can be generated or consumed in an arbitrary bus of an AC network when the powers at the buses are in proportion to the squares of magnitudes of the voltage at the corresponding buses. Solutions to this problem (when formalized as a constrained optimization problem) are shown as having a unique minimum and unique maximum, and explicit forms of the extrema are obtained.     

A model for setting services on auxiliary bus lines under congestion

In this paper, a mathematical programming model and a heuristically derived solution is described to assist with the efficient planning of services for a set of auxiliary bus lines (a bus-bridging system) during disruptions of metro and rapid transit lines. The model can be considered static and takes into account the average flows of passengers over a given period of time (i.e., the peak morning traffic hour). Auxiliary bus services must accommodate very high demand levels, and the model presented is able to take into account the operation of a bus-bridging system under congested conditions. A general analysis of the congestion in public transportation lines is presented, and the results are applied to the design of a bus-bridging system. A nonlinear integer mathematical programming model and a suitable approximation of this model are then formulated. This approximated model can be solved by a heuristic procedure that has been shown to be computationally viable. The output of the model is as follows: (a) the number of bus units to assign to each of the candidate lines of the bus-bridging system; (b) the routes to be followed by users passengers of each of the origin–destination pairs; (c) the operational conditions of the components of the bus-bridging system, including the passenger load of each of the line segments, the degree of saturation of the bus stops relative to their bus input flows, the bus service times at bus stops and the passenger waiting times at bus stops. The model is able to take into account bounds with regard to the maximum number of passengers waiting at bus stops and the space available at bus stops for the queueing of bus units. This paper demonstrates the applicability of the model with two realistic test cases: a railway corridor in Madrid and a metro line in Barcelona.     

公交服务治理模式的效益比较研究

公交服务的市场化改革需要选择合理的治理模式以应对产生的种种问题,各模式间的效益比较就成为选择的关键因素。在理论比较PPP模式和网络治理模式的基础上,本文以PPP模式为参照对象,假定公交服务参与主体平等的合作,从各主体的控制权分配、努力水平和产出效率构建公交服务总效益模型,并进行了模型的理论分析和数据模拟,结果表明:总效益与各方主体的努力水平、控制权和产出效率紧密相关,仅当政府和社会群体间的边际成本替代率在合理范围内时,网络治理模式的总效益大于PPP模式,当超出合理范围时会使前者小于后者。     

A school bus scheduling problem

This paper introduces a school bus scheduling problem wherein trips for each school are given. A trip consists of a sequence of bus stops and their designated school. Each school has its fixed time window within which trips should be completed. A school bus can serve multiple trips for multiple schools. The school bus scheduling problem seeks to optimize bus schedules to serve all the given trips considering the school time windows. We first model the problem as a vehicle routing problem with time windows (VRPTW) by treating a trip as a virtual stop. Two assignment problem based exact approaches are then proposed for special cases and a heuristic algorithm is proposed for more general cases. Benchmark problems and computational experiments are presented. Computational experiments show the effectiveness of the proposed approaches.     

校车安排问题

探讨如何安排校车运行使得教师和工作人员尽量满意的问题.首先建立动态规划模型和选址规划模型,求出合理站点位置及其总距离.然后用归一法定义满意度与距离的函数关系,考虑各区域人数,建立选址规划模型.得到合理站点位置和总满意度.之后建立双目标非线性规划模型,利用量纲分析法给出权重,以此求出合理乘车位置和满意度.最后对问题进行推...     

A fuzzy clustering approach to real-time demand-responsive bus dispatching control

Quick response (QR) to passenger needs is a key objective for advanced public transportation systems (APTS), and it has become increasingly important for contemporary metropolitan bus operations to gain a competitive advantage over private transportation. This paper presents a real-time control methodology for demand-responsive bus operations that respond quickly to passenger needs. The proposed method primarily involves two levels of functionality: (1) short-term forecasting of passenger demands using time-series prediction models, and (2) identification of service strategies coupled with the associated bus service segments using fuzzy clustering technologies in response to variances in passenger demand attributes and traffic conditions. The proposed bus operations method identifies the demand-responsive vehicle service strategies primarily according to the predicted up-to-date attributes of passengers’ demands, rather than deterministic passenger arrival rates, which were generally used in previous literature. In addition, the variation of traffic conditions along bus lines is considered in the proposed method. Results from numerical studies using real data of passengers’ demands, including passenger volume at each bus stop and the passenger origin-destination (O-D) patterns, are presented to demonstrate the effectiveness of the proposed method for real-world applications.     

A mathematical programming model for the bus deviation route problem

In small towns, or in those peripherical metropolitan areas in which the demand for public transportation is relatively low, the objectives of the bus route planner are different from those faced in highly congested networks. Some towns, also in Italy, are experimenting with urban public transportation systems where regular bus routes are designed which allow users located at specific points outside the main line to signal their presence to the bus driver, who then deviates from the main route to satisfy this demand. This way the bus line is a mixture between a regular line and a dial-a-ride system. The bus deviation route problem is concerned with the design problem which arises in planning the location of the demand points outside the line. A model is presented which takes into account both the advantage of passengers served by this deviation device and the disadvantage suffered by passengers on the bus, whose travel time increases during deviations, and by passengers downstream of the deviation whose waiting time also increases. Through some modeling assumption we are able to represent this problem as a mixed integer linear programming problem, whose relatively low dimension allows for exact solution through standard simplex-based branch and bound code. The proposed model has been applied to a real case and some results of this are presented and discussed.     

Equilibrium arrival times to a queue with order penalties

Suppose customers need to choose when to arrive to a congested queue with some desired service at the end, provided by a single server that operates only during a certain time interval. We study a model where the customers incur not only congestion (waiting) costs but also penalties for their index of arrival. Arriving before other customers is desirable when the value of service decreases with every admitted customer. This may be the case for example when arriving at a concert or a bus with unmarked seats or going to lunch in a busy cafeteria. We provide game theoretic analysis of such queueing systems with a given number of customers, specifically we characterize the arrival process which constitutes a symmetric Nash equilibrium.     

矩阵的一种特殊运算及其应用

针对元素为非负实数的矩阵,引入矩阵的一种双目运算——换乘运算,讨论了这种运算的一些主要性质.举例说明这种运算在城市公交路线查询中的应用,和其他查询算法相比,这种方法具有一次运算,永久利用结果的优点.     

校车站点及线路的优化设计

以高校新校区教师校车站点及线路安排为对象,首先针对乘车站点建立了双目标非线性规划模型,其中目标函数包括乘客到达站点的距离偏差最小与所有乘客到达站点的总的距离最小两个方面;站点确定后针对车辆数最少、车辆行驶的总距离最短、各辆车的运行距离均衡及各辆车的负荷均衡这4个目标建立针对线路优化的多目标非线性规划模型,并给出了解决这类问题的启发式优化算法.与目前国内外研究相比较,该模型与算法更实际,更具体的给出了问题的解答.     

A model for the periodic optimization of bus dispatching times

We model the problem of dispatching time control in rolling horizons following a periodic optimization approach reactionary to travel time and passenger demand disturbances. This model provides more flexibility to transport planners allowing them to adjust the bus schedules during the daily operations. We prove that our periodic optimization model is a convex quadratic program, guaranteeing the global optimality of its solution. To reduce the computational burden, we introduce an iterative algorithm that uses gradient approximations to obtain an approximate dispatching solution. The proposed solution method is found to be significantly faster than exact optimization approaches for quadratic programming and maintains an (almost) negligible optimality gap in realistic bus operation scenarios. Finally, we show that our periodic optimization method outperforms myopic methods that adjust the dispatching time of each bus trip in isolation using operational data from bus line 302 in Singapore.     

基于时间序列分析的西安市公交公司收益预测

公交公司收益额的增长具有其内在的规律性,时间序列分析方法能够充分利用以往各期的调查信息给出精度较高的预测.该文通过对西安市某公司收益数据信息的分析研究,利用Matlab绘图对其进行定性分析,进而用MA2×12方法对原始数据进行处理,分离出趋势项且剔除不规则因素,最终拟合出较好的季节变动模型.依据预测模型对公交收益进行预测的结果表明该模型具有较高的拟合精度,从而较好地解决了公交公司收益的预测问题.     

选择最佳公交线路的数学模型

归纳影响乘客选择公交路线的诸多因素,以换乘次数少、时间短、费用低作为设计最佳路径的目标,利用数据结构和图论思想,建立了选择最佳公交线路的数学模型.     

一类公交车调度问题的数学模型及其解法

本讨论了城市公交车调度问题中的上车乘客流分布和下车概率矩阵的处理方法，建立了基于模拟公共汽车运行的公交车调度问题的数学模型，给出了解法，并对模型的应用进行了讨论。