基于连续近似模型的轨道交通与常规公交耦合优化设计

为研究城市轨道交通与常规公交线网耦合优化设计问题，本文基于近似方格型路网并考虑乘客的多种路径选择，构建双层混合整数优化模型，以同时求解地铁与常规公交发车时距、常规公交的线间距及站间距。上层模型是以系统总成本(乘客成本与运营商成本之和)最小为目标的连续近似模型，以寻求乘客与运营商两者之间的平衡关系，并对各项成本进行详细推导。采用序列二次规划算法，并用凸算法对该非凸问题进行包络。下层为考虑依概率分配的路径分配问题，使用MSA算法对各路径流量加权分配，考虑到问题的解析形式具有非凸性，故采用启发式方法进行求解。最后，以南京市建邺区实际公交线网为例进行案例分析，以此验证该优化模型的有效性。经过优化，以非拥堵时段为例，该研究区域内乘客平均出行时间由 41.6 min减少至 33.0 min，降低约20.6%。本文所提出的优化模型可以为方格路网城市的公共交通线网规划提供参考依据。     

Continuum signalized junction model for dynamic traffic networks: Offset,spillback, and multiple signal phases

This paper extends the continuum signalized intersection model exhaustively studied in Han et al. (2014) to more accurately account for three realistic complications: signal offsets, queue spillbacks, and complex signal phasing schemes. The model extensions are derived theoretically based on signal cycle, green split, and offset, and are shown to approximate well traffic operations at signalized intersections treated using the traditional (and more realistic) on-and-off model. We propose a generalized continuum signal model, which explicitly handles complex vehicle spillback patterns on signalized networks with provable error estimates. Under mild conditions, the errors are small and bounded by fixed values that do not grow with time. Overall, this represents a significant improvement over the original continuum model, which had errors that grew quickly with time in the presence of any queue spillbacks and for which errors were not explicitly derived for different offset cases. Thus, the new model is able to more accurately approximate traffic dynamics in large networks with multiple signals under more realistic conditions. We also qualitatively describe how this new model can be applied to several realistic intersection configurations that might be encountered in typical urban networks. These include intersections with multiple entry and exit links, complex signal phasing, all-red times, and the presence of dedicated turning lanes. Numerical tests of the models show remarkable consistency with the on-and-off model, as expected from the theory, with the added benefit of significant computational savings and higher signal control resolution when using the continuum model.     

Infrastructure deployment under uncertainties and competition: The biofuel industry case

Technological paradigm shifts often come with a newly emerging industry that seeks a viable infrastructure deployment plan to compete against established competitors. Such phenomenon has been repeatedly seen in the field of transportation systems, such as those related to the booming bioenergy production, among others. We develop a game-theoretic modeling framework using a continuum approximation scheme to address the impacts of competition on the optimal infrastructure deployment. Furthermore, we extend the model to incorporate uncertainties in supply/demand and the risk of facility disruptions. Analytical properties of the optimal infrastructure system are obtained, based on which fast numerical solution algorithms are developed. Several hypothetical problem instances are used to illustrate the effectiveness of the proposed algorithms and to quantify the impacts of various system parameters. A large-scale biofuel industry case study for the U.S. Midwest is conducted to obtain additional managerial insights.     

The dynamic shortest path problem with time-dependent stochastic disruptions

The dynamic shortest path problem with time-dependent stochastic disruptions consists of finding a route with a minimum expected travel time from an origin to a destination using both historical and real-time information. The problem is formulated as a discrete time finite horizon Markov decision process and it is solved by a hybrid Approximate Dynamic Programming (ADP) algorithm with a clustering approach using a deterministic lookahead policy and value function approximation. The algorithm is tested on a number of network configurations which represent different network sizes and disruption levels. Computational results reveal that the proposed hybrid ADP algorithm provides high quality solutions with a reduced computational effort.     

Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design

We propose a new fast solution method for linear Bilevel Problems with binary leader and continuous follower variables under the partial cooperation assumption. We reformulate the Bilevel Problem into a single-level problem by using the Karush–Kuhn–Tucker conditions. This non-linear model can be linearized because of the special structure achieved by the binary leader decision variables and subsequently solved by a Benders Decomposition Algorithm to global optimality. We illustrate the capability of the approach on the Discrete Network Design Problem which adds arcs to an existing road network at the leader stage and anticipates the traffic equilibrium for the follower stage. Because of the non-linear objective functions of this problem, we use a linearization method for increasing, convex and non-linear functions based on continuous variables. Numerical tests show that this algorithm can solve even large instances of Bilevel Problems.     

冲击动力过程的无网格数值分析方法

应用再生核质点法实现了冲击过程的数值模拟．为解决冲击过程伴随的材料和几何非线性问题，数值分析中采用增量法．针对冲击速度较低的情况，假设冲击过程为小应变，并引入弹塑性增量本构关系，推导出冲击过程的再生核质点法计算控制方程．采用修正配点法，以满足其本质边界条件．数值模拟结果表明，实例中弹体变形分析结果与ANSYS有限元分析结果一致．     

NUMERICAL SIMULATION OF SINGLE-GROUP, STEADY STATE AND ISOTROPIC NEUTRON TRANSPORT EQUATION IN DIFFUSIVE REGIMES

The single-group,steadystate,isotropic for mofthe neutron transport equationis given by[1]Ω·+σtI-σsPψ(x,Ω)=q(x,Ω)(x,Ω)∈D×Sψ(x,Ω)=g(x,Ω)x∈Din={x∈D,γ(x)·Ω<0(1)whereσtis the total cross section,σSis the scatteringcross section,andψ(x,Ω)is the angular flux to bedeter mined for all pointsx∈D,D Rn(n=2,3)and all possible travel directionsΩ,ΩS(Sis a u-nit disk or a unit sphere),γ(x)denotes the out wardunit nor mal atx∈D,Idenotes the identity opera-tor,the operator…     

Reproducing Kernel Particle Method for Non-Linear Fracture Analysis

To study the non-linear fracture, a non-linear constitutive model for piezoelectric ceramics was proposed, in which the polarization switching and saturation were taken into account. Based on the model, the non-linear fracture analysis was implemented using reproducing kernel particle method （RKPM）. Using local J-integral as a fracture criterion, a relation curve of fracture loads against electric fields was obtained. Qualitatively, the curve is in agreement with the experimental observations reported in literature. The reproducing equation, the shape function of RKPM, and the transformation method to impose essential boundary conditions for meshless methods were also introduced. The computation was implemented using object-oriented programming method.     

一类阻尼陀螺系统特征值反问题

本文考虑一类阻尼陀螺系统特征值反问题。在假定分析质量矩阵是精确的情况下,运用测量的不完全复模态数据给出了反问题有解的充分必要条件及解的显式表示。在此基础上研究了一个逼近问题,得到了Frobenius范数意义下的最优矩阵。     

Modeling techniques for periodic vehicle routing problems

This paper presents a continuous approximation model for the period vehicle routing problem with service choice (PVRP-SC). The PVRP-SC is a variant of the period vehicle routing problem in which the visit frequency to nodes is a decision of the model. This variation can result in more efficient vehicle tours and/or greater service benefit to customers. We present a continuous approximation model to facilitate strategic and tactical planning of periodic distribution systems and evaluate the value of service choice. Further, results from the continuous model can provide guidelines for constructing solutions to the discrete PVRP-SC.