Abstract
We consider the problem of empty tank cars relocation in a railway petroleum transportation. Biggest petroleum carrier in Kazakhstan railway network provides transportation service to the customers. The majority of its expenses consist of an empty run of the cars, as they move to the load stations. Given the demand for empty tank cars, the company seeks to reduce total costs to satisfy all the demand within a planning period. We provide a mathematical model for this problem in terms of integer programming and perform an experimental study with LP solver. Numerical calculations show that new model allows to significantly reduce empty run of the tank cars on the railway petroleum logistics market lowering the total expenses of the company by more than 10% level.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Alekseeva, E., Kochetov, Yu.: Matheuristics and exact methods for the discrete \(({\rm r|p})\)-centroid problem. In: Talbi, El.-G. (ed.) Metaheuristics for Bi-level Optimization. SCI, vol. 482, pp. 189–219. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37838-6_7
Beresnev, V.L., Melnikov, A.A.: A capacitated competitive facility location problem. J. Appl. Ind. Math. 10(1), 61–68 (2016)
Diakova, Z., Kochetov, Yu.: A double VNS heuristic for the facility location and pricing problem. Electron. Not. Discrete Math. 39, 29–34 (2012)
Heydari, R., Melachrinoudis, E.: A path-based capacitated network flow model for empty railcar distribution. Ann. Oper. Res. 253, 773–798 (2017)
Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., Kochetov, Yu.: Competitive location in cognitive radio networks. 4OR 13(1), 81–110 (2015)
Lavlinskii, S.M., Panin, A.A., Plyasunov, A.V.: Comparison of models of planning public-private partnership. J. Appl. Ind. Math. 10(3), 356–369 (2016)
Narisetty, A.K., Richard, J.-P.P., Ramcharan, D., Murphy, D., Minks, G., Fuller, J.: An optimization model for empty freight car assignment at union pacific railroad. Interfaces 38(2), 89–102 (2008)
Panin, A.A., Plyasunov, A.V.: On complexity of the bilevel location and pricing problems. J. Appl. Ind. Math. 8(4), 574–581 (2014)
Plyasunov, A.V., Panin, A.A.: The pricing problem. I: Exact and approximate algorithms. J. Appl. Ind. Math. 7(2), 241–251 (2013)
Plyasunov, A.V., Panin, A.A.: The pricing problem. II: Computational complexity. J. Appl. Ind. Math. 7(3), 420–430 (2013)
Acknowledgments
The work was supported by the program of fundamental scientific researches of the SB RAS I.5.1., project 0314-2016-0014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Davydov, I.A. (2018). An Optimization Model for Empty Tank Cars Movement at Railway Petroleum Logistics Market. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds) Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science, vol 871. Springer, Cham. https://doi.org/10.1007/978-3-319-93800-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-93800-4_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93799-1
Online ISBN: 978-3-319-93800-4
eBook Packages: Computer ScienceComputer Science (R0)