Pareto Front Particle Swarm Optimizer for Discrete Time-Cost Trade-Off Problem

2017 ◽  
Vol 31 (1) ◽  
pp. 04016040 ◽  
Author(s):  
Saman Aminbakhsh ◽  
Rifat Sonmez
1998 ◽  
Vol 49 (11) ◽  
pp. 1153 ◽  
Author(s):  
E. Demeulemeester ◽  
B. De Reyck ◽  
B. Foubert ◽  
W. Herroelen ◽  
M. Vanhoucke

2007 ◽  
Vol 10 (4-5) ◽  
pp. 311-326 ◽  
Author(s):  
Mario Vanhoucke ◽  
Dieter Debels

2007 ◽  
Vol 41 (1) ◽  
pp. 61-81 ◽  
Author(s):  
Amir Azaron ◽  
Masatoshi Sakawa ◽  
Reza Tavakkoli-Moghaddam ◽  
Nima Safaei

2015 ◽  
Author(s):  
Shuangshuang Nie ◽  
Jihong Gao

The resource-constrained project scheduling problem has received broad attentions and was evolved into various sub-problems such as resource-constrained discrete time-cost tradeoff problem. The resource leveling problem was proposed to reduce the resource fluctuation and was always studied independently with RCPSP. This research proposed a new model which integrates the resource leveling problem and resource-constrained time-cost tradeoff problem. The evolutionary multi-objective optimization technique, strength Pareto evolutionary approach II (SPEA II) was applied to calculate the Pareto front of time and cost. The resource leveling measured by the metric, resource release/re-hiring, was converted to resource cost. The analysis of the time complexity of the model showed that the runtime of the algorithm was polynomial times of the number of activities. The results of case testing showed that the model was reasonably accurate in comparison with a proposed baseline model.


Sign in / Sign up

Export Citation Format

Share Document