LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo from wikipedia

AbstractIntensive heuristic and metaheuristic research efforts have focused on the Pareto front optimization of discrete time-cost trade-off problem (DTCTP). However, very little success has been achieved in solving the problem… Click to show full abstract

AbstractIntensive heuristic and metaheuristic research efforts have focused on the Pareto front optimization of discrete time-cost trade-off problem (DTCTP). However, very little success has been achieved in solving the problem for medium and large-scale projects. This paper presents a new particle swarm optimization method to achieve an advancement in the Pareto front optimization of medium and large-scale construction projects. The proposed Pareto front particle swarm optimizer (PFPSO) is based on a multiobjective optimization environment with novel particle representation, initialization, and position-updating principles that are specifically designed for simultaneous time-cost optimization of large-scale projects. PFPSO brings several benefits for the discrete time-cost optimization, such as an adequate representation of the discrete search space, fast convergence properties, and improved Pareto front optimization capabilities. The computational experiment results reveal that the new particle swarm op...

Keywords: time cost; particle swarm; optimization; pareto; pareto front

Journal Title: Journal of Computing in Civil Engineering
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.