M/M~B/1排队模型的时间依赖解的存在唯一性

应用线性算子的积分半群理论证明 M/MB/1排队模型的时间依赖解的存在唯一性 ,其次推出 M/M/1排队模型的时间依赖解的存在唯一性 .     

M/G/1重试排队系统的渐近稳定性

用算子半群理论研究了带有重试排队的M/G/1系统.通过解算子方程和预解方程,证明了0是系统算子的本征值,且为虚轴上唯一的谱点.从而得出了当时间趋于无穷时系统时间依赖解收敛于稳态解的结论.     

(3+1)维时间分数阶KdV-Zakharov-Kuznetsov方程的分支分析及其行波解

首先,运用拟设方法和动力系统分支方法,获得了(3+1)维时间分数阶KdV-Zakharov-Kuznetsov方程的奇异孤子解、 亮孤子解、 拓扑孤子解、 周期爆破波解、 孤立波解等.再利用MAPLE软件画出了KdV-Zakharov-Kuznetsov方程在不同条件下的分支相图.最后,讨论了行波解之间的联系.     

L1 asymptotic behavior of compressible,isentropic, viscous 1-D flow

We study the large time behavior in L¹ of the compressible, isentropic, viscous 1-D flow. Under the assumption that the initial data are smooth and small, we show that the solutions are approximated by the solutions of a parabolic system, and in turn by diffusion waves, which are solutions of Burgers equations. Decay rates in L¹ are obtained. Our method is based on the study of pointwise properties in the physical space of the fundamental solution to the linearized system. © 1994 John Wiley & Sons, Inc.     

推广的M~x/G(M/G)/1(M/G)可修排队系统(I)── 一些排队指标

考虑M     

带有优先权、不耐烦顾客及负顾客的$M_1,M_2/G_1,G_2/1$可修重试排队系统

研究了带有优先权,不耐烦顾客及负顾客的M1,M2/G1,G2/1可修重试排队系统.假设两类顾客的优先级不同且各自的到达过程分别服从独立的泊松过程.有优先权的顾客到达系统时如服务器忙,则以概率H1排队等候服务,以概率1-H1离开系统;而没有优先权的顾客只能一定的概率进入Orbit中进行重试,直到重试成功.此外,假设有服从Poisson过程的负顾客到达:当负顾客到达系统时,若发现服务台忙,将带走正在接受服务的顾客并使机器处于修理状态;若服务台空闲或已经处于失效状态,则负顾客立即消失,对系统没有任何影响.应用补充变量及母函数法给出了该模型的系统指标稳态解的拉氏变换表达式,并得到了此模型主要的排队指标及可靠性指标.     

多目标0-1规划问题的元胞狼群优化算法研究

针对多目标0-1规划问题,首先基于元胞自动机原理和人工狼群智能算法,提出一种元胞狼群优化算法,该算法将元胞机的演化规则与嚎叫信息素更新规则、人工狼群更新规则进行组合,采用元胞及其邻居来增强搜索过程的多样性和分布性,使人工头狼在元胞空间搜索的过程中,增强了人工狼群算法的全局搜索能力,并获得更多的全局非劣解;其次结合多目标0-1规划模型对元胞狼群算法进行了详细的数学描述,定义了人工狼群搜索空间、移动算子、元胞演化规则和非劣解集更新规则,并给出了元胞狼群算法的具体实现步骤;最后通过MATLAB软件对3个典型的多目标0-1规划问题算例进行解算,并将解算结果与其它人工智能算法的结果进行比较,结果表明:元胞狼群算法在多目标0-1规划问题求解方面可获得更多的非劣解集和更优的非劣解,并具有较快的收敛速度和较好的全局寻优能力。     

Vehicle routing in the 1-skip collection problem

In this paper, we consider a real problem, which we call the 1-skip collection problem, where a fleet of vehicles must collect a number of skips situated in different locations and transport them to one among different plants chosen on the basis of the kind of waste contained in the skip. Each vehicle has a capacity of one skip and it starts and ends its tour at the depot. Each time a vehicle collects a skip, it has to go to a plant and empty it. A number of constraints are imposed, which involve time windows for the customers and the plants, shift-time, different kinds of skips, number of drivers available to carry out the service and priorities assigned to the customers who have to be served. The objective is to minimize the total cost of the service given by the fixed cost of the drivers engaged to carry out the service, the cost of the extra time and the penalty cost paid if a customer is not served. A heuristic algorithm to solve the real problem is presented. The algorithm first constructs a feasible solution by means of the nearest-neighbour algorithm. Then, if it finds a feasible solution, it improves it. The computational results show that the solution of the algorithm is much better than the solution applied by the firm that carries out the service since it serves a higher number of skips with a smaller number of drivers.     

SOLITON SOLUTIONS TO AN EQUATION IN 2+1 DIMENSIONS

This paper considers a 2+1 dimensional equation. A bilinear form for the equation and its 3-soliton solutions are obtained by the Hirota method. The N-soliton solution is given in the form of pfaffian. At the same time the proof of the solutions are given.     

Dynamical behaviors for 1D compressible Navier-Stokes equations with density-dependent viscosity

The dynamical behaviors of vacuum states for one-dimensional compressible Navier-Stokes equations with density-dependent viscosity coefficient are considered. It is first shown that a unique strong solution to the free boundary value problem exists globally in time, the free boundary expands outwards at an algebraic rate in time, and the density is strictly positive in any finite time but decays pointwise to zero time-asymptotically. Then, it is proved that there exists a unique global weak solution to the initial boundary value problem when the initial data contains discontinuously a piece of continuous vacuum and is regular away from the vacuum. The solution is piecewise regular and contains a piece of continuous vacuum before the time T_∗>0, which is compressed at an algebraic rate and vanishes at the time T_∗, meanwhile the weak solution becomes either a strong solution or a piecewise strong one and tends to the equilibrium state exponentially.     

