Effects of queue spillover in networks considering simultaneous departure time and route choices

This paper explores the effects of queue spillover in transportation networks, in the context of dynamic traffic assignment. A model of spatial queue is defined to characterize dynamic traffic flow and queuing formation in network links. Network users simultaneously choose departure time and travel route to minimize the travel cost including journey time and unpunctuality penalty. Using some necessary conditions of the dynamic user equilibrium, dynamic network flows are obtained exactly on some networks with typical structure. Various effects of queue spillover are discussed based on the results of these networks, and some new paradoxes of link capacity expansion have been found as a result of such effects. Analytical and exact results in these typical networks show that ignoring queuing length may generate biased solutions, and the link storage capacity is a very important factor concerning the performance of networks.     

Some features of non-linear travel time models for dynamic traffic assignment

Abstract

This paper investigates some features of non-linear travel time models for dynamic traffic assignment (DTA) that adopt traffic on the link as the sole determinant for the calculation of travel time and have explicit relationships between travel time and traffic on the link. Analytical proofs and numerical examples are provided to show first-in-first-out (FIFO) violation and the behaviour of decreasing outflow with increasing traffic in non-linear travel time models. It is analytically shown that any non-linear travel time model could violate FIFO in some circumstances, especially when inflow drops sharply, and some convex non-linear travel time models could show behaviour with outflow decreasing as traffic increases. It is also shown that the linear travel time model does not show these behaviours. A non-linear travel time model in general form was used for analytical proofs and several existing non-linear travel time models were adopted for numerical examples. Considering the features addressed in this study, non-linear travel time models seem to have limitations for use in DTA in practical terms and care should be taken when they are used for modelling time-varying transportation networks.     

降雨要素对土质边坡稳定性的影响分析

基于饱和-非饱和渗流理论与非饱和土的抗剪强度理论,研究了降雨强度、降雨历时等降雨要素对土质边坡安全系数的影响规律,并且重点对短时强降雨、长时弱降雨2种降雨形式进行了对比分析.结果表明：在饱和渗透系数一定的情况下,安全系数随着降雨强度、降雨历时的增加而不断减小,但在降雨结束后,安全系数又随时间的增长开始增大;短时强降雨下边坡上部土体更容易达到饱和,而长时弱降雨对边坡土体的影响更大,两者的稳定性都大大降低,但长时弱降雨下的滑坡危害程度更大.     

船舶分段建造工程工期、成本、质量综合均衡优化研究

针对当前实际在船舶分段建造工程管理中,人们较少针对工期、成本、质量综合优化的研究,提出通过研究船舶分段建造过程中的工期、成本、质量之间的相互制约关系,得出工期、成本、质量之间的综合均衡优化模型,并利用多目标优化理论和粒子群算法对模型进行求解。该方法能够得到船舶分段建造工程项目管理中的控制目标。     

Daily newspaper distribution planning with integer programming: an application in Turkey

Abstract

This paper concerns the newspaper distribution problem. It addresses the transportation of newspapers from printing plant to newsagents with distribution vehicles under various particular constraints. The objective is to minimize the distance traveled by the vehicles and/or the number of vehicles. In this study, the routes for vehicles of a leading newspaper distributor company in the Turkish press sector are examined. The problem is defined as determining optimal delivery routes for a fleet of homogeneous vehicles, starting and ending at the printing plant that is required to serve a number of geographically dispersed newsagents with known demands under capacity and time constraints, while minimizing the total distribution cost. An integar linear programming model is proposed as a solution using Cplex. Computational results demonstrate that the proposed model is fast and able to find optimal solutions for problem scenarios with up to 55 newsagents within reasonable computing times. It was found that the proposed model reduced the delivery cost by 21% on average when compared to the current manual method. The results show that this model is adequate for medium-sized distribution problems.     

Modeling time mean speed and space mean speed for heterogeneous traffic conditions

