Affiliation:
1. Admiral Makarov State University of Maritime and Inland Shipping
Abstract
The operational task of automating the construction and routing of the network model with the known coordinates of the conditional goals set for a group of vessels to achieve them in the minimum time is solved; it makes it possible to obtain the reserves of running time necessary for saving fuel and energy, taking into account the load, the cost of cargo, transportation costs, logistics characteristics, etc. It is emphasized that in stormy weather conditions and vessel management in situations related to schedule correction, flexible operational decisions of dispatching services, made on the basis of numerical optimization methods using modern computing environments, are necessary. In this regard, the method of dynamic programming, implemented using the Bellman-Ford routing algorithm, which is supplemented by a recursive step-by-step optimization procedure that removes the limitation of the algorithm in the presence of inversely oriented edges with negative weights in the graph, is discussed in the paper. In the presence of negative weights, there are conditions for the appearance of a negative cycle in the graph, in which the practical implementation of the Bellman-Ford algorithm will become impossible due to an endless cycle of relaxations (attenuation) of the vertices weights included in this cycle. Hence, at a limited period of time for weighing all vertices (passes on all edges), the algorithm can give a knowingly false result. The proposed procedure for modifying the well-known Bellman-Ford algorithm eliminates this limitation and allows it to be used not only for estimating the shortest paths in a network containing arcs with negative weights, but also to detect negative cycles in it. The modified Bellman-Ford algorithm is implemented as a program compiled in MATLAB codes, and it is demonstrated by the example of automated construction and calculation of a network model containing both positive and negative edges (flows), using a recursive procedure of step-by-step optimization. It is shown that the proposed model, unlike the known models, eliminates the limitations caused by the presence of negative cycles in the network model, which makes it possible to automate the search for the shortest paths to conditional goals by the functional means of the MATLAB environment. The constructed computer model is simple and compact. The proposed algorithm and the recursive procedure are recommended for finding energy-efficient solutions for managing mobile objects in water transport.
Publisher
Admiral Makarov State University of Maritime and Inland Shipping
Subject
Colloid and Surface Chemistry,Physical and Theoretical Chemistry
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献