A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry

The molten iron allocation problem (MIAP) is to allocate molten iron from blast furnaces to steel-making furnaces. The allocation needs to observe the release times of the molten iron defined by the draining plan of the blast furnaces and the transport time between the iron-making and steel-making stages. Time window constraints for processing the molten iron must be satisfied to avoid freezing. The objective is to find a schedule with minimum total weighted completion time. This objective reflects the practical consideration of improving steel-making efficiency and reducing operation cost caused by the need for reheating. Such a problem can be viewed as a parallel machine scheduling problem with time windows which is known to be NP-hard. In this paper, we first formulate the molten iron allocation problem as an integer programming model and then reformulate it as a set partitioning model by applying the Dantzig–Wolfe decomposition. We solve the problem using a column generation-based branch-and-price algorithm. Since the subproblem of column generation is still NP-hard, we propose a state-space relaxation-based dynamic programming algorithm for the subproblem. Computational experiments demonstrate that the proposed algorithm is capable of solving problems with up to 100 jobs to optimality within a reasonable computation time.     

水平管路清管过程流动参数变化规律模拟研究

混输管路清管技术的研究对混输管道的运行管理具有非常重要的意义。在分析清管器清管物理模型的基础上 ,建立清管器的特征参数计算模型、动态数学模型和数值计算方法 ,并进行数值模拟 ,计算出测压点压力随时间变化的数据 ,并把它们与试验数据进行比较 ,得到清管过程中压力的变化规律。通过数学模拟 ,可以计算清管过程中管道的压力分布状况 ,利用压力分布状况就可跟踪清管球在管道内的运行情况     

A unified framework of opening and closure operators with respect to arbitrary fuzzy relations

 This paper is devoted to a general concept of openness and closedness with respect to arbitrary fuzzy relations – along with appropriate opening and closure operators. It is shown that the proposed framework unifies existing concepts, in particular, the one for fuzzy preorderings as well as the triangular norm-based approach to fuzzy mathematical morphology. The author acknowledges support of the K _plus Competence Center Program which is funded by the Austrian Government, the Province of Upper Austria, and the Chamber of Commerce of Upper Austria.     

电加热井的井筒温度场数学模型

运用传热学理论，通过对稠油从井底流出井筒的温度变化、井筒原油与地层之间热交换过程的传热机理研究，建立数学模型，可以模拟不同产量、不同含水的井筒温度剖面，以及电加热所需功率，从而为稠油井电加热生产方案的制定提供科学依据。     

Evaluation codes at singular points of algebraic differential equations

We use the special geometry of singular points of algebraic differential equations on the affine plane over finite fields to study the main features and parameters of error correcting codes giving by evaluating functions at sets of singular points. In particular, one gets new methods to construct codes with designed minimum distance. This work was partially supported by MCyT BFM2001-2251.     

高含沙量岛屿海域工程建设的潮动力沉积影响研究

以高含沙量岛屿海域洋山海区为例,采用平面二维有限元数学模型模拟了该区域的流场。计算了修筑防波堤后海域底床的泥沙冲淤变化。结果表明,影响仅限于工程附近。     

A constructive approach to sequential Nash equilibria

We present a Coq-formalized proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCF-style theorem provers, i.e., it is based on inductive definitions and is computational in nature. The proof (i) uses simple computational means, only, (ii) basically is by construction, and (iii) reaches a constructively stronger conclusion than informal efforts. We believe the development is a first as far as formalized game theory goes.     

QD-Janus: A sequential implementation of Janus in Prolog

Janus is a language designed for distributed constraint programming. This paper describes QD-Janus, a sequential implementation of Janus in Prolog. The compiler uses a number of novel analyses and optimizations to improve the performance of the system. The choice of Prolog as the target language for a compiler, although unusual, is motivated by the following: (i) the semantic gap between Janus and Prolog is much smaller than that between Janus and, say, C or machine language—this simplifies the compilation process significantly, and makes it possible to develop a system with reasonable performance fairly quickly; (ii) recent progress in Prolog implementation techniques, and the development of Prolog systems whose speeds are comparable to those of imperative languages, indicates that the translation to Prolog need not entail a significant performance loss compared to native code compilers; and (iii) compilation to Prolog can benefit immediately from a significant body of work on, and implementations of, parallel Prolog systems. Our experience indicates that translation of logic programming languages to Prolog, accompanied by the development of good program analysis and optimization tools, is an effective way to quickly develop flexible and portable implementations with good performance and low cost.     

On modeling the design of cellular manufacturing systems

A new optimization model is discussed for the design of cellular manufacturing systems. It is based on an integer programming formulation that updates some other models by eliminating redundant machine assignment and cost coefficients dependent on cell configuration. To reduce computational burdens, a simplified integer programming model and a decomposition algorithm are proposed. Several computer solutions were performed to evaluate the performance of the new model. The computational results are discussed.     

面向对象机器翻译知识库IMT—KB的设计与实现

机器翻译知识库是机译系统的重要组成部分,针对传统机译知识库的不足之处,本文提出一种面向对象的机译知识体系结构,同时给出这种具有层次性和模块性机译知识库的存储组织和管理机制。