The treatment of optimizing container transportation dynamic programming and planning

N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

The article addresses the treatment of applying the method of dynamic linear programming to solve the task of choosing the optimal strategy for the containers dispatch, taking into account the significant unevenness of loading and shipment of containers. The optimizing container transportation dynamic planning could be treated as mathematical model of the dynamic multi-period task of the loaded containers shipment, which allows the choice of the optimal strategy for sending containers, taking into account the significant unevenness of their loading and dispatch from the railway freight station. The efficiency of considered method is proved by numerical calculation being presented to disclose the dynamic linear programming algorithm implementing to solve the problem.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Korchagina, E., Bochkarev, A., Bochkarev, P., Barykin, S., & Suvorova, S. (2019). The treatment of optimizing container transportation dynamic programming and planning. In E3S Web of Conferences (Vol. 135). EDP Sciences. https://doi.org/10.1051/e3sconf/201913502016

Readers' Seniority

Tooltip

Professor / Associate Prof. 6

55%

PhD / Post grad / Masters / Doc 3

27%

Lecturer / Post doc 1

9%

Researcher 1

9%

Readers' Discipline

Tooltip

Business, Management and Accounting 5

42%

Engineering 3

25%

Economics, Econometrics and Finance 3

25%

Decision Sciences 1

8%

Save time finding and organizing research with Mendeley

Sign up for free