IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v37y2020i3p377-395.html
   My bibliography  Save this article

Multi-objective fixed-charge transportation problem using rough programming

Author

Listed:
  • Sudipta Midya
  • Sankar Kumar Roy

Abstract

This paper analyses the multi-objective fixed-charge transportation problem (MOFCTP) using rough programming. Due to globalisation of market, the parameters of MOFCTP may not be defined precisely, so the parameters of the MOFCTP are treated as rough intervals. Expected value operator is used to convert rough MOFCTP to deterministic MOFCTP. Fuzzy programming method and linear weighted-sum method are used to obtain Pareto-optimal solution from deterministic MOFCTP. A comparative study is made between the obtained solutions extracted from the methods; and thereafter we perform a procedure to analyse the sensitive analysis of the parameters in MOFCTP. Finally, in order to show the applicability of our proposed study, an example on MOFCTP is included in this paper.

Suggested Citation

  • Sudipta Midya & Sankar Kumar Roy, 2020. "Multi-objective fixed-charge transportation problem using rough programming," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 37(3), pages 377-395.
    • Handle: RePEc:ids:ijores:v:37:y:2020:i:3:p:377-395
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=105444
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shyamali Ghosh & Karl-Heinz Küfer & Sankar Kumar Roy & Gerhard-Wilhelm Weber, 2023. "Type-2 zigzag uncertain multi-objective fixed-charge solid transportation problem: time window vs. preservation technology," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(1), pages 337-362, March.

    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:ids:ijores:v:37:y:2020:i:3:p:377-395. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.