Using elitist particle swarm optimization to facilitate bicriterion time-cost trade-off analysis

The present study develops a new optimization algorithm to find the complete time-cost profile (Pareto front) over a set of feasible project durations, i.e., it solves the time-cost trade-off problem. To improve existing methods, the proposed algorithm aims to achieve three goals: (1) to obtain the entire Pareto front in a single run; (2) to be insensitive to the scales of time and cost; and (3) to treat all existing types of activity time-cost functions, such as linear, nonlinear, discrete, discontinuous, and a hybrid of the above. The proposed algorithm modifies a population-based search procedure, particle swarm optimization, by adopting an elite archiving scheme to store nondominated solutions and by aptly using members of the archive to direct further search. Through a fast food outlet example, the proposed algorithm is shown effective and efficient in conducting advanced bicriterion time-cost analysis. Future applications of the proposed algorithm are suggested in the conclusion.

[1]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

[2]  I-Tung Yang,et al.  Chance-Constrained Time–Cost Tradeoff Analysis Considering Funding Variability , 2005 .

[3]  Robert I. Carr,et al.  TIME-COST TRADE-OFF AMONG RELATED ACTIVITIES , 1989 .

[4]  Heng Li,et al.  Using machine learning and GA to solve time-cost trade-off problems , 1999 .

[5]  W. Verdini,et al.  Nonlinear time/cost tradeoff models in project management , 1995 .

[6]  Martin Skutella,et al.  Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem , 1997, Math. Oper. Res..

[7]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[8]  Xiaodong Li,et al.  Particle swarm optimization-based schemes for resource-constrained project scheduling , 2005 .

[9]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[10]  Tarek Hegazy.  Optimization of construction time-cost trade-off analysis using genetic algorithms , 1999 .

[11]  Chung-Wei Feng,et al.  Using genetic algorithms to solve construction time-cost trade-off problems , 1997 .

[12]  E. W. Davis,et al.  Project Management With Cpm, Pert and Precedence Diagramming , 1983 .

[13]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[14]  D. K. H. Chua Senior,et al.  A TIME-COST TRADE-OFF MODEL WITH RESOURCE CONSIDERATION USING GENETIC ALGORITHM , 1997 .

[15]  M. Dessouky,et al.  Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept , 1977 .

[16]  S. Elmaghraby.  Resource allocation via dynamic programming in activity networks , 1993 .

[17]  E Bonabeau,et al.  Swarm Intelligence: A Whole New Way to Think about Business , 2001 .

[18]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[19]  Jonathan E. Fieldsend,et al.  Using unconstrained elite archives for multiobjective optimization , 2003, IEEE Trans. Evol. Comput..

[20]  Stephan Foldes,et al.  PERT and crashing revisited: Mathematical generalizations , 1990 .

[21]  Sou-Sen Leu,et al.  GA-BASED MULTICRITERIA OPTIMAL MODEL FOR CONSTRUCTION SCHEDULING , 1999 .

[22]  Peter E.D. Love,et al.  Using improved genetic algorithms to facilitate time-cost optimization , 1997 .

[23]  Andries Petrus Engelbrecht,et al.  A study of particle swarm optimization particle trajectories , 2006, Inf. Sci..

[24]  Mohan M. Kumaraswamy,et al.  Applying Pareto Ranking and Niche Formation to Genetic Algorithm-Based Multiobjective Time–Cost Optimization , 2005 .

[25]  Mohan M. Kumaraswamy,et al.  Applying a Genetic Algorithm-Based Multiobjective Approach for Time-Cost Optimization , 2004 .

[26]  Jonathan E. Fieldsend,et al.  A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts , 2005, EMO.

[27]  Prabuddha De,et al.  The discrete time-cost tradeoff problem revisited , 1995 .

[28]  A. Kanda,et al.  PROJECT CRASHING WITH VARIATIONS IN REWARD AND PENALTY FUNCTIONS: SOME MATHEMATICAL PROGRAMMING FORMULATIONS , 1988 .

[29]  Ren-Jye Dzeng,et al.  Searching for Better Negotiation Agreement Based on Genetic Algorithm , 2005 .

[30]  I-Tung Yang,et al.  Impact of budget uncertainty on project time-cost tradeoff , 2005, IEEE Transactions on Engineering Management.

[31]  Cengiz Haksever,et al.  Flexible Model for Time'Cost Tradeoff Problem , 2004 .

[32]  Chung-Wei Feng,et al.  Construction Time-Cost Trade-Off Analysis Using LP/IP Hybrid Method , 1995 .

[33]  Andries P. Engelbrecht,et al.  Computational Intelligence: An Introduction , 2002 .

[34]  J. Horowitz,et al.  Critical Path Problems with Concave Cost-Time Curves , 1972 .

[35]  Robert Blynn Harris,et al.  Precedence and Arrow Networking Techniques for Construction , 1980 .

[36]  Jacek M. Zurada,et al.  An approach to multimodal biomedical image registration utilizing particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.