How to take into account general and contextual knowledge for interactive aiding design: Towards the coupling of CSP and CBR approaches

The goal of this paper is to show how it is possible to support design decisions with two different tools relying on two kinds of knowledge: case-based reasoning operating with contextual knowledge embodied in past cases and constraint filtering that operates with general knowledge formalized using constraints. Our goals are, firstly to make an overview of existing works that analyses the various ways to associate these two kinds of aiding tools essentially in a sequential way. Secondly, we propose an approach that allows us to use them simultaneously in order to assist design decisions with these two kinds of knowledge. The paper is organized as follows. In the first section, we define the goal of the paper and recall the background of case-based reasoning and constraint filtering. In the second section, the industrial problem which led us to consider these two kinds of knowledge is presented. In the third section, an overview of the various possibilities of using these two aiding decision tools in a sequential way is drawn up. In the fourth section, we propose an approach that allows us to use both aiding decision tools in a simultaneous and iterative way according to the availability of knowledge. An example dealing with helicopter maintenance illustrates our proposals.     

A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem

The two-echelon location-routing problem (LRP-2E) is raised by the design of transportation networks with two types of trips: first-level trips serving from one main depot a set of satellite depots, to be located, and second-level trips supplying customers from these satellites. In the proposed multi-start iterated local search (MS-ILS), three greedy randomized heuristics are used cyclically to get initial solutions. Each ILS run alternates between two search spaces: LRP-2E solutions, and travelling salesman (TSP) tours covering the main depot and the customers. The number of iterations allotted to a run is reduced whenever a known solution (stored in a tabu list) is revisited. MS-ILS can be reinforced by a path-relinking procedure (PR), used internally for intensification, as post-optimization, or both. On two sets with 24 and 30 LRP-2E instances, MS-ILS outperforms on average two GRASP algorithms and adding PR brings a further improvement. Our metaheuristic also surpasses a tabu search on 30 instances for a more general problem with several main depots. It is still effective on a particular case, the capacitated location-routing problem (CLRP): In a comparison with four published metaheuristics, only one (LRGTS, Prins et al., 2007) does better.     

高速冲击下人体颈椎与椎间盘接触应力分析

建立了人体头颈部有限元生物力学模型,并在颈椎与椎间盘问设置接触．以15g加速度裁荷施加于头颈部有限元模型的头部,进行高速冲击有限元分析,得出颈椎与椎间盘的接触应力分布情况．结果表明：高速冲击下C6、C7间易发生椎间盘突出;在头颈部有限元模型中设置接触奈件,可以更好地模拟头颈部的生理特性和动力学响应情况．     

绝对值方程研究进展

线性规划、二次规划、双矩阵对策等问题都能转化为线性互补问题,而线性互补问题又可以归结为绝对值方程,因此研究绝对值方程具有重要的意义。绝对值方程是一个NP-hard问题,对绝对值方程的研究现状进行了分析,给出了绝对值方程的理论研究现状,总结了绝对值方程的若干求解算法。这些算法可以归结为三类：1）逐次线性化方法,2）半光滑牛顿法,3）光滑牛顿法。指出解的存在性、构造光滑函数、采用智能算法求解以及算法收敛性分析将成为绝对值方程的研究热点。     

一类二阶时滞微分方程非局部共振问题解的存在性与唯一性

利用Mawhin连续性定理研究了一类具有时滞的二阶微分方程三点共振边值问题,获得了该边值问题解的存在性和唯一性的一些新的结果。     

无向赋权图最短通路的矩阵算法

Dijkstra算法是求赋权图最短通路中最著名的算法.但其数学的表达式却非常复杂,而且只求出起点到各点的最短通路的权.通过对赋权图进行矩阵定义以及定义相应的矩阵运算法则,就可以求出任意两点间的最短通路的权.这一算法为求赋权图的最短通路及权的编程提供了算法模型.     

渤海大街-庐山路互通立交工程土石方计算

由于基岩为太古代混合花岗岩,风化节理裂隙较多,风化程度差异较大,因此采用钻探、槽探两种方法对渤海大街－庐山路互通式立交工程进行了土石方工程施工等级划分,并应用20m×20m方格网法对该区进行了土石方计算。计算结果表明,该区区块面积145070m2,第一类上总挖方量为202562m3,第一二类土总挖方量132055m3,第三类土总挖方量31431m3．     

考虑船公司利益均衡的动态离散泊位分配问题

为了提高港口对船公司服务的公平性,研究考虑不同船公司利益均衡的动态离散泊位分配问题。综合考虑船舶在港的装卸时间、港口内泊位的可用时间、船舶的服务总成本以及任意两家船公司之间的利益均衡,提出一种离散型泊位分配的混合整数规划模型。通过仿真研究从不同角度对船公司的利益进行均衡分析,结果发现在不同的均衡度下,船公司总成本随着利益均衡度的递增而下降,降至最低成本后保持不变;而在不同角度下的整体变化趋势一致。