Multiobjective evolutionary finance-based scheduling: Individual projects within a portfolio

Research output: Contribution to journalReview articlepeer-review

34 Scopus citations

Abstract

Under cash-constrained conditions, the fulfillment of cash demands of the ongoing projects within a contractor's portfolio constitutes a set of conflicting objectives. As the profit values of the individual projects are maximized should their cash demands be fulfilled, the profit values of the individual projects constitute a set of multiple conflicting objectives. A Strength Pareto Evolutionary Algorithm (SPEA) employing a logic-preserving crossover and mutation operators is developed to devise Pareto-optimal finance-based schedules of multiple projects. The Pareto-optimal solutions allow the decision makers select the best solution based on their own preference. The developed SPEA reproduced the same results of an existing GAs-based multi objective technique in the literature. The proposed approach has been developed and implemented on multiple projects of different sizes. The results proved the effectiveness of the SPEA to solve finance-based scheduling problems of multiple projects considering the conflict in their profit realization.

Original languageEnglish
Pages (from-to)755-766
Number of pages12
JournalAutomation in Construction
Volume20
Issue number7
DOIs
StatePublished - Nov 2011

Bibliographical note

Funding Information:
This research is a part of a research project No. SB070012 supported by King Fahd University of Petroleum & Minerals which is gratefully acknowledged by the Authors.

Keywords

  • Cash flow
  • Financial management
  • Multiobjective
  • Optimization
  • Project financing
  • Scheduling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Civil and Structural Engineering
  • Building and Construction

Fingerprint

Dive into the research topics of 'Multiobjective evolutionary finance-based scheduling: Individual projects within a portfolio'. Together they form a unique fingerprint.

Cite this