Minimizing cost and time through single objective function in multi-choice interval valued transportation problem

Article type: Research Article

Authors: Roy, Sankar Kumar^* | Maity, Gurupada

Affiliations: Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore, West Bengal, India

Correspondence: [*] Corresponding author. Sankar Kumar Roy, Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721102, West Bengal, India. E-mail: [email protected].

Abstract: This paper explores the study of Transportation Problem (TP) under the light of multi-choice environment with interval analysis. The parameters of TP follow multi-choice interval-valued type so this form of TP is called Multi-Choice Interval Transportation Problem (MCITP). Introduction of time is an important notion in TP of this paper. Transportation time and cost, both are minimized through single objective function of TP, which is the main aim of this paper. A procedure is shown for converting from MCITP to deterministic TP and then solve it. A case study is included to illustrate the usefulness of the paper. Finally, concluding remarks and an outlook for future study are presented to this paper.

Keywords: Transportation problem, multi-choice programming, interval number, transformation technique, binary variable

DOI: 10.3233/JIFS-151656

Journal: Journal of Intelligent & Fuzzy Systems, vol. 32, no. 3, pp. 1697-1709, 2017