A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a problem oriented point of view the computational results show that the approach is competitive with an existing Tabu Search algorithm with respect to both solution quality and computation times.     

Existence and characterization of regions minimizing perimeter under a volume constraint inside Euclidean cones

We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of the cone coincides with the one of the half-space. This allows us to give some criteria ensuring existence of isoperimetric regions: for instance, local convexity of the cone at some boundary point.

We also characterize which are the stable regions in a convex cone, i.e., second order minima of perimeter under a volume constraint. From this it follows that the isoperimetric regions in a convex cone are the euclidean balls centered at the vertex intersected with the cone.

     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…     

关于解椭圆型问题的多子域D-N交替算法

构造一个求解椭圆型边值问题的多子域D—N交替算法，导出对应的容度方程和等价的迭代法，证明算法的收敛性。     

高阶非线性时滞差分方程解的渐近性

研究如下的具强迫项的高阶非线性时滞差分方程△^my(n) u(n)l↑∑i=1 gi(y(n-τ))=v(n)其中，m≥1，u,v：N→R，gi：R→R且τ∈{0，1，2，3，…)，i=1，2，…，l，得到了使该方程的解具有某种渐近性态的充分条件。     

用数值方法分析微孔激光器出射光的近场特性

微孔激光器作为应用于近场光信息存储系统中的一种新型光源，它的出射光斑的近场特性对于近场光存储是十分重要的。针对纳米孔径运用角谱进行Fox-Li数值迭代，得到不同孔径微孔激光器的基模光强分布，然后运用二维非线性时域有限差分法分析微孔激光器出射端即微孔金属膜的近场光学性质，模拟计算了不同孔径和厚度的微孔金属膜的光强近场分布，从应用于近场光存储的角度，给出反映其近场光学特性的相关数据。发现由于TM模式下金属存在局域表面等离子增强效应，使得其出射强度比TE模式高一个数量级，从而更适于作为实际中近场光存储系统和原理试验的光学头。     

多束速调管的增益带宽

 研究了M个束、N个共振腔的多束速调管(MBK)的增益和带宽，得到了描述小信号增益和带宽与器件结构参数和电子束参数关系的公式，给出了在不同参数下增益随频率的变化曲线。分析了多腔对增益，多束对带宽的影响。计算结果表明：多腔可以提高增益；多束可以降低Q值，从而可以增中带宽，带宽增加工了3.6%，还可以提高增益；对于MBK，频率交叉调谐对增加带宽不如频率调谐好；空间电荷波只对增益有影响，对带宽没有影响。最后，预估一种L带多束速调管的增益带宽为8.1%。     

未确知数学方法处理物理实验数据

介绍未确知数学方法，并用未确知数学方法分析处理物理实验数据，与传统的数据处理方法比较，未确知数学方法不必对数据作任何假设，因此更合理，也更符合实际。     

三阶非线性时滞差分方程解的渐近性

研究了一类三阶非线性变滞量差分方程解的渐近性,给出了该类方程的非振动解当n→+∞时渐近趋于零或趋于某有限数值的几个充分条件.     

实现细粒煤深度脱硫产业化的研究

根据我国高硫煤的赋存特点,提出采用微细介质重介旋流器及细泥选择性絮凝组合工艺实现细粒煤的深度脱硫,无机硫脱除率可大幅度提高,分选下限明显降低,是实现煤炭深度脱硫降灰产业化的有效技术途径.