障碍可越路线规划的符号图方法

本文给出２—Ｄ路线规划问题在障碍可越情况下的启发式符号方法．这一方法利用推理规则在由图像信息导出的连通图知识结构上进行启发式符号Ａ搜索以对空间关系进行分析和分类，以符号描述形式给出两声间路线规划方案．     

The course scheduling problem at Lufthansa Technical Training

Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AG as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A “good” operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT.     

Fast neighborhood search for the single machine total weighted tardiness problem

Most successful heuristics for solving 1||∑w_jT_j are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n³) to O(n²). We show that this result also improves the complexity of the recently developed dynasearch heuristics.     

基于遗传禁忌算法的双资源约束下并行生产线调度研究

并行生产线调度问题兼有并行机器和流程车间调度问题的特点,是一类新型的调度问题。在考虑遗传算法早熟收敛特性和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传算法和禁忌搜索算法的双资源并行作业车间的调度优化问题算法,即考虑到了产品的调度受到机器、工人等资源制约的影响,对算法中种群的构造,适应度计算,遗传操作等方面进行了研究,最后给出了实例仿真和结论。     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.     

On the multi-attribute stopping problem with general value functions

We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions.     

Distributed and Parallel Component Library

Software component library is the essential part of reuse-based software development. It is shown that making use of a single component library to store all kinds of components and from which components are searched is very inefficient. We construct multi-libraries to support software reuse and use PVM as development environments to imitate Iargescale computer, which is expected to fulfill distributed storage and parallel search of components efficiently and improve software reuse.     

几种改进的CoMFA方法比较研究血小板活化因子拮抗剂

由于传统的比较分子场分析(CoMFA)方法本身存在一些缺陷，使得分子的叠合 规则以及叠合分子的空间取向和空间位置等因素对q~2的影响很大，因此相继提出 了几种改进的CoMFA方法。为了优化CoMFA结果，应用传统的CoMFA方法和交叉验证 的R~2引导的区域选择法(q~2-GRS)、全取向搜索法（AOS）、全空间搜索法（APS） 以及比较分子相似性指数(CoMSIA)等四种改进的CoMFA方法，对18个pinusolide类 衍生物这类新发现的血小板活化因子（PAF）拮抗剂进行了比较研究。结果表明四 种改进的CoMFA方法得到的q~2值均比传统CoMFA的高。q~2-GRS方法得到的q~2值有 所提高，但综合结果并不理想，AOS与APS得到的q~2较为理想，而在CoMSIA中， q~2几乎不受空间取向或空间位置的影响。同时我们引人基于样本的偏最小二乘法 （SAMPLS）取代原AOS／APS程序中的传统PLS进行统计分析，明显提高了其运行速 度。最后，根据q~2最高的CoMFA模型和CoMSIA模型设计了几个预测活性更高的 pinusolide类似物。     

Study on pyrolysis kinetics of walnut shell

Slow pyrolysis of walnut shell which is a cheap and abundantly available solid waste was carried out using thermogravimetric analysis. The effects of raw material heating rate on the pyrolysis properties and kinetic parameters were investigated. A two-step consecutive reaction model were used to simulate the pyrolysis process. The kinetic parameters were established by using the pattern search method. Comparison between experimental data and the model prediction indicated that the two-step consecutive reaction model can better describe the slow pyrolysis of walnut shell as the formation of an intermediate during the pyrolysis process was taken into account.