时间费用优化

时间费用优化中松驰网络与群截面理论

The theory of loose network snd GROUP-CUT in the optimization of time - cost

结果表明自适应遗传算法在解决时间费用优化问题的高效性。

The results show that the more efficiency to solve the time and cost optimization problem using adaptive genetic algorithm .

一种特殊形式线性规划问题的解法判别系数法线性规划应用于工程网络图中时间费用优化

Solution for Special Linear Programming Model & Discriminating Coefficient Solution Application of Linear Programming Model to Time-Cost Optimum Problem in Engineering Network Graphic Method

对于离散型的时间费用优化，每件工作它除了自己的编号，还有若干种施工方法，每种施工方法中有消耗的费用和资源。

For the discrete time and cost optimization problem , each work not only has its number but also has some construction methods that have consumption cost and resource .

首先将资源有限&工期最短和离散型时间费用优化问题有机进行结合，对其进行综合优化的第一部分。

Firstly , combine the " limited resource & the shortest duration " problem with discrete time and cost optimization problem that as the first step of comprehensive optimization .

时间费用优化。该问题按照时间和费用的关系可分为两种类型：连续型时间费用优化和离散型时间费用优化。

According to the relationship between time and cost , the problem can be divided into two types : continuous time and cost optimization and discrete time and cost optimization .

对时间费用优化问题的研究始于上世纪六十年代初，但搭接网络中的时间费用优化研究尚未取得突破性进展。

The research on time-cost optimization problem started from the early 1960s . However , no breakthrough has been made with regard to the solution of the problem in the overlapped network .

PERT网络时间-费用优化数学模型及程序实现

Optimum mathematical model and program of PERT time-cost networks

目前，时间-费用优化问题的研究一般是在CPM网络中进行的，传统的CPM网络不符合项目进行过程中的实际情况。

At present , the study of the time-cost optimization is generally in the CPM network , and the traditional CPM network is not in line with the actual situation of the project .

论时间/费用优化中资金的时间价值

Time value of capital in time / cost trade - offs problems

网络计划时间&费用优化的二次规划方法

Quadratic Programming Method for Optimization of Cost-duration in Planning Networks

线性规划应用于工程网络图中时间&费用优化

Application of Linear Programming Model to Time-Cost Optimum Problem in Engineering Network Graphic Method

网络的时间&费用优化初探

A Simple Probing on Time-Cost Optimization of Network

工程计划的时间&费用优化

Time-Cost Optimization for an Project Plan

本文提出了网络计划时间&费用优化的二次规划方法，用二次函数逼近费用函数，从无约束最优工期出发，逐步加入有效约束，求得最优解。

This paper presents a quadratic programming method for the optimization of the cost-duration in planning networks .

提出了利用最小费用流原理求解时间-费用优化模型的方法。

A method is proposed to solve time-cost trade-off model for activity networks by using the minimum cost flow principle .

此法具有占计算机内存小且计算量少等优点，可以有效地解决较大的网络计划非线性时间&费用优化问题。

The optimal value is obtained by applying a quadratic function to approach the cost function and by progressively adding active constraints based on unconstrain optimal duration .

最后，通过分析比较，得出动态时间／费用优化的结论才更为可靠与准确的结论。一种多时段费用变动型存贮策略的优化

By analysis and comparison , the conclusion that only dynamic optimization is accurate is drawn . Optimalization for a Multiple Time Period EOQ Inventory Policy with Cost Changes

所提出的求解时间-费用优化模型的算法，提高了求解问题的效率，可用于大型工程网络的费用优化。

A detail example is presented to illustrate the steps of the proposed method . The algorithm for the time-cost trade-off model improves the efficiency in solving the problem and is suitable for large scale activity network .

该模型为重复性项目调度问题的执行者提供了方便有效的时间-费用权衡优化方法，文章最后例举了一项桥梁施工过程的计算实例，并且利用遗传算法进行求解。

The model for repeatability project scheduling problem was to provide the executor of the effective time-cost tradeoff optimization method , and finally there is an example of time calculation for a bridge , and by using the genetic algorithm .

研究了给定网络容量扩充目标要求下，求解所有关于时间和费用的Pareto优化解问题并提供了相应算法。

Also developed are the algorithm to find all pareto optimal solutions about time and cost with given expanded network max-flow .

项目的时间-费用权衡的优化过程就是对执行模型的重新组合过程，这类问题属于Np-hard问题。

The process of the optimization of time-cost tradeoff is the new combination of the models , this kind of problem is Np-hard questions .