首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
This paper involves the multi-mode project payment scheduling problem where the activities can be performed with one of several discrete modes and the objective is to assign activities’ modes and progress payments so as to maximize the net present value of the contractor under the constraint of project deadline. Using the event-based method the basic model of the problem is constructed and in terms of the different payment rules it is extended as the progress based, expense based, and time based models further. For the strong NP-hardness of the problem which is proven by simplifying it to the deadline subproblem of the discrete time–cost tradeoff problem, we develop two heuristic algorithms, namely simulated annealing and tabu search, to solve the problem. The two heuristic algorithms are compared with the multi-start iterative improvement method as well as random sampling on the basis of a computational experiment performed on a data set constructed by ProGen project generator. The results show that the proposed simulated annealing heuristic algorithm seems to be the most promising algorithm for solving the defined problem especially when the instances become larger. In addition, the effects of several key parameters on the net present value of the contractor are analyzed and some conclusions are given based on the results of the computational experiment.  相似文献   

2.
This paper involves the multi-mode project payment scheduling problem with bonus–penalty structure where activities can be performed with several modes and a bonus–penalty structure exists at the deadline of the project. In the problem the decisions on when to schedule events and payments, the magnitude of each payment, and the performing mode of each activity need to be optimized. A two-module simulated annealing heuristic is proposed to solve the mixed integer non-linear programming models for the contractor and the client, and a satisfactory solution, which consists of payment event set, event schedule, and payment amount set, may be found through iterations between the heuristic’s two modules. The profits of the two parties of the contract are changed significantly by the bonus–penalty structure and the structure may be considered as a coordination mechanism essentially, which may enhance the flexibility of payment scheduling and be helpful for the two parties to get more profits from the project. Through solving and analyzing an instance the insight that the bonus–penalty structure may advance the project completion effectively and improve the profits of the two parties in the meantime can be obtained.  相似文献   

3.
曹萍  张剑  熊焰 《运筹与管理》2019,28(9):192-199
目前带有惩罚结构的项目支付进度模型通常以时间或成本为激励因子,来约束承包商保证进度和节约成本,未考虑质量因素对支付进度的影响。质量是项目管理的主要目标和决定项目成败的关键因素,研究质量对项目支付进度的影响有助于激励承包商提高表现从而保证项目质量。以软件项目为例,以软件产品质量为激励因子, 分别从承包商和客户的角度构建现金流净现值最大化为目标的项目支付进度优化模型,分析承包商表现水平及风险规避对双方收益的影响。针对模型的特点设计了遗传算法和禁忌搜索算法的混合算法求解模型。最后通过算例分析表明, 质量激励因子对项目的支付进度和双方的收益均存在较大的影响,为双方协商支付进度提供决策支持。  相似文献   

4.
In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. A project is represented by an activity-on-node (AoN) network. A positive cash flow is associated with each activity. Four different payment models are considered: lump-sum payment at the completion of the project, payments at activities' completion times, payments at equal time intervals and progress payments. The objective is to maximize the net present value of all cash flows of the project. Local search metaheuristics: simulated annealing and tabu search are proposed to solve this strongly NP-hard problem. A comprehensive computational experiment is described, performed on a set of instances based on standard test problems constructed by the ProGen project generator, where, additionally, the activities' cash flows are generated randomly with the uniform distribution. The metaheuristics are computationally compared, the results are analyzed and discussed and some conclusions are given.  相似文献   

5.
This paper involves the multi-mode capital-constrained project payment scheduling problem, where the objective is to assign activity modes and payments so as to maximize the net present value (NPV) of the contractor under the constraint of capital availability. In the light of different payment patterns adopted, four optimization models are constructed using the event-based method. For the NP-hardness of the problem, metaheuristics, including tabu search and simulated annealing, are developed and compared with multi-start iterative improvement and random sampling based on a computational experiment performed on a data set generated randomly. The results indicate that the loop nested tabu search is the most promising procedure for the problem studied. Moreover, the effects of several key parameters on the contractor’s NPV are investigated and the following conclusions are drawn: The contractor’s NPV rises with the increase of the contractor’s initial capital availability, the payment number, the payment proportion, or the project deadline; the contractor has a decreasing marginal return as the contractor’s initial capital availability goes up; the contractor’s NPVs under the milestone event based payment pattern are not less than those under the other three payment patterns.  相似文献   

6.
A comparison of local search methods for flow shop scheduling   总被引:1,自引:0,他引:1  
Local search techniques are widely used to obtain approximate solutions to a variety of combinatorial optimization problems. Two important categories of local search methods are neighbourhood search and genetic algorithms. Commonly used neighbourhood search methods include descent, threshold accepting, simulated annealing and tabu search. In this paper, we present a computational study that compares these four neighbourhood search methods, a genetic algorithm, and a hybrid method in which descent is incorporated into the genetic algorithm. The performance of these six local search methods is evaluated on the problem of scheduling jobs in a permutation flow shop to minimize the total weighted completion time. Based on the results of extensive computational tests, simulated annealing is found to generate better quality solutions than the other neighborhood search methods. However, the results also indicate that the hybrid genetic descent algorithm is superior to simulated annealing.  相似文献   

