IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0274619.html
   My bibliography  Save this article

Genetic algorithmic based approach for multiple-objective probabilistic fractional programming problem involving discrete random variables

Author

Listed:
  • Berhanu Belay
  • Adane Abebaw

Abstract

This manuscript presents a technique for solving a multiple-objective probabilistic fractional programming problem with discrete random variables. A multiple-objective probabilistic mathematical model is constructed with fractional objectives. In the model, some parameters of coefficients and right hand side parameters of restrictions are assumed as random variables having Pascal and Hyper geometric distributions. The feasibility of probabilistic constraints is checked by means of stochastic simulation. Genetic algorithm approach method is used to obtain the Pareto optimal solution of the proposed model without finding the deterministic model. Genetic algorithm parameters are fixed in all generation. The proposed method is coded by C++ programming language. To illustrate the method, a numerical example and practical example on the case of supply chain management are presented. The result shows that the values of the objective functions are conflicting each other.

Suggested Citation

  • Berhanu Belay & Adane Abebaw, 2022. "Genetic algorithmic based approach for multiple-objective probabilistic fractional programming problem involving discrete random variables," PLOS ONE, Public Library of Science, vol. 17(9), pages 1-14, September.
    • Handle: RePEc:plo:pone00:0274619
    DOI: 10.1371/journal.pone.0274619
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0274619
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0274619&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0274619?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
    ---><---

    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:plo:pone00:0274619. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.