This paper analyzes vehicular speeds at a micro level and studies the relationships between the important elements of speed, namely space mean speed (SMS) and time mean speed (TMS) under heterogeneous traffic conditions. Vehicular speed data were collected at selected road stretches around Delhi, India, in an attempt to understand and model the type of relationships between SMS and TMS under heterogeneous traffic conditions. To demonstrate the superiority of the proposed models, comparisons are made with existing traditional models. The results reveal that the proposed models are consistent in predicting speeds with high accuracy.     

基于网络核密度的网约车上下客热点识别

为分析网约车上下客热点的时空分布特性,利用网约车订单数据,构建基于网络核密度估计的上下客热点识别模型,采用回归模型对热点进行聚类和分级。通过研究区域划定、数据清洗和筛选,引入以路网距离为度量的网络核密度估计方法,基于非均质网络方向延展和网络距离衰减效应,对工作日和非工作日的特征时段内网约车上下客点的核密度值进行估计。采用零膨胀负二项回归模型对核密度值进行聚类,识别出研究区域的热点路段分布及其等级。通过与平面核密度估计结果对比分析,本文提出的网络核密度估计方法体现了上下客热点在路段和交叉口的分布特点,表征了实际的交通需求与路网结构的关系。研究结论为优化城市网约车的运营管理、提高城市居民出行效率提供理论依据。     

基于时间富余度控制的滑行道调度优化模型

针对机场场面运行中部分航空器剩余滑行时间较短、准时性低的现状,研究滑行道调度优化问题。在构建基于时间富余度控制的滑行道调度优化模型中,优先考虑以剩余滑行时间为主的航空器动态优先级;以我国某大型机场的场面运行数据为基础,采用生物地理学算法进行仿真验证。结果显示：与经典的先到先服务策略相比,航空器到达滑行终点的误差由1499 s降至553 s,降低了63.1%,冲突航空器到达误差从371 s降至147 s,降低了60.3%;在冲突解脱方面,由剩余滑行时间较多的航空器承担更多的冲突等待,有效减少航空器滑行冲突次数,保障后续停机位指派与跑道调度的有效性,大大提高了滑行道的滑行效率。     

时间阈值对公交不平等评价结果的影响

时间阈值对公交可达性计算结果的影响,是否进一步影响到公交不平等评价结果,尚不明 确。以浙江省海宁市为例,用一种改进的两步移动搜索法(E2SFCA)计算公交可达性,得到 10~90 min共9个时间阈值下研究区域的总体、市区和农村公交服务的基尼系数,比较了不同时间 阈值下的基尼系数差异;按市区和农村两个群组对总体基尼系数进行分解,分析在时间阈值下群 组内和群组间不平等对总体公交不平等的影响。结果发现：随时间阈值增大而基尼系数逐渐减 小,公交不平等评价由“差距悬殊”变为“相对合理”;总体公交不平等的主要来源为群组内不平等 且贡献率在10~40 min时逐渐下降,在50~90 min时逐渐上升。研究表明,不同时间阈值会使公交 不平等评价结果出现偏差甚至得到相反的结论,有必要进一步研究消除时间阈值影响的方法。     

定时、定线路上下班拼车方案实现与评价——以淮安为试点

因信息不畅、费用不统一、违法犯罪时有发生和法律界定不明确等问题,导致私家车拼车市场发展缓慢.设计了以淮安为试点的定时、定线路上下班拼车方案,搭建了拼车信息平台,实现了拼车的信息检索、信息配对、双方互选、双方互评等功能,并利用时间费用阻抗评价模型和Vissim仿真对该实施后的方案进行评价,结果表明该方案可使时间费用阻抗减少65%~86%,拼车路网中平均车速提高17.83%、总停车延误时间减少34.84%、总行驶时间减少28.29%、总延误时间减少40.89%、平均延误时间减少29.23%.方案在淮安试点表明,该方案能较大地减少拼车过程中的出行时间和出行费用,改善拼车区域路网交通拥堵状况,提高拼车过程的安全性和经济性.