A high order HODIE finite difference scheme for 1D parabolic singularly perturbed reaction-diffusion problems

This paper deals with the numerical approximation of the solution of 1D parabolic singularly perturbed problems of reaction-diffusion type. The numerical method combines the standard implicit Euler method on a uniform mesh to discretize in time and a HODIE compact fourth order finite difference scheme to discretize in space, which is defined on a priori special meshes condensing the grid points in the boundary layer regions. The method is uniformly convergent having first order in time and almost fourth order in space. The analysis of the uniform convergence is made in two steps, splitting the contribution to the error from the time and the space discretization. Although this idea has been previously used to prove the uniform convergence for parabolic singularly perturbed problems, here the proof is based on a new study of the asymptotic behavior of the exact solution of the semidiscrete problems obtained after the time discretization by using the Euler method. Some numerical results are given corroborating in practice the theoretical results.     

Blow-up of solutions for a 1D transport equation with nonlocal velocity and supercritical dissipation

We study a 1D transport equation with nonlocal velocity and supercritical dissipation. We show that for a certain class of initial data the solution blows up in finite time.     

编组站调度计划0-1规划法

针对货车编组问题,采用半分离式两阶段0-1线性规划模型对各阶段联合求解,对局部最优解采用调度时序图可视化表述.首先,对无、有调车辆分离,无调车采用启发式安排.有调车推峰顺序可以转化为零件加工问题,以驼峰总工作量最大、等待时间最小为目标建立模型I.列车解体时间与解体方向数成正比增长,但在未确定具体解体方案时无法确定(即模型I的独立),通过在模型II中对解体时间模糊化来处理两步独立的缺陷,从而达到两步规划的连续特性.车辆新编,决策变量属于多维结构,通过将多维稀疏变量转化为一维序列,有效解除其稀疏特性,形成二维决策变量建立规划模型II直接求解.其次,通过仿真创建模拟数据,运用主模型求解,得到了驼峰是编组站主要瓶颈的结论.最后,我们还对铁路资源的紧缺性、编组效率建模给出了较详细改进措施.     

Reoptimizing the 0-1 knapsack problem

In this paper we study the problem where an optimal solution of a knapsack problem on n items is known and a very small number k of new items arrive. The objective is to find an optimal solution of the knapsack problem with n+k items, given an optimal solution on the n items (reoptimization of the knapsack problem). We show that this problem, even in the case k=1, is NP-hard and that, in order to have effective heuristics, it is necessary to consider not only the items included in the previously optimal solution and the new items, but also the discarded items. Then, we design a general algorithm that makes use, for the solution of a subproblem, of an α-approximation algorithm known for the knapsack problem. We prove that this algorithm has a worst-case performance bound of , which is always greater than α, and therefore that this algorithm always outperforms the corresponding α-approximation algorithm applied from scratch on the n+k items. We show that this bound is tight when the classical Ext-Greedy algorithm and the algorithm are used to solve the subproblem. We also show that there exist classes of instances on which the running time of the reoptimization algorithm is smaller than the running time of an equivalent PTAS and FPTAS.     

N策略带启动时间的Geom/Geom/1工作休假排队

考虑N策略带启动时间的Geom/Geom/1工作休假排队,服务员在休假期间并未完全停止工作而是以较低的速率为顾客服务.运用拟生灭链和矩阵几何解方法,给出了该模型的稳态队长的分布和等待时间的概率母函数,并证明了队长和等待时间的条件随机分解结构.     

N策略工作休假M/M/1排队

考虑策略工作休假M/M/1排队,简记为M/M/1(N-WV)。在休假期间,服务员并未完全停止工作而是以较低的速率为顾客服务。用拟生灭过程和矩阵几何解方法,我们给出了有直观概率意义的稳态队长和稳态条件等待时间的分布。此外,我们也得到了队长和等待时间的条件随机分解结构及附加队长和附加延迟的分布。     

The GI/M/1 queue with exponential vacations

In this paper, we give a detailed analysis of the GI/M/1 queue with exhaustive service and multiple exponential vacation. We express the transition matrix of the imbedded Markov chain as a block-Jacobi form and give a matrix-geometric solution. The probability distribution of the queue length at arrival epochs is derived and is shown to decompose into the distribution of the sum of two independent random variables. In addition, we discuss the limiting behavior of the continuous time queue length processes and obtain the probability distributions for the waiting time and the busy period.     

带启动时间的Geom/Geom/1多重工作休假排队

本文中研究了一个带有启动时间的Geom/Geom/1多重工作休假排队模型。服务台在休假期间,不停止服务,而是以较低的服务率为顾客提供服务。运用拟生灭过程和矩阵几何解的方法,给出了该模型的稳态队长分布,并求出了平均队长以及顾客的平均逗留时间。     

Jacobi elliptic function solutions of the (1 + 1)‐dimensional dispersive long wave equation by Homotopy Perturbation Method

In this article, we try to obtain approximate Jacobi elliptic function solutions of the (1 + 1)‐dimensional long wave equation using Homotopy Perturbation Method. This method deforms a difficult problem into a simple problem which can be easily solved. In comparison with HPM, numerical methods leads to inaccurate results when the equation intensively depends on time, while He's method overcome the above shortcomings completely and can therefore be widely applicable in engineering. As a result, we obtain the approximate solution of the (1 + 1)‐dimensional long wave equation with initial conditions. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008