Abstract
We address the Interval Transportation Problem (ITP), that is, the transportation problem where supply and demand are uncertain and vary over given ranges. We are interested in determining the best and worst values of the optimal cost of the ITP among all the realizations of the uncertain parameters. In this paper, we prove some general properties of the best and worst optimum values from which the existing results derive as a special case. Additionally, we propose an Iterated Local Search algorithm to find a lower bound on the worst optimum value. Our algorithm is competitive compared to the existing approaches in terms of quality of the solution and in terms of computational time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xie, F., Butt, M.M., Li, Z., Zhu, L.: An upper bound on the minimal total cost of the transportation problem with varying demands and supplies. Omega 68, 105–118 (2017)
Charnes, A., Cooper, W.W .: The stepping stone method of explaining linear programming calculations in transportation problems. Manag. Sci. 1(1), 49–69 (1954)
Frank, L.: Hitchcock. The distribution of a product from several sources to numerous localities. Stud. Appl. Math. 20(1–4), 224–230 (1941)
Bianco, L., Cerrone, C., Cerulli, R., Gentili, M.: Locating sensors to observe network arc flows: Exact and heuristic approaches. Comput. Oper. Res. 46, 12–22 (2014)
Cerrone, C., Cerulli, R., Gentili, M.: Vehicle-id sensor location for route flow recognition: models and algorithms. Eur. Oper. Res. 247(2), 618–629 (2015)
Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78, 163–171 (2017)
Carrabs, F., Cerrone, C., Cerulli, R., D’Ambrosio, C.: Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem, pp. 165–177. Springer International Publishing, Cham (2017)
Hladık, M.: Interval linear programming: a survey. In: Linear programming-new frontiers in theory and applications, pp. 85–120 (2012)
Gabrel, V., Murat, C., Remli, N.: Linear programming with interval right hand sides. Int. Trans. Oper. Res. 17(3), 397–408 (2010)
Chanas, S., Delgado, M., Verdegay, J.L., Vila, M.A.: Interval and fuzzy extensions of classical transportation problems. Transp. Plan. Technol. 17(2), 203–218 (1993)
Liu, S.-T.: The total cost bounds of the transportation problem with varying demand and supply. Omega 31(4), 247–251 (2003)
Juman, Z.A.M.S., Hoque, M.A.: A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies. Eur. J. Oper. Res. 239(1), 146–156 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Cerulli, R., D’Ambrosio, C., Gentili, M. (2017). Best and Worst Values of the Optimal Cost of the Interval Transportation Problem. In: Sforza, A., Sterle, C. (eds) Optimization and Decision Science: Methodologies and Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-67308-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-67308-0_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67307-3
Online ISBN: 978-3-319-67308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)