IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v7y2015i4p383-394.html
   My bibliography  Save this article

An algorithm for finding time-cost trade-off pairs in generalised bi-criterion capacitated transportation problem

Author

Listed:
  • Atanu Das
  • Debiprasad Acharya
  • Manjusri Basu

Abstract

In this paper, we consider generalised bi-criterion capacitated transportation problem. A solution procedure is presented to find the optimum transportation cost. Also, an algorithm is presented to find the optimum time-cost trade of pair in a generalised bi-criterion transportation problem giving the same priority to both time and cost. The algorithm identifies efficient time-cost trade-off pairs. Among the trade-off pairs we identify ideal solution. Then we reach the optimum trade-off pair having the minimum D1 -distance from the ideal solution. Finally, a numerical example is illustrated to support the algorithm.

Suggested Citation

  • Atanu Das & Debiprasad Acharya & Manjusri Basu, 2015. "An algorithm for finding time-cost trade-off pairs in generalised bi-criterion capacitated transportation problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 7(4), pages 383-394.
    • Handle: RePEc:ids:ijmore:v:7:y:2015:i:4:p:383-394
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=70196
    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.

    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:ijmore:v:7:y:2015:i:4:p:383-394. 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=320 .

    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.