IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i6p1373-1389.html
   My bibliography  Save this article

Stochastic multi-attribute acceptability analysis-based heuristic algorithms for multi-attribute project portfolio selection and scheduling problem

Author

Listed:
  • Shiling Song
  • Tingting Wei
  • Feng Yang
  • Qiong Xia

Abstract

Selecting an appropriate project portfolio and starting work at the right time are two key decision-making problems in project and engineering management. Project portfolio selection (PPS) and scheduling become complicated when random attribute values and unknown attribute weights are simultaneously considered. To manage this complex decision-making problem, a stochastic multi-attribute acceptability analysis (SMAA)-based approach is proposed to formulate multi-attribute PPS and scheduling problem with random attribute values and unknown attribute weights. Four heuristic algorithms, namely, SMAA-based particle swarm optimisation, SMAA-based genetic algorithm, SMAA-based simulated annealing algorithm, and SMAA-based teaching–learning-based optimisation, have been developed to solve this problem. The performance of the four algorithms is also evaluated on four data sets.

Suggested Citation

  • Shiling Song & Tingting Wei & Feng Yang & Qiong Xia, 2021. "Stochastic multi-attribute acceptability analysis-based heuristic algorithms for multi-attribute project portfolio selection and scheduling problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(6), pages 1373-1389, June.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:6:p:1373-1389
    DOI: 10.1080/01605682.2020.1718018
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1718018
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1718018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:72:y:2021:i:6:p:1373-1389. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.