VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.     

Hermite Interpolation of Data Sets by Minimal Spline Spaces

Hermite interpolation of 2n + k data by spline spaces of order k with n variable knots counting multiplicities is studied. A characterization of the minimal spline spaces which admit a solution of the interpolation problem is obtained. A sufficient condition on uniqueness of interpolating spline functions is given.     

Mathematical modelling and analytical solution for workpiece temperature in grinding

This paper deals with modelling the workpiece temperature field produced during the grinding process. The proposed model is given in terms of a two-dimensional boundary-value problem where the interdependence among the grinding wheel, the workpiece and the coolant is described by two variable functions in the boundary condition. An explicit integral form solution is constructed using the Laplace and Fourier transforms and the Green’s function method.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

一种带时间窗和车辆数目限制的车辆路线问题及其算法

本文提出了带时间窗和车辆数目限制的车辆路线问题的数学模型,针对该问题的特征构造了一种路线生成算法和禁忌搜索算法,并对Solomon提出的C1、R1、RC1类数据集给出了数值运算的结果,实验结果表明算法是有效的.     

Iterative variable aggregation and disaggregation in IP: An application

This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions.     

Using the gradients of temperature and internal parameters in Continuum ThermodynamicsIntroduction des gradients de température et de paramètres internes en Thermodynamique des Milieux Continus

In this paper, the possibility of using the gradients of the temperature and of the internal parameters as additional state variables in Continuum Thermodynamics is considered. The expressions of the two principles are discussed and Clausius–Duhem inequality is derived under an appropriate statement of the internal entropy production. Several formulations are proposed and compared to existing results in the literature. To cite this article: P. Ireman, Q.S. Nguyen, C. R. Mecanique 332 (2004).     

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.