基于遗传算法和指标满意度求解的第三方物流企业物流中心选址方法

本利用AHP和模糊综合评价法评价物流中心选址的定性指标、用量化选址模型结合遗传算法计算定量指标，再藉助指标满意度求解把定性和定量的指标进行综合，从而为决策对物流中心选址做出科学的决策提供支持。     

基于实数编码的免疫遗传算法研究

针对标准遗传算法(SGA)搜索效率低、收敛速度慢等缺陷，在免疫遗传算法的基础上提出了基于实数编码的免疫遗传算法(RIGA)。研究表明，RIGA对SGA的改进是有效可行的，显示出稳健的全局优化、计算量少而解的精度高等特点，具有较高的应用价值。     

共轭斜量法在某些特征向量上收敛速度的估计

设 Ａ是对称正定矩阵，λ_1是 Ａ 的最大或最小特征值，χ_1是对应的特征向量．｛zk｝是用共轭斜量法求解方程组 Αχ＝ｂ时的近似解序列，ｅi＝Ａ～(_1)b-zi,本文给出了|x_1～Tei|较合理的上界估计式。从而为分析预处理共轭斜量法提供了进一步的理论基础。     

达草灭对莱茵衣藻(Chlamydomonas reinhardtii) 品系遗传后效应的研究

通过将莱菌衣藻（Chlamydomonas reinhardtii）6种达草灭抗性突变株分别与野生型株、丧失合成叶绿素b能力的cbnI-43等基因突变株和精氨酸依赖型突变株杂交对其后代进行四分析与随机分析，发现在Nfr-4-Nfr-7突变株中达草灭抗性状只有单一核基因遗传的性质，而在Nfr-1、Nfr-3～Nfr-7抗性株的抗性性状都是由同一个nfr-1基因（norflurazon resisanse）的突变所决定的，而Nfr-4抗性株的抗性性状是由另一滚突变等位基因nfr-2所决定的。在Nfr-1和Nfr-3抗性株中除了nfr-1基因的突变还有nfr-3基因突变的参与。     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.     

Gray code for derangements

We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.