Open AccessThe task of determining the matching of actual and planned operation plans in a dispatch control system of the road transport
Author(s) -
А. И. Фадеев
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/632/1/012021
Subject(s) - computer science , matching (statistics) , task (project management) , set (abstract data type) , control (management) , subsequence , identifier , point (geometry) , dynamic programming , longest common subsequence problem , operations research , mathematical optimization , real time computing , algorithm , artificial intelligence , mathematics , engineering , computer network , mathematical analysis , statistics , geometry , systems engineering , bounded function , programming language
The article deals with the task of determining the matching between actual and planned operation plans in a dispatch control system of the road transport. The actual route of movement along the transport network is recorded as navigation data in the form of an ordered point set which had been passed through: control points identifiers and time stamps for both arrival and departure times. A new approach is proposed to determining the matching between planned and actual movement routes, which is considered as required for the dispatch control system of the road transport. Determining the matching between actual and planned movement routes is proposed to consider as the task of finding the longest common subsequence of two ordered sets: points of the planned and actual movement routes. In this way, the problem under consideration is scaled down to the classical dynamic programming problem — finding the longest common subsequence of several rows. Based on that the article presents a developed algorithm for solving the problem of finding the longest common subsequence of planned and actual movement route points.