АЛГОРИТМ СОРТИРОВКИ ПАРТИЙ ГРУЗА ПО ПРИОРИТЕТАМ НА МОРСКОМ ТЕРМИНАЛЕ ПРИ ОГРАНИЧЕНИИ НА ВРЕМЯ

Abstract

The paper presents the algorithm for sorting consignments at the sea terminal. The advantages and disadvantages of the maritime transport system are considered. It has been stated that it is impossible to simultaneously handle all consignments entering the marine terminal. The procedure of sorting consignments in order of priority based on the principles of branch and bound method is specified. An iterative gradient method was used to estimate the upper bound. The effectiveness of the considered algorithm for sorting consignments in order of priority at the sea terminal under a time limit is defined by simplicity of determining the upper limit of a target function. The importance of the proposed algorithm in operation of the Russian sea terminal is justified. If a company is able to deliver its products to consumers quickly and at lower costs, then it will gain certain advantages over its competitors in the amount of market share. In the event of a malfunction in the marine transportation operations, the companies (product manufacturers) may face production or shipment problems, which will lead to business interruption. Efficient maritime transport system of a particular shipping company is an exceptional complex of operations and actions, which can’t be copied by the competitors. A simplified description of sorting consignments in order of priority at the sea terminal under the time limit is presented in the sequence of ten modules representing the algorithm. The first module includes creating a set of variables that determine the quality of decisions made by terminal personnel when sorting consignments, etc. At the last stage, all promising branches will be considered and the optimum priority of the consignment entered at the marine terminal will be obtained.