产品回收逆向物流网络设计问题的两阶段启发式算法

针对产品回收逆向物流网络设计问题,设计了一种嵌套了模拟退火算法的两阶段启发式算法。第一阶段确定回收点的选址-分配-存储的联合决策;第二阶段确定回收中心的选址-运输的联合决策,两个阶段相互迭代,从而实现最优解的搜索。通过与遗传算法比较,证明了两阶段启发式算法是一种有效的算法。     

On the Choice of Nugget in Kriging Modeling for Deterministic Computer Experiments

Kriging is commonly used for developing emulators as surrogates for computationally intensive simulations. One difficulty with kriging is the potential numerical instability in the computation of the inverse of the covariance matrix, which can lead to large variability and poor performance of the kriging predictor. First, we study some causes of ill-conditioning in kriging. We then study the use of nugget in kriging to overcome the numerical instability. Some asymptotic results on its interpolation bias and mean squared prediction errors are presented. Finally, we study the choice of the nugget parameter based on some algebraic lower bounds and use of a regularizing trace. A simulation study is performed to show the differences between kriging with and without nugget and to demonstrate the advantages of the former. This article has supplementary materials online.     

Improved and self-tuned occurrence heuristics

In this note we present three efficient variations of the occurrence heuristic, adopted by many exact string matching algorithms and first introduced in the well-known Boyer–Moore algorithm. Our first heuristic, called improved-occurrence heuristic, is a simple improvement of the rule introduced by Sunday in his Quick-Search algorithm. Our second heuristic, called worst-occurrence heuristic, achieves its speed-up by selecting the relative position which yields the largest average advancement. Finally, our third heuristic, called jumping-occurrence heuristic, uses two characters for computing the next shift. Setting the distance between these two characters optimally allows one to maximize the average advancement. The worst-occurrence and jumping-occurrence heuristics tune their parameters according to the distribution of the characters in the text. Experimental results show that the newly proposed heuristics achieve very good results on average, especially in the case of small alphabets.     

Individual behavior and macro social properties. An agent-based model

The paper aims at presenting an agent-based modeling exercise to illustrate how small differences in the cognitive properties of agents can generate very different macro social properties. We argue that it is not necessary to assume highly complicated cognitive architectures to introduce cognitive properties that matter for computational social science purposes. Our model is based on different simulation settings characterized by a gradual sophistication of behavior of agents, from simple heuristics to macro-micro feedback and other second-order properties. Agents are localized in a spatial interaction context. They have an individual task but are influenced by a collective coordination problem. The simulation results show that agents can generate efficiency at a macro level particularly when socio-cognitive sophistication of their behavior increases.

Fast search algorithms for computational protein design

One of the main challenges in computational protein design (CPD) is the huge size of the protein sequence and conformational space that has to be computationally explored. Recently, we showed that state‐of‐the‐art combinatorial optimization technologies based on Cost Function Network (CFN) processing allow speeding up provable rigid backbone protein design methods by several orders of magnitudes. Building up on this, we improved and injected CFN technology into the well‐established CPD package Osprey to allow all Osprey CPD algorithms to benefit from associated speedups. Because Osprey fundamentally relies on the ability of to produce conformations in increasing order of energy, we defined new strategies combining CFN lower bounds, with new side‐chain positioning‐based branching scheme. Beyond the speedups obtained in the new ‐CFN combination, this novel branching scheme enables a much faster enumeration of suboptimal sequences, far beyond what is reachable without it. Together with the immediate and important speedups provided by CFN technology, these developments directly benefit to all the algorithms that previously relied on the DEE/ combination inside Osprey* and make it possible to solve larger CPD problems with provable algorithms. © 2016 Wiley Periodicals, Inc.     

含间苯基聚醚酮醚酮酮的合成和性能研究

自英国ＩＣＩ公司开发聚醚醚酮（ＰＥＥＫ）并于八十年代初期商品化以来［１］,聚芳醚酮作为一类新型结构的高性能特种工程塑料得到了惊人的发展,不同结构的聚芳醚酮相继出现．Ｊａｎｓｏｎ［２］等以对苯二甲酰氯（ＴＰＣ）和４,４′ 二苯氧基二苯酮（ＤＰＢＰ）为单...     

An effective solution for a real cutting stock problem in manufacturing plastic rolls

We confront a practical cutting stock problem from a production plant of plastic rolls. The problem is a variant of the well-known one dimensional cutting stock, with particular constraints and optimization criteria defined by the experts of the company. We start by giving a problem formulation in which optimization criteria have been considered in linear hierarchy according to expert preferences, and then propose a heuristic solution based on a GRASP algorithm. The generation phase of this algorithm solves a simplified version which is rather similar to the conventional one dimensional cutting stock. To do that, we propose a Sequential Heuristic Randomized Procedure (SHRP). Then in the repairing phase, the solution of the simplified problem is transformed into a solution to the real problem. For experimental study we have chosen a set of problem instances of com-mon use to compare SHRP with another recent approach. Also, we show by means of examples, how our approach works over instances taken from the real production process. All authors are supported by MEC-FEDER Grant TIN2007-67466-C02-01 and by contract CN-05-127 of the University of Oviedo and the company ERVISA, and by FICYT under grant BP04-021.     

ALAD基因多态性与血铅水平关系的Meta分析

对有关ALAD基因多态性与血铅水平关系的研究进行了meta分析。通过Medline、CBMDisc及同行收集 1 7篇文献 ,剔除重复报道或不合格文献后共有 9个独立研究纳入meta分析。结果表明 ,对低水平接触人群 (血铅 <1 0 μg/dL) ,效应尺度d的均值为 0 1 3 8(P =0 0 46) ;对高水平接触人群 (血铅 >2 0 μg/dL) ,效应尺度d的均值为 0 484(P =0 0 0 0 )。两组人群的基因型分布频率没有差异 ,ALAD1- 2 / 2 - 2 和ALAD1- 1分别占总人群的 89 3 %和 1 0 7%。结论为ALAD基因多态性可影响血铅水平 ,但还需完善设计进一步研究。铅接触水平可能会改变ALAD基因多态性对血铅水平的影响     

Quantum Heat Engines with Complex Working Media,Complete Otto Cycles and Heuristics

Quantum thermal machines make use of non-classical thermodynamic resources, one of which include interactions between elements of the quantum working medium. In this paper, we examine the performance of a quasi-static quantum Otto engine based on two spins of arbitrary magnitudes subject to an external magnetic field and coupled via an isotropic Heisenberg exchange interaction. It has been shown earlier that the said interaction provides an enhancement of cycle efficiency, with an upper bound that is tighter than the Carnot efficiency. However, the necessary conditions governing engine performance and the relevant upper bound for efficiency are unknown for the general case of arbitrary spin magnitudes. By analyzing extreme case scenarios, we formulate heuristics to infer the necessary conditions for an engine with uncoupled as well as coupled spin model. These conditions lead us to a connection between performance of quantum heat engines and the notion of majorization. Furthermore, the study of complete Otto cycles inherent in the average cycle also yields interesting insights into the average performance.     

Heuristic Procedures for the Capacitated Vehicle Routing Problem

In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem. This second algorithm is designed to be used in a branch and cut approach to solve to optimality CVRP instances. In both heuristics, the initial solution is improved using tabu search techniques. Computational results over a set of known instances, most of them with a proved optimal solution, are given.