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

• Record Type: Journal Article
• Authors: Das, Atanu; Acharya, Debiprasad; Basu, Manjusri
• Is Part Of: International journal of mathematics in operational research. Volume 7:Number 4(2015)
• Page Start: 383
• Page End: 394
• Publication Date: 2015
• Subjects: 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; Operations research -- Mathematical models -- Periodicals; Operations research -- Mathematics -- Periodicals; Decision making -- Mathematical models -- Periodicals; 658.4033
• Languages: English
• ISSNs: 1757-5850

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.