Optimizing unbalanced freight deliveries in transportation networks

Authors

DOI:

https://doi.org/10.15587/1729-4061.2022.253791

Keywords:

transport network, optimization, dummy node, difference, coefficient, simplex, decision-making

Abstract

This paper reports a comparative analysis of the known methods for reducing open transportation problems to a balanced form in order to further optimize freight traffic based on them. A series of significant shortcomings have been revealed that largely narrow the scope of their application. A new method has been proposed, termed the method of proportional redistribution of cargo transportation volumes among participants in the transportation process, devoid of the identified shortcomings.

The transportation problem is a special case of the general linear programming problem, to which one of the methods for solving it, namely the simplex one, can be applied. A procedure to construct a simplex table based on the data from the transport table has been described, as well as the algorithm of subsequent simplex transformations.

A transportation problem is often stated in the form of a map of the location of transport hubs of cargo dispatch and destination. A matrix-network model has been proposed, which makes it possible to reduce the network representation to a matrix form with the subsequent finding of the optimal plan for cargo transportation.

In order to identify the priority of methods for reducing open transportation problems to a balanced form, 100 transportation problems that are unbalanced in terms of the volume of cargo transportation were solved. That was done with the help of a designed decision support system for the management of freight transport. As a criterion, the best freight transportation plan was chosen.

As a result, the simplex method proved the best in 48 cases, the coefficient method ‒ in 27, the dummy node method ‒ in 16, and the difference method ‒ in 9 cases. The use of a decision support system for the management of freight transport has increased its efficiency by an average of 25 %

Author Biographies

Georgii Prokudin, National Transport University

Doctor of Technical Sciences, Professor

Department of International Transportation and Customs Control

Alexey Chupaylenko, National Transport University

PhD, Associate Professor

Department of International Transportation and Customs Control

Tetiana Khobotnia, National Transport University

PhD

Department of International Transportation and Customs Control

Inna Remekh, National Transport University

Assistant

Department of International Transportation and Customs Control

Andrei Lyamzin, Pryazovskyi State Technical University

Doctor of Technical Sciences, Professor

Department of Technologies of International Transportation and Logistics

Marina Kovalenko, Pryazovskyi State Technical University

Assistant

Department of Technologies of International Transportation and Logistics

References

  1. Juman, Z. A. M. S., Nawarathne, N. G. S. A. (2019). An efficient alternative approach to solve a transportation problem. Ceylon Journal of Science, 48 (1), 19. doi: https://doi.org/10.4038/cjs.v48i1.7584
  2. Jamali, A. R. M. J. U., Jannat, F., Akhtar, P. (2017). Weighted Cost Opportunity Based Algorithm for Initial Basic Feasible Solution: A New Approach in Transportation Problem. Journal of Engineering, 8 (1), 63–70. Available at: https://www2.kuet.ac.bd/JES/images/files/v42/7-JES_1001.pdf
  3. Jamali, A. J. U., Mondal, R. R. (2021). Modified Dynamically-updated Weighted Opportunity Cost Based Algorithm for Unbalanced Transportation Problem. Journal of Engineering Science, 12 (2), 119–131. doi: https://doi.org/10.3329/jes.v12i2.54637
  4. Carp, D., Popa, C., Serban, C. (2016). A general iterative solver for unbalanced inconsistent transportation problems. Archives of Transport, 37 (1), 7–13. doi: https://doi.org/10.5604/08669546.1203199
  5. Ghazali, Z., Majid, M. A. A., Shazwani, M. (2012). Optimal Solution of Transportation Problem Using Linear Programming: A Case of a Malaysian Trading Company. Journal of Applied Sciences, 12 (23), 2430–2435. doi: https://doi.org/10.3923/jas.2012.2430.2435
  6. Uddin, M. S., Miah, M., Khan, M. A.-A., AlArjani, A. (2021). Goal programming tactic for uncertain multi-objective transportation problem using fuzzy linear membership function. Alexandria Engineering Journal, 60 (2), 2525–2533. doi: https://doi.org/10.1016/j.aej.2020.12.039
  7. Ibrahim, A. A., Lonardi, A., Bacco, C. D. (2021). Optimal Transport in Multilayer Networks for Traffic Flow Optimization. Algorithms, 14 (7), 189. doi: https://doi.org/10.3390/a14070189
  8. Danchuk, V., Bakulich, O., Svatko, V. (2017). An Improvement in ant Algorithm Method for Optimizing a Transport Route with Regard to Traffic Flow. Procedia Engineering, 187, 425–434. doi: https://doi.org/10.1016/j.proeng.2017.04.396
  9. Prokudin, G., Oliskevych, M., Chupaylenko, A., Dudnik, O. (2019). Development of vehicle speed forecasting method for intelligent highway transport system. Eastern-European Journal of Enterprise Technologies, 4 (3 (100)), 6–14. doi: https://doi.org/10.15587/1729-4061.2019.174255
  10. Prokudin, G., Lebid, I., Luzhanska, N., Chupaylenko, O. (2020). Logistics Approach to the Organization of Unbalanced Freight Transportation in Transport Networks. Proceedings of 24th International Scientific Conference. Transport Means 2020. Sustainability: Research and Solutions. Part I. Kaunas, 22–26. Available at: https://transportmeans.ktu.edu/wp-content/uploads/sites/307/2018/02/Transport-means-A4-I-dalis.pdf

Downloads

Published

2022-04-28

How to Cite

Prokudin, G., Chupaylenko, A., Khobotnia, T., Remekh, I., Lyamzin, A., & Kovalenko, M. (2022). Optimizing unbalanced freight deliveries in transportation networks . Eastern-European Journal of Enterprise Technologies, 2(3 (116), 22–32. https://doi.org/10.15587/1729-4061.2022.253791

Issue

Section

Control processes