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

Atanu Das, Debiprasad Acharya and Manjusri Basu

International Journal of Mathematics in Operational Research, 2015, vol. 7, issue 4, 383-394

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 D₁ -distance from the ideal solution. Finally, a numerical example is illustrated to support the algorithm.

Keywords: generalised transport problem; time-cost trade-offs; trade-off pairs; ideal solution; D1-distance; capacitated transport problem; optimum costs; transport costs; time minimisation; transport times. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=70196 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:7:y:2015:i:4:p:383-394

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().