Optimizing Discounted Cash Flows in Project Scheduling—An Ant Colony Optimization Approach

The multimode resource-constrained project-scheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is strongly nondeterministic polynomial-time hard, only a few algorithms exist and the performance is still not satisfying. To design an effective algorithm for the MRCPSPDCF, this paper proposes an ant colony optimization (ACO) approach. ACO is promising for the MRCPSPDCF due to the following three reasons. First, MRCPSPDCF can be formulated as a graph-based search problem, which ACO has been found to be good at solving. Second, the mechanism of ACO enables the use of domain-based heuristics to accelerate the search. Furthermore, ACO has found good results for the classical single-mode scheduling problems. But the utility of ACO for the much more difficult MRCPSPDCF is still unexplored. In this paper, we first convert the precedence network of the MRCPSPDCF into a mode-on-node (MoN) graph, which becomes the construction graph for ACO. Eight domain-based heuristics are designed to consider the factors of time, cost, resources, and precedence relations. Among these heuristics, the hybrid heuristic that combines different factors together performs well. The proposed algorithm is compared with two different genetic algorithms (GAs), a simulated annealing (SA) algorithm, and a tabu search (TS) algorithm on 55 random instances with at least 13 and up to 98 activities. Experimental results show that the proposed ACO algorithm outperforms the GA, SA, and TS approaches on most cases.

[1]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[2]  Kum Khiong Yang,et al.  Scheduling a project to maximize its net present value: An integer programming approach , 1993 .

[3]  Yu Xu,et al.  Multi-mode project payment scheduling problems with bonus-penalty structure , 2008, Eur. J. Oper. Res..

[4]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[5]  J. Patterson,et al.  Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach , 1977 .

[6]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints , 1995 .

[7]  Linet Özdamar,et al.  A genetic algorithm approach to a general category project scheduling problem , 1999, IEEE Trans. Syst. Man Cybern. Part C.

[8]  Alf Kimms,et al.  Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds , 2001, Ann. Oper. Res..

[9]  Bert De Reyck,et al.  A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations , 1998, Eur. J. Oper. Res..

[10]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[11]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[12]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[13]  S. S. Erenguc,et al.  The resource constrained time/cost tradeoff project scheduling problem with discounted cash flows , 1996 .

[14]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[15]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[16]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[17]  Andreas Drexl,et al.  Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .

[18]  R. Kolisch,et al.  Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis , 1998 .

[19]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[20]  Luca Maria Gambardella,et al.  A COOPERATIVE LEARNING APPROACH TO TSP , 1997 .

[21]  Thomas Stützle,et al.  A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..

[22]  Rainer Kolisch,et al.  Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem , 2000, Eur. J. Oper. Res..

[23]  Erik Demeulemeester,et al.  Resource-constrained project scheduling: A survey of recent developments , 1998, Comput. Oper. Res..

[24]  Gündüz Ulusoy,et al.  Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows , 2001, Ann. Oper. Res..

[25]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[26]  M. Dorigo,et al.  Ant Colony Optimization under Uncertainty , 2005 .

[27]  S. Selçuk Erengüç,et al.  A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows , 1994, Comput. Oper. Res..

[28]  Erik Demeulemeester,et al.  Project network models with discounted cash flows a guided tour through recent developments , 1997, Eur. J. Oper. Res..

[29]  Gündüz Ulusoy,et al.  An equitable approach to the payment scheduling problem in project management , 2000, Eur. J. Oper. Res..

[30]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[31]  Gündüz Ulusoy,et al.  A survey on the resource-constrained project scheduling problem , 1995 .

[32]  L. Özdamar On scheduling project activities with variable expenditure rates , 1998 .

[33]  A. Shtub,et al.  Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows , 1997 .

[34]  Kathleen M. Eisenhardt,et al.  Dynamic optimization of cash flow management decisions: a stochastic model , 1990 .

[35]  Yong-Yi Shou Ant Colony Algorithm for Scheduling Resource Constrained Projects with Discounted Cash Flows , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[36]  Grzegorz Waligóra,et al.  Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models , 2005, Eur. J. Oper. Res..

[37]  A. H. Russell Cash Flows in Networks , 1970 .

[38]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

[39]  Marco Dorigo,et al.  The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[40]  Seyed Taghi Akhavan Niaki,et al.  A genetic algorithm for resource investment problem with discounted cash flows , 2006, Appl. Math. Comput..

[41]  Marliese Uhrig-Homburg,et al.  Cash-Flow Shortage as an Endogenous Bankruptcy Reason , 2005 .

[42]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[43]  S. Selcuk Erenguc,et al.  A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows , 1996 .

[44]  Gündüz Ulusoy,et al.  Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling , 1989 .

[45]  Luís Vladares Tavares A review of the contribution of Operational Research to Project Management , 2002, Eur. J. Oper. Res..