货运列车的编组调度问题研究

针对货运列车的编组调度问题,根据实际情况和理论研究的需要,首先对模型做了分析和假定.在此基础上,以中时最短为优化目标,给出了基于0-1整数规划和多目标优化理论的优化数学模型,实现了理论上可行的编组调度方案.     

货运列车的编组调度问题的研究

对于货运列车的编组调度问题,建立了以压缩中时和增加运量为双目标、多约束的0-1规划模型,采用逐步紧缩中时约束的方法得到了问题一的调度方案.在此基础上对装载特别物资的车辆施加更强的中时约束得到了问题二的调度方案.提出了列车匹配系数的概念并建立了列车最优配对原则,根据该原则对列车进行优化编组得到了问题三的调度方案.基于问题二的数据转换处理得到了问题四的调度方案.     

Moments and Distribution of the Local Times of a Transient Random Walk on ℤ d

Consider an arbitrary transient random walk on ℤ ^d with d∈ℕ. Pick α∈[0,∞), and let L _n (α) be the spatial sum of the αth power of the n-step local times of the walk. Hence, L _n (0) is the range, L _n (1)=n+1, and for integers α, L _n (α) is the number of the α-fold self-intersections of the walk. We prove a strong law of large numbers for L _n (α) as n→∞. Furthermore, we identify the asymptotic law of the local time in a random site uniformly distributed over the range. These results complement and contrast analogous results for recurrent walks in two dimensions recently derived by Černy (Stoch. Proc. Appl. 117:262–270, 2007). Although these assertions are certainly known to experts, we could find no proof in the literature in this generality.      

Real zeros of the zero-dimensional parametric piecewise algebraic variety

The piecewise algebraic variety is the set of all common zeros of multivariate splines. We show that solving a parametric piecewise algebraic variety amounts to solve a finite number of parametric polynomial systems containing strict inequalities. With the regular decomposition of semi-algebraic systems and the partial cylindrical algebraic decomposition method, we give a method to compute the supremum of the number of torsion-free real zeros of a given zero-dimensional parametric piecewise algebraic variety, and to get distributions of the number of real zeros in every n-dimensional cell when the number reaches the supremum. This method also produces corresponding necessary and sufficient conditions for reaching the supremum and its distributions. We also present an algorithm to produce a necessary and sufficient condition for a given zero-dimensional parametric piecewise algebraic variety to have a given number of distinct torsion-free real zeros in every n-cell in the n-complex. This work was supported by National Natural Science Foundation of China (Grant Nos. 10271022, 60373093, 60533060), the Natural Science Foundation of Zhejiang Province (Grant No. Y7080068) and the Foundation of Department of Education of Zhejiang Province (Grant Nos. 20070628 and Y200802999)     

A note on parameter estimations of panel vector autoregressive models with intercorrelation

This note considers parameter estimation for panel vector autoregressive models with intercorrelation. Conditional least squares estimators are derived and the asymptotic normality is established. A simulation is carried out for illustration.     

GLOBAL EXISTENCE AND ASYMPTOTIC BEHAVIOR FOR AN 1-D COMPRESSIBLE ENERGY TRANSPORT MODEL

In this article, the global existence and the large time behavior of smooth solutions to the initial boundary value problem for a degenerate compressible energy transport model are established.     

Spreading and generalized propagating speeds of discrete KPP models in time varying environments

The current paper deals with spatial spreading and front propagating dynamics for spatially discrete KPP (Kolmogorov, Petrovsky and Paskunov) models in time recurrent environments, which include time periodic and almost periodic environments as special cases. The notions of spreading speed interval, generalized propagating speed interval, and traveling wave solutions are first introduced, which are proper modifications of those introduced for spatially continuous KPP models in time almost periodic environments. Among others, it is then shown that the spreading speed interval in a given direction is the minimal generalized propagating speed interval in that direction. Some important upper and lower bounds for the spreading and generalized propagating speed intervals are provided. When the environment is unique ergodic and the so called linear determinacy condition is satisfied, it is shown that the spreading speed interval in any direction is a singleton (called the spreading speed), which equals the classical spreading speed if the environment is actually periodic. Moreover, in such a case, a variational principle for the spreading speed is established and it is shown that there is a front of speed c in a given direction if and only if c is greater than or equal to the spreading speed in that direction.      

High-Order Leap-Frog Based Discontinuous Galerkin Method for the Time-Domain Maxwell Equations on Non-Conforming Simplicial Meshes

A high-order leap-flog based non-dissipative discontinuous Galerkin timedomain method for solving Maxwell's equations is introduced and analyzed. The proposed method combines a centered approximation for the evaluation of fluxes at the interface between neighboring elements, with a Nth-order leap-frog time scheme. Moreover, the interpolation degree is defined at the element level and the mesh is refined locally in a non-conforming way resulting in arbitrary level hanging nodes. The method is proved to be stable under some CFL-like condition on the time step. The convergence of the semi-discrete approximation to Maxwell's equations is established rigorously and bounds on the global divergence error are provided. Numerical experiments with highorder elements show the potential of the method.     

Wavelets and adaptive grids for the discontinuous Galerkin method

In this paper, space adaptivity is introduced to control the error in the numerical solution of hyperbolic systems of conservation laws. The reference numerical scheme is a new version of the discontinuous Galerkin method, which uses an implicit diffusive term in the direction of the streamlines, for stability purposes. The decision whether to refine or to unrefine the grid in a certain location is taken according to the magnitude of wavelet coefficients, which are indicators of local smoothness of the numerical solution. Numerical solutions of the nonlinear Euler equations illustrate the efficiency of the method.     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20