An improved heuristic approach for the interval immune transportation problem

•We consider a transportation problem with uncertain supplies and demands ranging in predefined intervals.•We investigate the problem of finding the worst value of the optimal cost among all data realizations.•We present new theoretical properties of the problem.•We provide a novel integer linear programming formulation based on some polyhedral properties of the problem.•We propose a new heuristic approach that outperforms the best solution approaches currently used in the literature.