Fully Interval Integer Transhipment Problem- A Solution Approach - Intelligence Science III Access content directly
Conference Papers Year : 2021

Fully Interval Integer Transhipment Problem- A Solution Approach

G. Sudha
  • Function : Author
  • PersonId : 1153166
G. Ramesh
  • Function : Author
  • PersonId : 1153167
D. Datta
  • Function : Author
  • PersonId : 1153168
K. Ganesan
  • Function : Author
  • PersonId : 1153169

Abstract

We present an improved interval Vogel’s approximation algorithm for the initial feasible solution of a transhipment problem involving fully interval integer numbers in this paper. The interval variant of MODI algorithm is used to measure the optimality of the interval feasible solution. In a transportation problem, shipments are only permitted between source-sink pairs, while in a transhipment problem, shipments can be permitted both between sources and sinks. Furthermore, there may be points where units of a substance may be transferred from a source to a sink. To demonstrate the effectiveness of the proposed algorithm, a numerical example is given.
Fichier principal
Vignette du fichier
512271_1_En_17_Chapter.pdf (1.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03741707 , version 1 (01-08-2022)

Licence

Attribution

Identifiers

Cite

G. Sudha, G. Ramesh, D. Datta, K. Ganesan. Fully Interval Integer Transhipment Problem- A Solution Approach. 4th International Conference on Intelligence Science (ICIS), Feb 2021, Durgapur, India. pp.196-206, ⟨10.1007/978-3-030-74826-5_17⟩. ⟨hal-03741707⟩
18 View
3 Download

Altmetric

Share

Gmail Facebook X LinkedIn More