OPTIMAL GOODS STOWAGE IN AIR CARGO TERMINALS
DOI:
https://doi.org/10.18372/2306-1472.48.58Abstract
Abstract. Lack of system research done by domestic and foreign scientists in the field of optimal cargostraffic distribution problem in Air Cargo Terminal, proves necessity of investigation and optimization of thisprocess. Mathematical models and algorithms of optimal problem solving for air cargos distribution inwarehouses on the basis of established functional dependence between freight flow stowage in warehousesand transport vehicle loading (unloading) processes are presented in the article.Keywords:algorithms, dimensions of air cargo terminal, effectiveness of loading-unloading processes,freight flow, models.References
Базара, М.; Шетти, К. Нелинейное
программирование. Теория и алгоритмы. –
Москва: Мир, 1982. – 583 с.
[Bazara, M.; Shetti, K. 1982. Nonlinear
programming. Theory and algorithms. Moscow. Mir.
p.] (in Russian).
Михайлевич, В.С.; Трубин, В.А.; Шор, Н.З.
Оптимизационные задачи производственно-
транспортного планирования. Модели, методы,
алгоритмы. – М.: Наука, 1986. – 260 с.
[Mychailevych, V.S.; Trubin, V.A.; Shor, N.Z.
Optimization problems of productive and
transport planning. Models, methods, algorithms.
Moscow. Nauka. 260 р.] (in Russian).
Трубин, В.А. Два класса задач размещения на
древовидных сетях // Кибернетика. – 1983. –
№ 4. – C. 84–87.
[Trubin, V.A. 1983. Two classes of location
problems on tree-like networks. Cybernetics. N 4:
–87.] (in Russian).
Юдин, Д.Б.; Гольштейн, Е.М. Линейное
программирование. Теория, методы и
приложения. – Москва: Наука, 1969. – 424 с.
[Yudin, D.B.; Golshtein, E.M. 1969. Linear
programming. Theory, methods and applications.
Moscow. Nauka. 424 р.] (in Russian).
Ahuja, R.K., Thomas, L., Orlin, J.B. 1993.
Network flows, theory, algorithms, and applications.
Prentice – Hall. Inc. A Simon & Schuser Company.
New-Jersey. 846 р.
Пападимитриу, Х.; Стайглиц, К.
Комбинаторная оптимизация. Алгоритмы и
сложность. – Москва: Мир, 1985. – 510 с.
[Papadimitriu, X.; Staiglits, K. 1985.
Combinatorial optimization. Algorithms and
complexity. Moscow. Mir. 510 р.] (in Russian).
Cook, W.; Cunningham, W.H.; Pulleyblank,
W.R.; Schrijver, A. 1998.Combinatorial
Optimization. New York: John Wiley & Sons, Inc.
Yannakakis, M. 1997. Computational
complexity. Local Search in Combinatorial
Optimization. Ed. E.H.L. Aarts and J.K. Lenstra.
Chichester, England: J. Willey and Sons. P. 19-55.
Ху, Т. Целочисленное программирование и
потоки в сетях. – Москва: Мир, 1974. – 519 с.
[Hu, T. 1974. Integer programming and
flows in networks. Moscow. Mir. 519 р. ] (in
Russian).
Схейвер, А. Теория линейного и
целочисленного программирования. – Москва:
Мир, 1991. – 702 с.
[Skhaver, A. 1991.Theory of linear and integer
programming. Moscow. Mir. 702 р.] (in
Russian).
