核电资源替代煤电资源的临界时点分析模型

随着煤电资源的逐渐耗竭,传统电力资源的替代资源开发成为我国电力可持续发展的重要途径。为探讨核电资源替代煤电资源的经济规律,构建了一个电力资源社会价值评估模型。以电力资源社会价值最大化为目标,运用动态优化理论求解,得出核电资源替代煤电资源的临界替代时点,分析核电资源替代煤电资源的替代条件,剖析电力生产外部性对电力资源配置效率的影响程度及导致电力资源配置低效率的具体原因。认为电力生产部门的外部性影响电力资源的配置效率,阻碍核电资源替代煤电资源的发展进程。就电力生产部门的实际情况提出了相应的政策建议,以促进低碳清洁的核电资源替代煤电资源,实现环境、经济与电力可持续发展。     

具有交易成本的证券投资组合选择：一种求解方法

本研究一类带交易成本证券投资组合选择的求解,在风险不超过某个阈值的假设下,我们给出一种求解方法,最后本通过实例计算表明该方法是有效的。     

Spying on the cost structure of naive bidding competitors via linear programming models

A linear programming model is constructed which enables a firm to estimate its competitor's cost structure when the competitor adheres to a non-randomized strategy. The existence of the model makes randomized bidding prudent apart from game theory considerations. The need for increased curriculum attention to optimal bidding is highlighted.     

遗传算法求解带容量限制的最小费用流问题

研究了带容量限制的带固定费用和可变费用的最小费用流问题,发现该问题是混合0-1整数规划问题,不存在多项式算法.在研究了最优解的结构后,结合最优解的结构特点为之设计了遗传算法,然后构造了一个100个节点的特殊网络,用计算机做了100例计算,验证了该算法具有很好的近似比和很快的收敛速度.     

基于智能化信息处理的建筑工程造价短期预测

提出了一种新的基于智能化信息处理的建筑工程造价短期预测模型.该模型首次利用数据的高阶统计信息,提出了改进独立分量分析技术.通过构建适用于建筑工程造价的属性重构空间,挖掘出表征能力更强的造价独立属性,用于神经网络的学习和训练,从而建立了全新的建筑工程造价短期预测智能模型.该模型通过发挥独立分量分析强大的信号分离能力,增强了神经网络的学习效率,提高了预测精度.实例数据验证了文中所建模型的有效性.     

Minmax scheduling with job-classes and earliness–tardiness costs

We address scheduling problems with job-dependent due-dates and general (possibly nonlinear and asymmetric) earliness and tardiness costs. The number of distinct due-dates is substantially smaller than the number of jobs, thus jobs are partitioned to classes, where all jobs of a given class share a common due-date. We consider the settings of a single machine and parallel identical machines. Our objective is of a minmax type, i.e., we seek a schedule that minimizes the maximum earliness/tardiness cost among all jobs.     

Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach

When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making optimal machine-job assignments and processing time decisions so as to minimize total manufacturing cost while the makespan being upper bounded by a known value, denoted as ?-constraint approach for a bicriteria problem. We then give optimality properties for the resulting single criterion problem. We provide alternative methods to compute cost lower bounds for partial schedules, which are used in developing an exact (branch and bound) algorithm. For the cases where the exact algorithm is not efficient in terms of computation time, we present a recovering beam search algorithm equipped with an improvement search procedure. In order to find improving search directions, the improvement search algorithm uses the proposed cost bounding properties. Computational results show that our lower bounding methods in branch and bound algorithm achieve a significant reduction in the search tree size that we need to traverse. Also, our recovering beam search and improvement search heuristics achieve solutions within 1% of the optimum on the average while they spent much less computational effort than the exact algorithm.     

A periodical replacement model based on cumulative repair‐cost limit

This paper considers a periodical replacement model based on a cumulative repair‐cost limit, whose concept uses the information of all repair costs to decide whether the system is repaired or replaced. The failures of the system can be divided into two types. One is minor failure that is assumed to be corrected by minimal repair, while the other is serious failure where the system is damaged completely. When a minor failure occurs, the corresponding repair cost is evaluated and minimal repair is then executed if this accumulated repair cost is less than a pre‐determined limit L, otherwise, the system is replaced by a new one. The system is also replaced at scheduled time T or at serious failure. Long‐run expected cost per unit time is formulated and the optimal period T* minimizing that cost is also verified to be finite and unique under some specific conditions. Copyright © 2007 John Wiley & Sons, Ltd.     

Allocation of jobs and identical resources with two pooling centers

We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above by the number of servers.      

带模糊约束的最小费用流问题

本文首次提出了带模糊约束的最小费用流问题,建立了相应的数学模型并给出了求解这一模型的有关算法。最后,给出了一个具体实例。