A decomposition heuristics for the container ship stowage problem

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases. This work has been developed within the research area: “The harbour as a logistic node” of the Italian Centre of Excellence on Integrated Logistics (CIELI) of the University of Genoa, Italy     

The k-means range algorithm for personalized data clustering in e-commerce

This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications.     

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

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

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.     

On local optima in multiobjective combinatorial optimization problems

In this article, local optimality in multiobjective combinatorial optimization is used as a baseline for the design and analysis of two iterative improvement algorithms. Both algorithms search in a neighborhood that is defined on a collection of sets of feasible solutions and their acceptance criterion is based on outperformance relations. Proofs of the soundness and completeness of these algorithms are given.     

遗传算法在构象搜寻中的应用

遗传算法是一种模仿自然进化进程的新颖的启发式优化方法。通过它，人们可以在计算机上对所需的各种问题实施进化操作，最终产生理想的结果。遗传算法现已被广泛于计算机辅助设计、工程设计、系统模拟等领域并取得了极大的成功。本文拟对遗传算法在对大、中、小分子的构象搜寻中的应用作一较全面的综述。     

几种改进的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类似物。     

Local elevation: A method for improving the searching properties of molecular dynamics simulation

Summary The concept of memory has been introduced into a molecular dynamics algorithm. This was done so as to persuade a molecular system to visit new areas of conformational space rather than be confined to a small number of low-energy regions. The method is demonstrated on a simple model system and the 11-residue cyclic peptide cyclosporin A. For comparison, calculations were also performed using simulated temperature annealing and a potential energy annealing scheme. Although the method can only be applied to systems with a small number of degrees of freedom, it offers the chance to generate a multitude of different low-energy structures, where other methods only give a single one or few. This is clearly important in problems such as drug design, where one is interested in the conformational spread of a system.