浅论建设项目投资控制的重点

建设项目控制的重点应放在投资决策和设计阶段中,否则会造成巨大的损失。这不仅需要人们改革组织结构和管理体制,更需要从根本上转变思想观念。     

An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

Formulating the minimum concave cost capacitated network flow problem as an integer concave minimization problem, we establish finite branch and bound algorithms, in which the branching operation is the so–called integral rectangular partition and the bounding procedure is performed by the classical minimum linear cost flow problem on subnetworks. For the special case that the flow cost function is concave on a fixed number of arcs and linear on the others, an upper bound of the running time is given. Received: 19 July 1996 / Accepted: 8 July 1997     

软件开发成本估算模型的研究

软件成本准确地估算和管理控制是软件项目开发成功的基础。该文分析了影响软件开发成本估算准确性的因素,并详细介绍了IBM模型、Putnam模型和COCOMO模型三种经验估算模型,探讨了软件开发成本估算的新需求。     

沙特房建项目水电安装设计优化与成本控制探讨

以沙特阿美吉赞应急响应中心工程建设为例,阐述项目图纸会审阶段的设计优化处理、施工工艺、材料比选、安装方法等方面的成本控制措施,从而为今后类似工程施工提供参考和借鉴。     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

一种新的修正恒模算法

阐述了恒模算法(CMA)、修正恒模算法(MCMA)和判决引导(DD)算法的基本原理。针对CMA和MCMA收敛速度慢,固定步长条件下收敛速度和剩余误差之间存在矛盾的缺陷,在分析CMA误差特性的基础上,利用DD算法误差函数的模值和判决器输出构造新的误差函数,提出了一种新的变步长MCMA。新算法在加快收敛速度的同时保持小的剩余误差。仿真结果表明,新算法比CMA和MCMA收敛速度快,均衡输出剩余码间干扰(ISI)小而且能克服相位偏移,具有很好的实用性。     

浅议进一步发挥军事代表在武器装备全寿命费用管理中的作用

阐述了军事代表参与武器装备全寿命费用管理的现状和作用,提出了提高军事代表费用管理参与率的措施.     

新型铸造镁合金开发现状

总结了近年来镁合金在高温抗蠕变、高韧性、高强度、高耐蚀性、降低成本和改善工艺性六大热点研究方向上取得的典型研究成果，重点阐述了对高温抗蠕变铸造镁合金的研究。并从热力学角度分析了镁合金中可能出现的各相对镁合金高温蠕变过程的影响，叙述了Mg-Al、Mg-Zn和Mg-RE系耐热合金的最新发明。     

基于交通信息和配电网全成本电价的电动汽车充电负荷调度方法

电动汽车的集中充电行为会在一定程度造成交通拥堵,为解决这一问题,综合考虑交通信息和电网信息,基于边际定价理论得到配电网节点边际电价和交通阻塞成本,构建电动汽车充电的全成本电价模型。在此基础上,提出一种考虑交通信息和配电网全成本电价的电动汽车充电负荷调度方法。通过仿真算例验证,该方法在满足电动汽车充电需求的同时可以有效缓解交通拥堵。