轨道交通路网票务清算系统的研究与实践
|
摘要
随着轨道交通建设的快速发展,轨道交通路网线路之间的耦合度越来越高,不同线路之间的换乘也日益频繁。由于轨道交通建设造价高、工期长等因素,轨道交通的建设运营中通常涉及到不同的运营、收益主体。轨道交通路网票务清算系统位于轨道交通路网的最顶层,是整个轨道交通系统的核心。它承担着整个轨道交通路网自动售检票系统的管理,收益分配及与外部系统清算等众多任务。因此,对轨道交通路网票务清算系统的研究具有十分重要的意义。
本文首先通过明确轨道交通路网票务清算系统的功能,在运用“分层、多组”的思想上对其构架模式、参考模型和参考构架进行设计,阐述轨道交通路网票务清算系统的软件构架及其实现方法。
本文作者的主要研究工作如下:
(1)研究和实践了关于轨道交通路网简化建模的思想与算法,其中包括简化建模中关于重叠边的补偿和并线共站边的判别,以及回代简化建模中非关键站点的方法。
(2)对“基于最短路径及其背离路径的算法”和“基于最短路径某邻接边删除的算法”用于计算K~(th)最短路径的方法进行了研究与比较。
(3)阐述了运用异线站点间K(≤3)条最短路径生成异线站点间相应清分比例的方法。
(4)阐述把内存数据库运用于轨道交通路网票务清算系统的技术和方法,以提高实时处理效率和有效降低I/O频率。
本文描述的研究成果可以方便地被用于城市轨道交通多线路票务清分系统的技术实现,具有很好的参考和实用价值。本文作者的实践基于上海目前已投入实际运营轨道交通路网相关线路和站点的拓朴结构及其数据展开。
With fast development of rail transit, coupling degree among lines of city rail transit network would be higher and higher, and interchanging among lines is becoming frequence more and more. Due to high investment, long work period and etc. of rail transit construction, different main body of business operation and profit would be concerned in rail transit construction and business operation. An automatic fare collection (referred as AFC below) clearing central (referred as ACC below) system of rail transit network is the core of the entire rail transit system that is usually located on the top of the rail transit network. It is charged with more tasks such as management, profit allotment, clearing with outside system and etc. of the AFC system of the entire rail transit network. Hereby, research for ACC system of rail transit network has a quite important significance.
Through making definitude of the functions for ACC system of rail transit network first, its architecture pattern, reference model and reference architecture have been designed by using of the idea of layer and grouping in this thesis, and the software architecture and its implement method have been also described for ACC system of rail transit network.
The main reaserch work of the author in this thesis is as the followings:
(1) An idea and its algorithm for simplified modeling of rail transit network have been researched and practiced, in which repairing overlap edges, identifying edges with common stations and the method for replacing back of keyless nodes in the simplified modeling are also included.
(2) Research and compare on the methods to calculate the K~(th) shortest path by using of "based on the shortest path and its deviation Path" and "based on the shortest path and deleting its adjacent edge".
(3) Describe the method to generate clearing rates among different lines' stations by using K(≤3) shortest path between different lines' stations.
(4) Describe the technique and approach in which a main memory database is applied to an ACC system of rail transit network in order to enhance the process efficiency in real time and to reduce I/O frequency.
The studied results described in this thesis can be expediently applied to the technical implementation of an ACC system for multi-lines of city rail transit network and have good reference and practical values. The practice in this thesis made by author is opened out base on the topology structure of related lines and stations, and its data of the actual operation rail transit network in Shanghai at present.
本文首先通过明确轨道交通路网票务清算系统的功能,在运用“分层、多组”的思想上对其构架模式、参考模型和参考构架进行设计,阐述轨道交通路网票务清算系统的软件构架及其实现方法。
本文作者的主要研究工作如下:
(1)研究和实践了关于轨道交通路网简化建模的思想与算法,其中包括简化建模中关于重叠边的补偿和并线共站边的判别,以及回代简化建模中非关键站点的方法。
(2)对“基于最短路径及其背离路径的算法”和“基于最短路径某邻接边删除的算法”用于计算K~(th)最短路径的方法进行了研究与比较。
(3)阐述了运用异线站点间K(≤3)条最短路径生成异线站点间相应清分比例的方法。
(4)阐述把内存数据库运用于轨道交通路网票务清算系统的技术和方法,以提高实时处理效率和有效降低I/O频率。
本文描述的研究成果可以方便地被用于城市轨道交通多线路票务清分系统的技术实现,具有很好的参考和实用价值。本文作者的实践基于上海目前已投入实际运营轨道交通路网相关线路和站点的拓朴结构及其数据展开。
With fast development of rail transit, coupling degree among lines of city rail transit network would be higher and higher, and interchanging among lines is becoming frequence more and more. Due to high investment, long work period and etc. of rail transit construction, different main body of business operation and profit would be concerned in rail transit construction and business operation. An automatic fare collection (referred as AFC below) clearing central (referred as ACC below) system of rail transit network is the core of the entire rail transit system that is usually located on the top of the rail transit network. It is charged with more tasks such as management, profit allotment, clearing with outside system and etc. of the AFC system of the entire rail transit network. Hereby, research for ACC system of rail transit network has a quite important significance.
Through making definitude of the functions for ACC system of rail transit network first, its architecture pattern, reference model and reference architecture have been designed by using of the idea of layer and grouping in this thesis, and the software architecture and its implement method have been also described for ACC system of rail transit network.
The main reaserch work of the author in this thesis is as the followings:
(1) An idea and its algorithm for simplified modeling of rail transit network have been researched and practiced, in which repairing overlap edges, identifying edges with common stations and the method for replacing back of keyless nodes in the simplified modeling are also included.
(2) Research and compare on the methods to calculate the K~(th) shortest path by using of "based on the shortest path and its deviation Path" and "based on the shortest path and deleting its adjacent edge".
(3) Describe the method to generate clearing rates among different lines' stations by using K(≤3) shortest path between different lines' stations.
(4) Describe the technique and approach in which a main memory database is applied to an ACC system of rail transit network in order to enhance the process efficiency in real time and to reduce I/O frequency.
The studied results described in this thesis can be expediently applied to the technical implementation of an ACC system for multi-lines of city rail transit network and have good reference and practical values. The practice in this thesis made by author is opened out base on the topology structure of related lines and stations, and its data of the actual operation rail transit network in Shanghai at present.
引文
[1]城市轨道交通研究网,http://www.umt-cn.com
[2]我国城市轨道交通发展现状,中国公路网http://www.chinahighway.com,2009.4.9
[3]贾楠,城市轨道交通票务清分问题研究,北京交通大学硕士毕业论文,2008:P3-9
[4]王明中,城市轨道交通一票(卡)通换乘票务清分系统的研究与实现,上海交通大学博士后士学位论文,2004:P8-13
[5]赵时曼等著,轨道交通自动售检票系统,上海:同济大学出版社,2007.5:P75-107
[6]中国人民共和国国家标准--城市轨道交通自动售检票系统技术条件,北京:中国标准出版社,2007.10:P9
[7](美)林·巴斯等著,车立红译,软件构架实践,北京:清华大学出版社,2004.2:P17-41
[8]吴敏,苏厚勤,王明中,K(≤3)条渐次最短路径搜索算法的研究及其实现技术,计算机应用与软件,2004,第21卷第8期:P81-83
[9]苏厚勤,吴敏,王明中,K(≤3)条渐次最短路径搜索算法的研究及其应用,港沪科技合作研讨会论文集,2004.5:P17-19
[10]W.Hoffman,R.Pavley,A Method for the solution of the Nth Best Path Problem,J.ACM,1959,Vol.6:506-514
[11]E.W.DUkstra,A note on problem in connation with graphs,Numeric Mathematics,1959,Vol.1:P269-271
[12]王明中,谢剑英,陈应麟,一种新的Kth最短路径搜索算法,计算机工程与应用,2004,第30期:P49-50
[13]Moore.Edward,The shortest path through a maze,Paper presented at the International Symposium on the Theory of Switching at Harward Univisity,1957
[14]R.Bellman,R.Kalaba,On Kth Best Policies,J.SIAM,1960,Vol.8:P582-588
[15]David Eppstein,Finding the k shortest path,J.SIAM,1998,Vol.28:P652-673
[16]Terence Kelly,Andrew Byde,Generating k-Best Solutions to Auction Winner Determination Problems,ACM SIGecom Exchanges,2006.4,Vol.6,No.1:P23-34
[17]Lars Relund Nielsena,Kim Allan Andersen,Daniele Pretolani,Finding the K shortest hyperpaths,Computers & Operations Research,2005,Vol.32:P1477 - 1497
[18]E.Ruppert,Finding the k Shortest Paths in Parallel,Algorithmica,2000,Vol.28:P242-254
[19]S.Fiorenzo Catalano,Path enumeration by finding the constrained K-shortest paths,Transportation Research,2005,Vol.39:P545 - 563
[20]Jonhn Hershberger,Matthew Maxel,Subhash Suri,Finding the k Shortest Simple Paths:A New Algorithm and Its Implementation,ACM Transactions on Algorithms,2007.11,Vol.3,No.4:P45-60
[21]叶晋,遗传算法在轨道交通换乘路径求解中的应用,东华大学硕士毕业论文,2008:P27-P56
[22]王明中,谢剑英,陈应麟,刘永东,大宗数据实时处理优化方法的研究及应用,计算机应用与软件,2006,第23卷第5期:P46-48
[23]吴斌,潘荫荣,胡幼华,UNIX平台上数据处理中内存桶模型的设计与实现,计算机工程与设计,2005.11,第26卷第11期:P3088-3090
[24]王珊,肖艳芹,刘大为,覃雄派,内存数据库关键技术研究,2007,计算机应用,第27卷第10期:P2353-2357
[25]TimesTen documents,TimesTen Cache Connect to Oracle Guide Release 7.0,the United States of America,2007.9:P31-124
[26]Sun Microsystems Inc.,XDR:External Data Representation Standard,Network Working Group MEMO,1987
[27]陈庆芳,朱国,基于Unix系统的XDR文件解析及应用,通信与广播电视,2006,第3期:P45-51
[28]毛保华,四兵锋,城市轨道交通网络管理及收入分配理论与方法,北京:科学出版社,2007.12:P81-189
[29]陆春江,城市轨道交通网络一票通换乘的票款分配比例模型,现代城市轨 道交通,2004,第5期:P33-41
[30]范巍,杨承东,城市轨道交通自动售检票中央清分系统概论,铁路通信信号工程(RECE),2004,第2期:P37-39
[31]李宇轩,邓先平,温辛妍,轨道交通票务清分体系的建设,都市快轨交通,2007.2,第20卷第1期:22-25
[32]牛新奇,潘荫荣,轨道交通系统中清分算法的研究,计算机时代,2005,第2期:P17-20
[33]顾磊,城市轨道交通统一票务收入结算分配算法与方案,计算机工程,2006.8.第32卷第15期:P239-241
[34]严蔚敏,吴伟民,数据结构(第二版),北京:清华大学出版社,1997:P186-190
[2]我国城市轨道交通发展现状,中国公路网http://www.chinahighway.com,2009.4.9
[3]贾楠,城市轨道交通票务清分问题研究,北京交通大学硕士毕业论文,2008:P3-9
[4]王明中,城市轨道交通一票(卡)通换乘票务清分系统的研究与实现,上海交通大学博士后士学位论文,2004:P8-13
[5]赵时曼等著,轨道交通自动售检票系统,上海:同济大学出版社,2007.5:P75-107
[6]中国人民共和国国家标准--城市轨道交通自动售检票系统技术条件,北京:中国标准出版社,2007.10:P9
[7](美)林·巴斯等著,车立红译,软件构架实践,北京:清华大学出版社,2004.2:P17-41
[8]吴敏,苏厚勤,王明中,K(≤3)条渐次最短路径搜索算法的研究及其实现技术,计算机应用与软件,2004,第21卷第8期:P81-83
[9]苏厚勤,吴敏,王明中,K(≤3)条渐次最短路径搜索算法的研究及其应用,港沪科技合作研讨会论文集,2004.5:P17-19
[10]W.Hoffman,R.Pavley,A Method for the solution of the Nth Best Path Problem,J.ACM,1959,Vol.6:506-514
[11]E.W.DUkstra,A note on problem in connation with graphs,Numeric Mathematics,1959,Vol.1:P269-271
[12]王明中,谢剑英,陈应麟,一种新的Kth最短路径搜索算法,计算机工程与应用,2004,第30期:P49-50
[13]Moore.Edward,The shortest path through a maze,Paper presented at the International Symposium on the Theory of Switching at Harward Univisity,1957
[14]R.Bellman,R.Kalaba,On Kth Best Policies,J.SIAM,1960,Vol.8:P582-588
[15]David Eppstein,Finding the k shortest path,J.SIAM,1998,Vol.28:P652-673
[16]Terence Kelly,Andrew Byde,Generating k-Best Solutions to Auction Winner Determination Problems,ACM SIGecom Exchanges,2006.4,Vol.6,No.1:P23-34
[17]Lars Relund Nielsena,Kim Allan Andersen,Daniele Pretolani,Finding the K shortest hyperpaths,Computers & Operations Research,2005,Vol.32:P1477 - 1497
[18]E.Ruppert,Finding the k Shortest Paths in Parallel,Algorithmica,2000,Vol.28:P242-254
[19]S.Fiorenzo Catalano,Path enumeration by finding the constrained K-shortest paths,Transportation Research,2005,Vol.39:P545 - 563
[20]Jonhn Hershberger,Matthew Maxel,Subhash Suri,Finding the k Shortest Simple Paths:A New Algorithm and Its Implementation,ACM Transactions on Algorithms,2007.11,Vol.3,No.4:P45-60
[21]叶晋,遗传算法在轨道交通换乘路径求解中的应用,东华大学硕士毕业论文,2008:P27-P56
[22]王明中,谢剑英,陈应麟,刘永东,大宗数据实时处理优化方法的研究及应用,计算机应用与软件,2006,第23卷第5期:P46-48
[23]吴斌,潘荫荣,胡幼华,UNIX平台上数据处理中内存桶模型的设计与实现,计算机工程与设计,2005.11,第26卷第11期:P3088-3090
[24]王珊,肖艳芹,刘大为,覃雄派,内存数据库关键技术研究,2007,计算机应用,第27卷第10期:P2353-2357
[25]TimesTen documents,TimesTen Cache Connect to Oracle Guide Release 7.0,the United States of America,2007.9:P31-124
[26]Sun Microsystems Inc.,XDR:External Data Representation Standard,Network Working Group MEMO,1987
[27]陈庆芳,朱国,基于Unix系统的XDR文件解析及应用,通信与广播电视,2006,第3期:P45-51
[28]毛保华,四兵锋,城市轨道交通网络管理及收入分配理论与方法,北京:科学出版社,2007.12:P81-189
[29]陆春江,城市轨道交通网络一票通换乘的票款分配比例模型,现代城市轨 道交通,2004,第5期:P33-41
[30]范巍,杨承东,城市轨道交通自动售检票中央清分系统概论,铁路通信信号工程(RECE),2004,第2期:P37-39
[31]李宇轩,邓先平,温辛妍,轨道交通票务清分体系的建设,都市快轨交通,2007.2,第20卷第1期:22-25
[32]牛新奇,潘荫荣,轨道交通系统中清分算法的研究,计算机时代,2005,第2期:P17-20
[33]顾磊,城市轨道交通统一票务收入结算分配算法与方案,计算机工程,2006.8.第32卷第15期:P239-241
[34]严蔚敏,吴伟民,数据结构(第二版),北京:清华大学出版社,1997:P186-190