7.
从项目双方的视角出发,研究融资能力约束下的Max-npv项目调度问题。首先进行问题界定,构建由两个子模型构成的多模式Max-npv项目调度优化模型。随后,鉴于问题的强NP-hard属性,设计针对两个子模型迭代循环求解的禁忌搜索启发式算法,得到项目双方都满意的解。最后用一个实际案例对研究进行验证说明,并分析关键参数对合同双方收益的影响,结果表明:与实际进度安排相比,满意进度安排下合同双方的收益均有显著的提升;承包商和业主的融资能力、项目截止日期、承包商收益底线、折现率及支付比例均会对双方的收益产生重要影响。  相似文献   

8.
This paper evaluates variants of a simulated annealing algorithm which solve the total cost minimization problem in activity networks in the case that discrete time-cost execution modes are allowed on the project activities. This problem is a special case of the well known discrete time-cost trade-off problem (DTCTP). Based on a sample of randomly generated activity networks, formal tests of statistical significance are utilized to test both the quality of solutions and the time efficiency of algorithms versus problem factors. A procedure issued from the extreme values statistics is also applied on problem instances in order to determine, on the one hand, the confidence interval estimate of the optimum solution for each algorithm and, on the other hand, when to stop the running of an algorithm.  相似文献   

9.
Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling   总被引:4,自引:0,他引:4  
In this paper the resource-constrained project scheduling problem with multiple execution modes for each activity and the makespan as the minimization criterion is considered. A simulated annealing approach to solve this problem is presented. The feasible solution representation is based on a precedence feasible list of activities and a mode assignment. A comprehensive computational experiment is described, performed on a set of standard test problems constructed by the ProGen project generator. The results are analyzed and discussed and some final remarks are included.  相似文献   

10.
The simulated annealing (SA) algorithm is a well-established optimization technique which has found applications in many research areas. However, the SA algorithm is limited in its application due to the high computational cost and the difficulties in determining the annealing schedule. This paper demonstrates that the temperature parallel simulated annealing (TPSA) algorithm, a parallel implementation of the SA algorithm, shows great promise to overcome these limitations when applied to continuous functions. The TPSA algorithm greatly reduces the computational time due to its parallel nature, and avoids the determination of the annealing schedule by fixing the temperatures during the annealing process. The main contributions of this paper are threefold. First, this paper explains a simple and effective way to determine the temperatures by applying the concept of critical temperature (TC). Second, this paper presents systematic tests of the TPSA algorithm on various continuous functions, demonstrating comparable performance as well-established sequential SA algorithms. Third, this paper demonstrates the application of the TPSA algorithm on a difficult practical inverse problem, namely the hyperspectral tomography problem. The results and conclusions presented in this work provide are expected to be useful for the further development and expanded applications of the TPSA algorithm.  相似文献   

11.
In this paper, we present an approach for finding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisfied, based on the concept of simulated annealing. Simulated annealing is generally applicable, and can be used to obtain solutions arbitrarily close to an optimum. However, the standard simulated annealing approach with a conventional neighbourhood structure does not yield good solutions for this problem, since this is a multiple partitioning problem and the number of subsets is not fixed. For this problem, we develop an effective neighbourhood structure and a new acceptance criterion. We also assess the effectiveness of the developed algorithm. The results show that this proposed algorithm outperforms, in terms of solution quality, any other algorithm using tabu search. The computational time of the procedure is proportional to the number of nodes in the graph.  相似文献   

12.
This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.  相似文献   

13.
In this paper, we consider a permutation flowshop scheduling problem with deteriorating jobs. The objective is to minimize the total tardiness of all jobs. A branch-and-bound algorithm incorporating with a dominance property and a lower bound is developed. Furthermore, two metaheuristic algorithms, the simulated annealing algorithm, and the particle swarm optimization method, are proposed. Finally, computational studies are given.  相似文献   

14.
The problem of scheduling activities in a project to maximize its Net Present Value (NPV) has been solved for the case where net cash flow magnitudes are independent of the time of realization. This paper models a more realistic version of this problem — because of incentive payments and penalties for early and late event occurrences, respectively, and because of changing costs of resources over time, net cash flow magnitudes are dependent on the time of realization. We formulate an optimization program for this more general problem and present a simulated annealing solution approach. We test different implementation strategies for this algorithm and suggest a method for choosing neighborhood moves. We compare the NPVs of the solutions obtained from our formulation with the NPVs of early start schedules and with late start schedules for 168 different problems. These computational results show that the simulated annealing approach consistently produces substantially better solutions than the early start or late start schedules. Even poor simulated annealing neighborhood moves give improved solutions for most problems studied.  相似文献   

