直观推导式演进特征投影法测定不同方法提取的国产血竭中龙血素B的含量

利用HPLC-DAD产生的二维数据和化学计量学方法-直观推导式演进特征投影法（HELP），解析了不同提取方法得到的国产血竭中的重叠色谱峰，并对其中的指标性成分-龙血素B进行了含量测定，结果满意。这表明这化学计量学方法与现代分析手段有机结合，将为中药等复杂体系的分析提供一条新途径。     

应用固定投资费用松弛策略的换热网络优化

启发式算法优化有固定投资费用的换热网络时，由于存在整型变量而造成结构进化困难，提出固定投资费用松弛策略.对固定投资费用进行松弛处理实现对数学模型的简化，当换热器换热量很小时固定投资费用几乎为零，随着换热量的增大，固定投资费用以一定斜率逐步增大最终等于实际值.通过松弛强度系数控制变化斜率，在保证优化结果可靠性的基础上引导存在结构进化障碍的换热器生成或消去.对文献中两个算例的优化结果进行分析，考察不同松弛强度下对换热器生成、消去的作用.提出基于固定投资费用松弛策略的强制进化随机游走算法，并应用于换热网络实例.     

一种新的交通网络设计优化算法

交通网络设计问题是研究如何用定量的方法在已有交通网络上添加或扩容某些路段的问题.文章在回顾交通网络设计问题文献的基础上,提出了基于图论网络优化思想的解决该类问题的一种新思路,给出了启发式算法,并进行了算法复杂性分析,最后通过算例验证了其有效性.     

A goal-driven approach to the 2D bin packing and variable-sized bin packing problems

In this paper, we examine the two-dimensional variable-sized bin packing problem (2DVSBPP), where the task is to pack all given rectangles into bins of various sizes such that the total area of the used bins is minimized. We partition the search space of the 2DVSBPP into sets and impose an order on the sets, and then use a goal-driven approach to take advantage of the special structure of this partitioned solution space. Since the 2DVSBPP is a generalization of the two-dimensional bin packing problem (2DBPP), our approach can be adapted to the 2DBPP with minimal changes. Computational experiments on the standard benchmark data for both the 2DVSBPP and 2DBPP shows that our approach is more effective than existing approaches in literature.     

A direct heuristic algorithm for linear programming

AnO(n ³) mathematically non-iterative heuristic procedure that needs no artificial variable is presented for solving linear programming problems. An optimality test is included. Numerical experiments depict the utility/scope of such a procedure.     

双需求集货送货一体化车辆路径问题的数学模型及算法

本文研究了具有总时间和车容量约束的双需求集货送货一体化车辆路径问题,在综合考虑运输费用和车辆出行固定费用的前提下,建立了该问题的整数线性规划模型,并分别给出了求解该模型的精确算法和基于节约准则的启发式算法。最后通过一个具体实例验证了算法的有效性。     

Exploring greedy criteria for the dynamic traveling purchaser problem

Given a set of products and a set of markets, the traveling purchaser problem looks for a tour visiting a subset of the markets to satisfy products demand at the minimum purchasing and traveling costs. In this paper, we analyze the dynamic variant of the problem (D-TPP) where the quantity made available in each market for each product may decrease over time. We introduce and compare several greedy strategies and test their impact on the solution in terms of feasibility and costs. In particular, we study an incremental approach where an initial naive strategy is improved and refined by a number of variants. Some of the proposed heuristics take into account either one of the two objective costs, while others are based on both traveling and purchasing costs. Extensive computational results are also provided on randomly generated instances.     

装备维修器材生产路径双目标问题优化决策方法研究

在装备维修器材供应保障中,针对精确保障背景下部队用户对器材保障精度的要求,构建了最小化总成本和最大化订单精准执行率的双目标优化决策模型。在ε-约束法框架内,开发可生成近似Pareto前沿的两阶迭代启发式算法,并采用模糊逻辑决策法选择符合决策者偏好的折中最优解。随机实例测试结果表明所提出的模型和算法可以很好地应用在双目标优化问题的研究中,并在求解不同规模实例时表现出优异的性能。     

Surrogate constraint normalization for the set covering problem

The set covering problem (SCP) is central in a wide variety of practical applications for which finding good feasible solutions quickly (often in real-time) is crucial. Surrogate constraint normalization is a classical technique used to derive appropriate weights for surrogate constraint relaxations in mathematical programming. This framework remains the core of the most effective constructive heuristics for the solution of the SCP chiefly represented by the widely-used Chvátal method. This paper introduces a number of normalization rules and demonstrates their superiority to the classical Chvátal rule, especially when solving large scale and real-world instances. Directions for new advances on the creation of more elaborate normalization rules for surrogate heuristics are also provided.     

一种求解物流设施二次分配问题的混合分布估计算法

为了求解物流设施二次分配问题,提出了一种混合分布估计算法(HEDA)。首先,根据QAP的距离和物流量矩阵信息,提出了一种基于假设物流中心启发式规则的种群初始化方法,用于提高初始种群的质量和算法的搜索效率;其次,针对HEDA的概率模型,提出了一种概率矩阵初始构型生成机制和扰动操作,用于提高算法的全局探索能力;最后,在分析QAP的结构性质的基础上,设计了一种基于快速评价的局部搜索策略,用于提高算法的局部开发能力。仿真计算实验和算法比较验证了HEDA的优化性能。