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

Authors: Atanu Das; Debiprasad Acharya; Manjusri Basu

Addresses: Department of Mathematics, University of Kalyani, Kalyani-741235, India ' Department of Mathematics, N.V. College, Nabadwip, Nadia, W.B., India ' Department of Mathematics, University of Kalyani, Kalyani-741235, India

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.

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.

DOI: 10.1504/IJMOR.2015.070196

International Journal of Mathematics in Operational Research, 2015 Vol.7 No.4, pp.383 - 394

Received: 21 Nov 2013
Accepted: 10 Feb 2014

Published online: 29 Jun 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article