STOCHASTIC OPTIMIZATION MODELS IN TRANSPORTATION LOGISTICS

  • Anna Vladimirovna Zykina Omsk State Technical University
  • Olga Nikolaevna Kaneva Omsk State Technical University

Abstract

The paper deals with the transportation logistics problems in the conditions of incomplete information. The research includes several formulations of the stochastic optimization problem for different variants of the relationship "Resources reserves – Resources consumption". For the solvability of these problems we propose two-stage scheme for solving stochastic transportation problem. The novelty of the two-stage problem stochastic programming formulation has been contained in the statement of the second stage problem. Choosing of compensation plan is determined from the solution of the linear complementarity problem.

Author Biographies

Anna Vladimirovna Zykina, Omsk State Technical University

Head of the Department of Applied Mathematics and Fundamental, Doctor of Physical and Mathematical Sciences, Professor

Olga Nikolaevna Kaneva, Omsk State Technical University

Candidate of Physical and Mathematical Sciences, Associate Professor, Department of Applied Mathematics and Fundamental informatics

References

1. Hitchcock F. L. The distribution of product from several sources to numerous localities // Journal of Mathematical Physics. 1941. p.224–230.
2. Koopmans T.C. Uptimum utilization of the transportation system // Econometrica. 1949. p. 3–4.
3. Williams A.C. A stochastic transportation problem // Operations Research. 1963. p. 759–770.
4. Anholcer M. Algorithm for the stochastic generalized transportation problem // Operations research and decisions. 2012. p. 9–20.
5. Anholcer М. Stochastic generalized transportation problem with discrete distribution of demand //Operations
research and decisions. 2013. p. 9–19.
6. Biswal M. P., Samal . H. K. Stochastic Transportation Problem with Cauchy Random Variables and Multi Choice
Parameters //Physical Sciences. 2013. p. 117-130.
7. Юдин Д.Б. Математические методы управления в условиях неполнои̮ информации. Задачи и методы
стохастического программирования. – М.: Красанд, 2010. – 400 с.
8. Базара М. Нелинеи̮ ное программирование. Теория и алгоритмы. – М. : Мир, 1982. – 583 с.
9. Канева О.Н. Двухэтапная задача нелинеи̮ ного стохастического программирования с детерминированнои̮
матрицеи̮ коррекции //Математические структуры и моделирование. 2005. с. 25–33.
10. Sakalauskas L. Application of the Monte-Carlo Method to Nonlinear Stochastic Optimization with Linear Constraints //INFORMATICA. 2004. №. 2. p. 271–282.
Published
2016-11-25
How to Cite
ZYKINA, Anna Vladimirovna; KANEVA, Olga Nikolaevna. STOCHASTIC OPTIMIZATION MODELS IN TRANSPORTATION LOGISTICS. Modern Information Technologies and IT-Education, [S.l.], v. 12, n. 1, p. 251-255, nov. 2016. ISSN 2411-1473. Available at: <http://sitito.cs.msu.ru/index.php/SITITO/article/view/37>. Date accessed: 21 oct. 2025.
Citation Formats
Issue
Vol 12 No 1 (2016): Современные информационные технологии и ИТ-образование
Section
Applied optimization problems
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Publication policy of the journal is based on traditional ethical principles of the Russian scientific periodicals and is built in terms of ethical norms of editors and publishers work stated in Code of Conduct and Best Practice Guidelines for Journal Editors and Code of Conduct for Journal Publishers, developed by the Committee on Publication Ethics (COPE). In the course of publishing editorial board of the journal is led by international rules for copyright protection, statutory regulations of the Russian Federation as well as international standards of publishing. 
Authors publishing articles in this journal agree to the following: They retain copyright and grant the journal right of first publication of the work, which is automatically licensed under the Creative Commons Attribution License (CC BY license). Users can use, reuse and build upon the material published in this journal provided that such uses are fully attributed.