15.
The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non-zero values, and thus, setup times are treated as separate from processing times. Several recent algorithms, an insertion algorithm, two genetic algorithms, three simulated annealing algorithms, two cloud theory-based simulated annealing algorithms, and a differential evolution algorithm are adapted and proposed for the problem. An extensive computational analysis has been conducted for the evaluation of the proposed algorithms. The computational analysis indicates that one of the nine proposed algorithms, one of the simulated annealing algorithms (ISA-2), performs much better than the others under the same computational time. Moreover, the analysis indicates that the algorithm ISA-2 performs significantly better than the earlier existing best algorithm. Specifically, the best performing algorithm, ISA-2, proposed in this paper reduces the error of the existing best algorithm in the literature by at least 90% under the same computational time. All the results have been statistically tested.  相似文献   

16.
《Applied Mathematical Modelling》2014,38(21-22):5347-5355
This paper investigates the multi-mode resource availability cost problem with recruitment and release dates for resources. This problem is a more realistic model and extended case of the resource availability cost problem. The project contains activities interrelated by finish–start precedence relations with zero time lags, which require a set of renewable resources. First, a mixed integer programming formulation is proposed for the problem. Then, simulated annealing (SA) algorithm is proposed to obtain a satisfying solution for this NP-hard problem. The effectiveness of the proposed algorithm is demonstrated through comprehensive experimentation based on 300 test problems. The results are analyzed and discussed.  相似文献   

17.
This paper considers a single machine scheduling problem with the learning effect and multiple availability constraints that minimizes the total completion time. To solve this problem, a new binary integer programming model is presented, and a branch-and-bound algorithm is also developed for solving the given problem optimally. Since the problem is strongly NP-hard, to find the near-optimal solution for large-sized problems within a reasonable time, two meta-heuristics; namely, genetic algorithm and simulated annealing are developed. Finally, the computational results are provided to compare the result of the binary integer programming, branch-and-bound algorithm, genetic algorithm and simulated annealing. Then, the efficiency of the proposed algorithms is discussed.  相似文献   

18.
The objective of this study is to use the simulated annealing method to solve minisum location-allocation problems with rectilinear distances. The major advantage of the simulated annealing method is that it is a very general and efficient algorithm for solving combinatorial optimization problems with know objective functions. In this study, a simulated annealing algorithm was developed to solve the location-allocation problems, and its performance was compared with two other popular methods for solving location-allocation problems. The results show that simulated annealing is a good alternative to the two methods, as measured by both the solution quality and the computational time.  相似文献   

19.
In this paper the usage of a stochastic optimization algorithm as a model search tool is proposed for the Bayesian variable selection problem in generalized linear models. Combining aspects of three well known stochastic optimization algorithms, namely, simulated annealing, genetic algorithm and tabu search, a powerful model search algorithm is produced. After choosing suitable priors, the posterior model probability is used as a criterion function for the algorithm; in cases when it is not analytically tractable Laplace approximation is used. The proposed algorithm is illustrated on normal linear and logistic regression models, for simulated and real-life examples, and it is shown that, with a very low computational cost, it achieves improved performance when compared with popular MCMC algorithms, such as the MCMC model composition, as well as with “vanilla” versions of simulated annealing, genetic algorithm and tabu search.  相似文献   

20.
A Two Stage Search Heuristic for Scheduling Payments in Projects   总被引:6,自引:0,他引:6  
When the Net Present Value (NPV) of a project is used as a measure of its financial performance, effective management of cash flows over the duration of the project is critical for improved profitability. Progress payments are a major component of project cash flows. In many project environments, the contractor can negotiate payment terms. Payments are typically tied to completion of project activities and therefore have significant impact on the schedule of activities and the timing of the payments. In this paper, we consider the problem of simultaneously determining the amount, timing and location of progress payments in projects to maximize NPV. Due to the combinatorial nature of the problem, heuristics are a practical approach to solving the problem. We propose a two-stage heuristic where simulated annealing is used in the first stage to determine a set of payments. In the second stage, activities are rescheduled to improve project NPV. We compare the performance of this general purpose heuristic with other problem-dependent heuristics from the literature. Our results indicate that the simulated annealing heuristic significantly outperforms the parameter-based heuristics. Although rescheduling in the second stage improves NPV, increases are relatively small in magnitude. While the specific parameters settings suggested by the simulated annealing heuristic in this study may have limited generalizability at this time due to the narrow range of problems tested, our analysis suggests that a pure simulated annealing approach is a very attractive alternative for obtaining good heuristic solutions to the complex problem of scheduling payments in projects.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号