PLANNING METHODS FOR MODERN CONTAINER TRANSPORTATION
https://doi.org/10.33815/2313-4763.2019.2.21.124-131
Abstract
It is proved in the work that the use of sea container transportations is effective today. It is argued that container transportation is a cost-effective and reliable way of transporting goods in large quantities by using multimodal transportation, which reduces shipping time and reduces financial costs. This is possible due to the correct planning of organizational, methodological and technological processes of cargo transportation. The advantages of the efficiency of using this type of transportation are analyzed and the main disadvantages that need to be eliminated are presented. The growth of the container flow at the current moment of time is noted, which requires a number of measures to increase the capacity and capacity. Basic models and algorithms for container and ship container placement are considered. Various approaches are analyzed (iterative local search, directional local search, variable neighborhood search, probabilistic greedy algorithm, evolutionary algorithm, genetic algorithm, ant colony optimization algorithm, annealing simulation, search with bans) and found that data are widely used and applied. The use of heuristic methods of forming a cargo plan for a container ship can significantly reduce the time spent. The approaches considered are most effective for multi-port transportation, and in this case the number of possible cargo placement options is increasing. At the same time, the importance of the construction of modern terminals, ports, unloading and loading equipment for increasing the efficiency of sea container transportation is argued. The paper also argues that the process of drawing up a cargo plan for a container vessel is important and the creation of new methods will allow optimizing the process and increasing the efficiency of container transportations as a whole.
References
Nikolaeva L.L., Tsimbal N.N. Morskie perevozki: Uchebnik. Odesskaya nacionaljnaya morskaya akademiya. Odessa : Feniks, 2005.
Snopkov V.I. (2006). Tekhnologiya perevozki gruzov morem: Uchebnik dlya vuzov. SPb: NPO «Professional».
Zhan Вian, Qianqian Shao, Zhihong Jin. (2015). Optimization on the container loading sequence based on hybrid dynamic programming.
Wenbin Hu, Zhengbing Hu, Lei Shi, Peng Luo and Wei Song. (2012). Combinatorial optimization and strategy for ship stowage and loading schedule of container terminal.
Ustinov R. G., Dneprovskiyj V. V. (2005). Analiz kriteriev sostavleniya gruzovogo plana morskogo sudna– konteyjnerovoza. Vestnik Priazovskogo Derzhavnogo Tekhnichnogo Universiteta, 15.
Nіkoljskiyj V. V., Nіkoljskiyj M. V., Naku Yu. A. (2016). Sistema pіdtrimki priyjnyattya rіshennya po zavantazhennyu velikotonnazhnogo konteyjnerovoza.
Ambrosino, D., Anghinolfi, D., Paolucci, M. and Sciomachen, A. (2010). An experimental comparison of different heuristics for the master bay plan problem. Lecture Notes in Computer Science.Vol. 6049, 314–325.
Avriel, M., Penn, M. and Shpirer, N. (2000). Containership stowage problem: complexity and connection to the coloring of circle graphs. Discrete Applied Mathematics.Vol. 103, 1–3, 271–279.
Blum, C. and Roli, A. (2003). Metaheuristics in combinatorial optimization overview and conceptual comparison. ACM Computing Surveys, Vol. 35, 3, 268–308.
Dubrovsky, O., Levitin, G. and Penn, M. (2002). A genetic algorithm with a compact solution encoding for the containership stowage problem. Journal of Heuristics, Vol. 8, No. 6, 585–599.
Fan, L., Low, M.Y.H., Ying, H.S., Jing, H.W., Min, Z. and Aye, W.C. (2010). Stowage planning of large containership with tradeoff between crane workload balance and ship stability. Proceedings of the International MultiConference of Engineers and Computers Scientists. Vol. III, 1–7.
Imai, A., Sasaki, K., Nishimura, E. and Papadimitriou, S. (2006). Multi-objetive simultaneous stowage and loading planning for a container ship with container rehandle in yard stacks. European Journal of Operational Research. Vol. 171, No. 3, 373–389.
Michalewicz, Z. (1996) Genetic Algorithms + Data Structures = Evolution Programs, 3rd ed., Springer-Verlag, London, UK.
Ribeiro, C. M., Azevedo, A. T. and Teixeira, R. F. (2010). Problem of assignment cells to switches in a cellular mobile network via beam search method, WSEAS Transactions on Communications, Vol. 9, No. 1, 11–21.
Sciomachen, A. and Tanfani, E. (2007). A 3D-BPP approach for optimizing stowage plans and terminal productivity. European Journal of Operational Research. Vol. 183, No. 3, 1433–1446.
Vacca, I., Bierlaire, M. and Salani, M. (2007). Optimization at container terminals: status, trends and perspectives. 7th Swiss Transportation Research Conference, September, Рp.
1–21.
Valente, J.M.S. and Alves, R.A.F.S. (2005). Filtered and recovering beam search algorithm for the early/tardy scheduling problem with no idle time. Computers & Industrial Engineering, Vol. 48, No. 2, 363–375.
Wilson, I. and Roach, P.A. (1999). Principles of combinatorial optimization applied to container-ship stowage planning. Journal of Heuristics, Vol. 5, No. 4, 403–418.
Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research. Vol. 44, No. 2, 145–159