On simplification of the transport problem solution with ecological criterion

 
PIIS042473880025864-9-1
DOI10.31857/S042473880025864-9
Publication type Article
Status Published
Authors
Affiliation: Saint Petersburg State Aerospace Technologies University
Address: Saint Petersburg, Russian Federation,
Affiliation: Naval Polytechnical Institute
Address: Russian Federation, St. Petersburg
Journal nameEkonomika i matematicheskie metody
EditionVolume 59 No. 2
Pages122-127
Abstract

The possibility of neglecting the penalty component in solving the transport problem (TP) with an environmental criterion is analyzed, when, along piece-rate payment, fixed additives are assigned, due only to the fact of a specific transportation, and not to the amount of transported cargo (penalties). It was found that, while the threshold ratios of the standard deviations of tariffs and fines in a TP with a single optimal plan can be grouped quite tightly, in a TP with a non-unique optimal plan, their use is not effective due to the large spread. However, the possibility of applying the “looping” method proposed by the authors, when the TP is solved many times, in which penalties are added to the tariffs, divided first by the maximum possible transportation, then by the transportation plan at the previous step, allows neglecting the “penalties” if the loop ends at the first step. The disadvantage and reason for the approximate nature of the “looping” method is the possible presence of other cycles with local minima. The possibility of the “exclusions” method presented in the paper is also considered, when for a TK with n suppliers and m customers cells are excluded in descending order of fines if the remaining parts of capacities and capacities are sufficient. The ability to distribute transportation after R = (nm – (n + m – 1)) steps allows you to ignore tariffs when choosing a plan. The disadvantage of this method, equivalent to allocative least cost method is the possible difficulties in arranging transportations after R steps of exclusion made under the assumption of a “saturated” use of cells.

Keywordstransport problem, environmental criterion, tariff, fine, optimal plan, maximum possible value
Received02.06.2023
Publication date30.06.2023
Number of characters14614
Cite  
100 rub.
When subscribing to an article or issue, the user can download PDF, evaluate the publication or contact the author. Need to register.

Number of purchasers: 2, views: 120

Readers community rating: votes 0

1. Assaul V.N., Pogodin I.E. (2019). About the transport task with environmental criteria. Economics and Mathematical Methods, 55 (2), 58–64 (in Russian).

2. Assaul V.N., Pogodin I.E. (2022). On one practical way to solve the transport problem with an “environmental” criterion. BSU bulletin. Mathematics, Informatics. 3, 3–13 (in Russian).

3. Balinski M.L. (1961). Fixed cost transportation problem. Naval Res. Log. Quart, 8, 1, 41–54.

4. Birman I.Ya. (1968). Optimal programming. Moscow: Ekonomika. 231p. (in Russian).

5. Frolkis V.A. (2002). Introduction to the theory and methods of optimization for economists. Saint Petersburg: Piter. 320 p. (in Russian).

6. Hoang T. (1964). Concave programming under linear restrictions. Proceedings of the USSR Acad-emy of Sciences, 159, 1, 32–35 (in Russian).

7. Korbut A.A., Finkelstein Yu.Yu. (1969). Discrete programming. Moscow: Nauka. 368 p. (in Rus-sian).

8. Polyak R.A. (1966). On one heterogeneous transport problem. In: Mathematical models and me-thods of optimal planning. Novosibirsk: Nauka, 109–115 (in Russian).

9. Sedova S.V., Lebedev S.S. (1999). Solution of one placement problem using nodal vectors of re-solving factors. Economics and Mathematical Methods, 35 (3), 116–121 (in Russian).

10. Sedova S.V., Lebedev S.S. (2001). Nodal vector method for integer programming. 2. Problems of a special type. CEMI preprint. WP/2000/094. 88 p. (in Russian).

11. Sigal I.Kh., Ivanova A.P. (2007). Introduction to applied and discrete programming: Models and computational algorithms. Moscow: Fizmatlit, 45–49 (in Russian).

Система Orphus

Loading...
Up