A conformal mapping approach for investigating the free-boundary seepage from symmetric channels

We present a new method to investigate the two-dimensional free-boundary groundwater seepage from symmetric soil channels into a homogeneous isotropic porous medium. We use Levi–Civitá’s function to construct an integral representation for the conformal mapping of the complex potential domain onto the physical flow domain. A genetic algorithm (GA) is used to calculate the coefficients of the Maclaurin series expansion of Levi–Civitá’s function. The coordinates of the points from the channel contour, calculated by means of the integral representation, must satisfy the analytic equation of the contour. We use this condition to define the objective function of the genetic algorithm. Levi–Civitá’s function is afterwards used to calculate the seepage loss, the free lines, the streamlines, the equipotential lines, the isobars and the velocity field. Some examples illustrate the method.     

带冲突关系装箱问题的启发式求解算法

现实物流活动中大量存在的食品、药品和危险品等货物的分组包装问题属于带冲突关系的装箱问题(BPPC),其优化目标是在满足货物间冲突限制的前提下完成装箱操作,并最小化使用货箱的数量。本文从实际需求出发,基于货物之间的冲突关系、装箱顺序和货箱容量等约束建立相应的数学规划模型;随后设计了求解BPPC问题的启发式算法,算法通过迭代求解最大团结构实现货物间冲突关系的消去,根据当前货物最大团采用改进降序首次适应算法(FFD)完成货物装箱操作,并通过“洗牌”策略对已有装箱方案进行局部优化;最后,针对Iori算例数据,将以上算法与基于图着色的启发式算法进行比较分析,结果表明,本文算法是求解BPPC问题更为有效的方法。     

软件项目支付进度问题研究

软件项目的复杂性和特点使得其支付进度问题较具特殊性。针对软件质量的差异性,对软件项目支付进度问题进行研究。以承包商净现值最大化为优化目标,构建了具有惩罚结构的支付进度优化模型,该模型反映了不同软件质量对承包商收益的影响;针对该问题的特点设计了启发式求解算法;最后通过一个算例对模型进行了验证。可为承包商在签订外包合同及外包实施中的策略提供决策依据。     

A new framework for implicit restarting of the Krylov–Schur algorithm

This paper introduces a new framework for implicit restarting of the Krylov–Schur algorithm. It is shown that restarting with arbitrary polynomial filter is possible by reassigning some of the eigenvalues of the Rayleigh quotient through a rank‐one correction, implemented using only the elementary transformations (translation and similarity) of the Krylov decomposition. This framework includes the implicitly restarted Arnoldi (IRA) algorithm and the Krylov–Schur algorithm with implicit harmonic restart as special cases. Further, it reveals that the IRA algorithm can be turned into an eigenvalue assignment method. Copyright © 2014 John Wiley & Sons, Ltd.     

具有多个不可用时间段的单机供应链排序问题

在单机供应链排序问题中, 机器会有多个长度确定的不可用时间段,它仅可以在可用时间段内加工工件,且每个可用时间段的长度不大于给定的常数.多个完工工件可组成一批由一个容量无限制的运输工具发送给客户.问题的目标是如何 安排工件的加工、发送以及不可用时间段,以使总发送时间与总发送费用之和达到最小. 对于工件加工可恢复的情况,可在多项式时间 O(n^2) 内得到最优序. 对于工件加工不可恢复的情况,证明了问题是强NP-难的, 并提出了~2-近似算法.     

工件可拒绝排序问题综述

可拒绝排序问题是兴起于2000年前后的有代表性、应用背景极强的的排序问题,是经典排序问题的衍生和推广.经典排序问题总是要求每个工件必须被加工,然而在实际中由于某些特殊原因,决策者会选择拒绝加工某些工件.把允许工件被拒绝的这类问题称为工件可拒绝排序问题,有的文献称之为外包的排序问题.这些问题不仅具有很强的应用价值,在理论上也有重要的意义.近年来该领域受到越来越广泛的关注,新的研究成果不断涌现.现就离线、在线情况下的可拒绝排序问题的进展情况作了全面介绍,展示了已有的研究成果和新的问题,给出了此方面的比较重要的参考文献,旨在帮助感兴趣的读者迅速了解问题研究的进展并由此进入此研究领域的前沿.     

ADAPTIVE QUADRILATERAL AND HEXAHEDRAL FINITE ELEMENT METHODS WITH HANGING NODES AND CONVERGENCE ANALYSIS

In this paper we study the convergence of adaptive finite element methods for the gen- eral non-attine equivalent quadrilateral and hexahedral elements on 1-irregular meshes with hanging nodes. Based on several basic ingredients, such as quasi-orthogonality, estimator reduction and D6fler marking strategy, convergence of the adaptive finite element methods for the general second-order elliptic partial equations is proved. Our analysis is effective for all conforming Qm elements which covers both the two- and three-dimensional cases in a unified fashion.     

Ant colony approach to constrained redundancy optimization in binary systems

This paper presents an ant colony optimization algorithm to address the constrained redundancy allocation problem in order to maximize system reliability for complex binary systems. The constraints involved, though separable, are both linear and non-linear. We couple an adaptive penalty function with the basic ant colony approach to handle highly constrained problems and embed a local search technique to find still better locally optimal solutions. The proposed algorithm has been tested on a large number of problems, containing even up to 500 subsystems, with both fixed and randomly generated parameters. Experimental results demonstrate the advantage of the proposed algorithm to solve similar types of problems.     

Comparison between mathematical modeling and experimental identification of a spatial slider–crank mechanism

In this paper, Hamilton’s principle, Lagrange multiplier, geometric constraints, partitioning method and Baumgarte stabilization method (BSM) are employed to derive the dynamic equations of a spatial slider–crank mechanism that is driven by a servomotor. The formulation considers the effects of links masses, external forces and motor electric inputs. Comparing dynamic responses between the experimental results and numerical simulations, dynamic modeling gives a wonderful interpretation for the spatial slider–crank mechanism. In this paper, a new identification method based on real-coded genetic algorithm (RGA) is presented to identify the parameters of a spatial slider–crank mechanism. The method promotes the calculation efficiency very much, and is calculated by real-code without the operations of encoding and decoding. The results of numerical simulations and experimental results prove that the identification method is feasible. The contributions of this paper are that the comparison of mathematical modeling and identification between numerical simulations and experimental results are all realized.