发明名称 METHOD FOR ORININ BASED TRAFFIC ASSIGN MODEL USING SHORTEST PATH
摘要 The present invention can reduce the time required in searching remarkably by including (a) a step in which a control part of a passage assigning server based on a starting point using a shortest path reads origin and destination connecting a starting point and an arrival point from a basic network about all paths stored in a basic network DB of a data base part; (b) a step in which a Bush network generation part generates a Bush network by extracting only a path to an arrival point with traffic demand by referring to the starting point from the basic network; (c) a step in which a Bush-Branch transition part is transited to a Branch network constituted with only nodes classified and joined from a Bush network constituted with link list; (d) a step in which a maximum and minimum path searching part searches a min-path with short passage time and a max-path with long passage time in the Branch network; (e) a step in which a traffic volume transition part assigns traffic volume through transition in order for the passage time of the min-path to be equal to the passage time of the max-path; (f) a step in which a control part (120) judges whether a balanced point where the passage time of the min-path is equal to the passage time of the max-path through the traffic volume transition is achieved in the (e) step; and (g) a step in which the control part repeats the (d) step of searching the min-path and the max-path in order to maintain the balanced point and the (e) step of transiting the traffic volume, when the balanced point where the passage time of the min-path is equal to the passage time of the max-path arrives in the (f) step. [Reference numerals] (AA) Start; (BB) End; (S10) Step of reading origin and destination from basic network; (S20) Step of generating a Bush network; (S30) Step of transiting from the Bush network to a Branch network; (S40) Step of searching a min-path and a max-path; (S50) Traffic volume transition step; (S60) Is a balanced point achieved?; (S70) Step of deleting zero Branch and updating Bush; (S80) Is a network balanced point achieved?
申请公布号 KR101347603(B1) 申请公布日期 2014.01.07
申请号 KR20120068894 申请日期 2012.06.27
申请人 MYONGJI UNIVERSITY INDUSTRY AND ACADEMIA COOPERATION FOUNDATION 发明人 CHO, JOONG RAE
分类号 G08G1/01;G06Q50/30;G08G1/065 主分类号 G08G1/01
代理机构 代理人
主权项
地址