车流去向查询实现算法

提出一种基于基点基线法计算最短径路里程的车流去向查询算法:全面分析货运列车的行走规律,利用图论中基点基线的概念,将全国货运路网图按照点、线相关的编码规则划分,以适应Dijkstra算法基本思想,并在此基础上提出等代价Dijkstra算法搜索最短里程径路计算的数学模型.将查找车流径路问题转化为寻求发站、车流径路和到站之间的最短径路问题,实现车流去向查询.

Arithmetic of inguiring train flow direction

It was put forward a kind of inquiring arithmetic, that calculated the shortest route of train flow direction. By usingthe concept of basic point and baseline of chart theory, it was compartmentalized all the stations in the freight transport netaccording to the coding rule, that adapted to the basic ideology of Dijkstra arithmetic. Furthermore, it was constructed themathematic model of cost equating to the Dijkstra arithmetic, implemented the train flow direction inquiring by finding theshortest route among the leaving station, train route, and the arriving station.