Connecting e-hailing to mass transit platform: Analysis of relative spatial position

This paper analyzes and compares two different relative spatial position (RSP) designs in an integrated e-hailing/fixed-route transit system: a zone-based design that operates e-hailing vehicles within a zone, and a line-based design that operates e-hailing vehicles along a fixed-route transit line and with a stable headway. To conduct a meaningful comparison, the optimal design problems for both systems are formulated using a same analytical framework based on the continuous approximation approach. A comprehensive numerical experiment is performed to compare various cost components corresponding to the optimal designs, and a discrete-event simulation model is developed to validate the analysis. The analytical and simulation results agree with each other well, with a discrepancy in the total system cost less than 5% in most test scenarios. These results also suggest that the line-based system consistently outperforms the zone-based system in terms of both agency and user costs, for all scenarios tested. Compared to the zone-based design, the line-based design features a sparser fixed-route network (resulting in larger stop spacing) but a higher dispatching frequency. It is concluded that the higher efficiency of the line-based design is likely derived from the strategy of operating e-hailing vehicles with a more regular route/headway structure and allowing ride-sharing.     

采用双互易边界元法进行三维声场特征值分析的近似函数研究

该文对应用双互易边界元法进行三维声场特征值分析时所用的近似函数进行了研究和讨论.分别以RBF函数、TPS函数和扩展的RBF和TPS函数作为近似函数对一长方体封闭空间声特征值进行了计算.计算结果表明:TPS函数得出的结果与其它函数相比是比较精确的,且收敛速度较快,但高次的TPS函数并没有显示出优势;TPS函数、扩展的TPS函数和RBF函数对于域内点的选取不太敏感.     

Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

基于近似概率的衬砌结构耐久性设计研究

与其他建筑结构一样,隧道衬砌结构会因环境因素的侵蚀而产生耐久性损伤,从而影响使用寿命,这种环境损伤作用在传统隧道衬砌结构设计方法中未定量考虑。采用基于近似概率的方法对衬砌结构进行耐久性设计,在设计过程中定量考虑环境侵蚀作用,使结果更符合实际要求。最后通过算例进行进一步说明。结果表明,采用该方法能够在一定程度上提高结构的耐久寿命,是可行的。     

An enhanced SPSA algorithm for the calibration of Dynamic Traffic Assignment models

Simultaneous perturbation stochastic approximation (SPSA) is an efficient and well established optimization method that approximates gradients from successive objective function evaluations. It is especially attractive for high-dimensional problems and has been successfully applied to the calibration of Dynamic Traffic Assignment (DTA) models. This paper presents an enhanced SPSA algorithm, called Weighted SPSA (W-SPSA), which incorporates the information of spatial and temporal correlation in a traffic network to limit the impact of noise and improve convergence and robustness. W-SPSA appears to outperform the original SPSA algorithm by reducing the noise generated by uncorrelated measurements in the gradient approximation, especially for DTA models of sparsely correlated large-scale networks and a large number of time intervals. Comparisons between SPSA and W-SPSA have been performed through rigorous synthetic tests and the application of W-SPSA for the calibration of real world DTA networks is demonstrated with a case study of the entire expressway network in Singapore.     

船舶三维数控弯板机成形回弹控制的逐步逼近弯曲法研究

文章依据板材成形理论与实验规律,提出了船板冷压成形的逐步逼近弯曲法,较好地解决了多压头船舶三维数控弯板机板材成形的回弹问题。船板塑性成形加工过程中,采用在线实时测取回弹量来调整可重构模具曲面,实现了船板弯曲回弹问题的实时在线解决。一般逼近2～3次,即可满足加工精度要求,简单而有效地解决了三维曲面船板塑性成形的复杂回弹难题。     

How to assess sustainability of suppliers in volume discount context? A new data envelopment analysis approach

In this paper, we reformulate conventional data envelopment analysis (DEA) models and propose a novel method for evaluating sustainability of suppliers in the presence of interval volume discount offers, fuzzy data, and ordinal data. To this end, we convert all data into interval data. To convert fuzzy data into interval data, we use nearest weighted interval approximation by applying weighting function and we convert each ordinal data into interval one. Then, using enhanced Russell model, interval efficiencies are obtained. After that, using preference degree approach, we rank suppliers. Finally, a case study is presented to illustrate our proposed approach.     

非扩张映象的Ishikawa迭代与最佳逼近元

在严格凸Banach空间中研究了非扩张映象T的耦合不动点集F(T)的闭凸性,获得了当F(T)是Hilbert空间中的闭线性子空间时,Ishikawa迭代的极限元与其初始元的最佳逼近元之间的关系.     

A reinforcement learning framework for the adaptive routing problem in stochastic time-dependent network

Most previous work in addressing the adaptive routing problem in stochastic and time-dependent (STD) network has been focusing on developing parametric models to reflect the network dynamics and designing efficient algorithms to solve these models. However, strong assumptions need to be made in the models and some algorithms also suffer from the curse of dimensionality. In this paper, we examine the application of Reinforcement Learning as a non-parametric model-free method to solve the problem. Both the online Q learning method for discrete state space and the offline fitted Q iteration algorithm for continuous state space are discussed. With a small case study on a mid-sized network, we demonstrate the significant advantages of using Reinforcement Learning to solve for the optimal routing policy over traditional stochastic dynamic programming method. And the fitted Q iteration algorithm combined with tree-based function approximation is shown to outperform other methods especially during peak demand periods.     

支持向量回归在轮轨Hertz弹性接触计算中的应用

空间轮轨接触是铁道车辆系统动力学仿真对象模型中的重要柔性环节，基于材料线弹性假设的Hertz理论，可以给出两弹性体一般接触的复杂的隐式非线性关系.支持向量回归是统计学习理论中提出的新一代学习算法．轮轨接触计算可以使用它离线学习到一个显式的非线性关系．其逼近精度和表示复杂度可得到很好的折中．有利于铁道车辆系统动力学仿真的在线计算，