CN101799839B - The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model - Google Patents

The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model Download PDF

Info

Publication number
CN101799839B
CN101799839B CN2010100398114A CN201010039811A CN101799839B CN 101799839 B CN101799839 B CN 101799839B CN 2010100398114 A CN2010100398114 A CN 2010100398114A CN 201010039811 A CN201010039811 A CN 201010039811A CN 101799839 B CN101799839 B CN 101799839B
Authority
CN
China
Prior art keywords
network
factions
faction
layer
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN2010100398114A
Other languages
Chinese (zh)
Other versions
CN101799839A (en
Inventor
杨旭华
孙豹
蒋峰岭
陈�光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shandong Shengshi Gongqing Tea Co ltd
Shenzhen Chengze Information Technology Co ltd
Original Assignee
Zhejiang University of Technology ZJUT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN2010100398114A priority Critical patent/CN101799839B/en
Publication of CN101799839A publication Critical patent/CN101799839A/en
Application granted granted Critical
Publication of CN101799839B publication Critical patent/CN101799839B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Devices For Executing Special Programs (AREA)
  • Image Generation (AREA)

Abstract

A public transportation network model establishing method of controllable network diameter based on random overlapping faction, which expresses a public transportation network as a relation between a station and a line (namely a faction, a maximum complete subgraph in the network), and adopts an adjacency matrix to express a network relation graph during numerical representation, comprises the following steps: setting the network diameter to be N; the network will logically appear as an (N +1) layer structure, where the derivative of the (m-1) th layer maps to a point of the m layer (1. ltoreq. m.ltoreq.n + 1); the original network is composed of mutually overlapped ramifications, one is added to the original network each time, and meanwhile, each layer of network is guaranteed to be composed of the ramifications, wherein the layer (N-1) is a ramification, and the layer N of the network is a point; thereby generating an ideal N-depth park network; the invention reduces the maximum transfer times and the average transfer times of the public transport network under the condition of almost zero cost, and can improve the service performance of the public transport system.

Description

Method for building up and public traffic network model based on the public traffic network model of the controllable network diameter of random overlapping factions
Technical field
The invention belongs to the network science and technology field, be specifically related to modeling method and public traffic network model based on the public traffic network model of the controllable network diameter of random overlapping factions.
Background technology
Urban public transport is the important foundation facility of living closely bound up with people, its basic task be for the passenger provide safety, convenient, rapidly, on schedule, comfortable condition by bus.Yet along with modernization process and development of urbanization, it is very crowded that urban transportation becomes, and urban public transport can not provide rapidly, the condition of riding on schedule, easily.The statistics that the Ministry of Construction provides shows; China's bus trip share rate only accounts for 10% to 25% of the total travel amount of city dweller; Compare with the trip proportion of developed country 40% to 60%; Differ also very big, the public transit system in city is not brought into play due advantage, is unfavorable for the progress of Chinese economic development and urban civilization.Therefore, China advocates energetically and first develops urban public transport, is to improve the traffic resource utilization ratio, alleviates the necessary means of traffic congestion, is the basic road of urban development.
At present, the application of complex network theory begins to cause people's research interest to the research of the research of city bus network characteristic and the network planning, has many scholars to utilize Complex Networks Theory that the city bus network is studied, and has obtained a large amount of achievements in research.Latora and Marchiopi (Latora V, Marchiori M.Is the Bostonsubway a small-world network [J] .Physica A, 2002,314 (1-4): 109-113) studied Bostonian subway network characteristic; Sienkiewicz (Sienkiewicz J; Holyst J A.Statistical analysis of 22public transport networks in Poland [J] .Phys.Rev.E; 2005; 72 (4): 046127) studied the public transit system in 22 cities of Poland, adopted two kinds of network models it is analyzed.(WuJ J such as Wu Jianjun, Gao Ziyou; Gao Z Y; Sun H J.Urban transit system as scale-free network [J] .Modern PhysicsLetters B; 2004,18 (19-20): 1043-1049.) analyzed " no scale " characteristic and " worldlet " characteristic of the public traffic network of Beijing, and studied the efficiency of public traffic network.(Yang XH such as Yang Xuhua, Wang Bo; Wang B; Wang W L; Et al.Research on some bus transport networks with randomoverlapping clique structure [J] .Communications in theoretical physics; 2008,50 (5): 1249-1254.) through research, propose that space P describes that public traffic network down is that height factions are overlapping, height factions cluster, have the worldlet network of exponential type degree distribution to the statistical property of actual bus-route network (Beijing, Shanghai and Hangzhou).
The design of public traffic network and optimization aspect; Many researchers is optimized public bus network from the local performance of network, proposes to increase the local performance that methods such as circuit and website are improved public traffic network, improves the network component efficiency; To shorten passenger's travel time, improve service quality.
Summary of the invention
For the deficiency that optimization efficiency is lower, network performance is relatively poor that overcomes existing public traffic network; The present invention provides a kind of operational efficiency height, network performance optimized good and needn't increase the method for building up and the public traffic network model based on the public traffic network model of the controllable network diameter of random overlapping factions of cost, and this model can reduce passenger's in the network maximum and average number of transfer.
The technical scheme that the present invention is proposed for the above-mentioned technology of solution:
A kind of based on the controlled public traffic network method for establishing model of the network diameter of random overlapping factions; Public traffic network is expressed as the relation of website and circuit; When numerical value is explained, adopt adjacency matrix to represent cyberrelationship figure, said public traffic network method for establishing model may further comprise the steps:
Step 1: the setting network diameter is N, and N is a natural number; Network will be from showing as (N+1) layer structure in logic, and wherein the factions of (m-1) layer are mapped as a bit of m layer, and 1≤m≤N+1, m are natural number;
Step 2: each layer network of initialization: it is a c of factions that initial primitive network begins 0, c 0Constitute by m node, a public bus network with m website is promptly initially arranged; The 1st～N layer network is 1 node;
Step 3: newly-increased factions in primitive network, the c of factions that promptly to increase a size be m i, c iMiddle m 1Individual node is a picked at random from the existing node of primitive network, m 2Individual for increasing node newly, wherein, i=1,2,
Step 4: if the k layer has new factions to occur; Wherein, 0≤k≤N-2 will increase the node that factions are mapped to (k+1) layer newly; If this node and certain existing (k+1) layer factions constitute new maximum factions; Find out this factions, make them form new factions, at this moment factions' number of (k+1) layer is constant; Otherwise from the existing factions of (k+1) layer, find out a maximum complete subgraph that comprises this point, promptly comprise the maximum factions of this point, make they and this node constitute new factions of (k+1) layer, at this moment factions' number of (k+1) layer adds 1;
Step 5: network is carried out (N-1) inferior mapping,, promptly obtain desirable N degree of depth factions network if the N-1 layer of network is made up of factions;
Step 6: if the N-1 layer of network can not constitute factions, in primitive network, select corresponding factions that it is interconnected, guarantee that (N-1) layer network can become factions all the time according to interdenominational maximum similarity.
Step 7: repeating step 3～step 6, when all factions all join in the network, this network is a desirable N degree of depth factions network, then finishes.
Further, in said step 2 and the step 3, m～N (μ, σ 2), m 1～N (μ 1, σ 1 2), m 2～N (μ 1, σ 2 2), and μ=μ 1+ μ 2,
Figure G2010100398114D00033
M=m 1+ m 2, wherein, m, m 1And m 2Be the random number of accord with normal distribution, the average of m and variance are respectively μ and σ 2, m 1Average and variance be respectively μ 1And σ 1 2, m 2Average and variance be respectively μ 2And σ 2 2
Further again, in the said step 4, the method for finding out new node place factions is, adopts bipartite graph to describe network, if all nodes of factions all link to each other with this new node, then these factions and new node constitute new factions.
Further, in the said step 6, interdenominational similarity is meant two interdenominational common node numbers, and the many more similarities of number are big more.
Further, in the said step 7, desirable N degree of depth factions network is from show as (N+1) layer structure in logic.Primitive network is made up of many overlapping factions, and the definition primitive network is 0 degree of depth factions network; Factions in the primitive network are mapped to node; If between the factions in the primitive network overlapping node is arranged; Think that then its corresponding mapping node has the limit of company, form a new network like this, be referred to as 1 degree of depth factions network; According to design of the present invention, 1 degree of depth factions network also will be made up of different factions connected to one another; Repeat above process, promptly (0≤m≤N-1) layer network generates (m+1) layer network, and (N-1) layer network will be factions, and the N layer of network is a point by m.We obtain a network of total (N+1) layer in logic like this.
The described public traffic network model of setting up based on the controlled public traffic network method for establishing model of the network diameter of random overlapping factions of a kind of usefulness, said public traffic network model is:
(1) original state: existing c of factions at random that length is m 0
(2) random overlapping factions increase: increase a c of factions that size is m i, c iMiddle m 1Individual node is a picked at random in the existing node from primitive network, m 2Individual for increasing node newly;
(3) desirable N degree of depth factions network mapping: carry out subideal N degree of depth factions network struction,,, regulate the newly-increased c of factions according to interdenominational similarity if can not become desirable N degree of depth factions network iConnection, make primitive network can become desirable N degree of depth factions network.
Further, m～N (μ, σ 2), m 1～N (μ 1, σ 1 2), m 2～N (μ 2, σ 2 2) and μ=μ 1+ μ 2, m=m 1+ m 2, wherein, m, m 1And m 2Be the random number of accord with normal distribution, the average of m and variance are respectively μ and σ 2, m 1Average and variance be respectively μ 1And σ 1 2, m 2Average and variance be respectively μ 2And σ 2 2
Further again, interdenominational similarity is meant the number of two overlapping nodes between the factions.
Technical conceive of the present invention is: based on the Complex Networks Theory of factions, consider from topology of networks and overall network performance, propose to improve the model or the method for public traffic network, promote the integrity service performance of public traffic network.According to the statistics to bus passenger trip psychological research, secondly the primary factor of considering when the minimum passenger of being of number of transfer goes on a journey is operating range, time, expense etc.Number of transfer is regarded as the important indicator of public traffic network performance.Thus, designing a kind of public transit system that better network performance is arranged, have lower maximum and average number of transfer, is the necessary means and the method for present city bus development and optimization.
Based on the Complex Networks Theory of random overlapping factions, the public traffic network model of controllable network diameter has been proposed, to reduce network diameter and average shortest path length; Thereby maximum number of transfer in the reduction public traffic network and average number of transfer; Promote the integrity service performance of public traffic network, make public transit system can share more trip rate, reach and improve the city road network operational efficiency; Alleviate the urban traffic pressure, and play the effect of energy-saving and emission-reduction.
The public traffic network model of the controllable network diameter based on random overlapping factions of the present invention; Be that desirable N degree of depth factions' network establishing method and a kind of public traffic network evolutionary model based on the weighting Complex Networks Theory are combined, the public traffic network evolutionary model that increases based on random overlapping factions of a kind of network diameter of foundation controlled (network diameter can be assumed to be N in advance).
According to the method for Space P, in the public traffic network model, the bus station is mapped to the point in the public traffic network, if having a public bus network process at least between certain two website, think that then these two points have the limit of company.Factions in the network are defined as in the network maximum subgraph that is coupled fully, and promptly all nodes in the factions are to link to each other in twos.Adopt the describing method of Space P; As far as any public bus network, the limit of company is all arranged between wherein any two bus stations, and in whole public traffic network; There is not a point outside this public bus network; The limit of company can all be arranged with all websites of this public bus network, and this is explanation just: every public bus network is a maximum complete subgraph in the public traffic network, and promptly arbitrary public bus network can be regarded factions as.
The distance definition of two nodes is the limit number on the shortest path that connects these two nodes in the network; Network diameter is defined as in the network maximal value of distance between any two nodes, and average shortest path length is defined as the mean value of the distance between any two nodes in the network.For public traffic network, maximum number of transfer is that network diameter subtracts 1, and average number of transfer is that average shortest path length subtracts 1.The network diameter of the public traffic network of China big and medium-sized cities is bigger than normal, and number of transfer is more, and for example, the network diameter in Beijing, Shanghai and Hangzhou is respectively 6,6 and 5.The present invention is the public traffic network model that designs with regard to being based on the purpose that reduces network diameter and number of transfer, and the present invention has realized that network diameter is 3 public traffic network model.
The construction method of desirable N degree of depth factions network, at first given N value, according to this construction method, desirable N degree of depth factions network will be from showing as (N+1) layer structure in logic.Primitive network is made up of many overlapping factions, and the definition primitive network is 0 degree of depth factions network; Factions in the primitive network are mapped to node; If between the factions in the primitive network overlapping node is arranged; Think that then its corresponding mapping node has the limit of company, form a new network like this, be referred to as 1 degree of depth factions network; According to design of the present invention, 1 degree of depth factions network also will be made up of different factions connected to one another; Repeat above process, promptly (0≤m≤N-1) layer network generates (m+1) layer network, and (N-1) layer network will be factions, and the N layer of network is a point by m.We obtain a network of total (N+1) layer in logic like this.
Concerning every layer, if having a few all in certain factions, and this layer interconnects by several factions and forms, and then is referred to as desirable N degree of depth factions network.The characteristics of desirable N degree of depth factions network do, and each degree of depth network all is that factions constitute, and for the network of certain one deck [be assumed to be k (degree of depth of 1≤k≤N)]; Group node in all corresponding primitive network of any node of network; Our called after k degree of depth corporations of this group node, according to the model that we invented, its network diameter of k degree of depth corporations is k; Therefore, the primitive network diameter in the desirable N degree of depth factions network is N.Be that we can be according to pre-set network diameter, tectonic network.As shown in Figure 1, be the building process of an ideal 3 degree of depth factions networks.
Beneficial effect of the present invention is:
(1) according to the public traffic network of this modelling, not only the public traffic network with reality has very approximate network characteristic, but also the characteristic that performance makes new advances.Under the situation that satisfies the public transport coverage rate, this model has been realized network diameter controlled (littler) and littler average shortest path length, realizes in public traffic network that promptly littler the and average number of transfer of maximum number of transfer is littler.This model generates has more excellent network performance and the public traffic network of service quality, can make public transport can bear more trip share rate, finally reaches and improves the city road network operational efficiency, plays the effect of alleviation urban traffic pressure.
(2) this model can directly apply to actual public traffic network, and it is optimized.Only need a spot of public bus network of adjustment and website; Rather than increase circuit and website; The maximum number of transfer that under the situation of zero cost almost, just reduces public traffic network with reduce average number of transfer, reach the effect of improving whole transportation network performance, improve the service quality of public transit system.
Description of drawings
Fig. 1 is the building process synoptic diagram of desirable 3 degree of depth factions networks.
Fig. 2 is the processing synoptic diagram of singular point in the desirable N degree of depth factions network mapping process.
Embodiment
Below in conjunction with accompanying drawing the present invention is done and to further describe.
Embodiment 1
See figures.1.and.2; A kind of method for building up of public traffic network model of the controllable network diameter based on random overlapping factions; Adopt bipartite graph to represent public traffic network, be about to the relation that public traffic network is expressed as website and circuit, when numerical value is explained, adopt adjacency matrix to represent cyberrelationship figure.Concrete modeling procedure is following:
Step 1: the setting network diameter is N, and N is a natural number; (can be assumed to be 3 to public traffic network): network will be from showing as (N+1) layer structure in logic, and wherein the factions of (m-1) layer are mapped as a bit of m layer, and 1≤m≤N+1, m are natural number;
Step 2: each layer network of initialization.It is a c of factions that primitive network begins 0, c 0Be to constitute, a public bus network with m website is promptly initially arranged by m node.The the 1st～(N-1) degree of depth network is 1 node.
Step 3: newly-increased factions (public bus network) in primitive network, the c of factions that promptly to increase a size be m i, c iMiddle m 1Individual node is a picked at random from the existing node of primitive network, m 2Individual for increasing node newly.(i＝1，2，…)
Step 4: if (0≤k≤N-2) layer has new factions to occur to k; To increase the node that factions are mapped to (k+1) layer newly; If this node can constitute new maximum factions with certain existing (k+1) layer factions; Find out this factions, make them form new factions, at this moment factions' number of (k+1) layer is constant; If there are not such factions; Then from the existing factions of (k+1) layer, find out a maximum complete subgraph that comprises this point; The maximum factions that promptly comprise this point make they and this node constitute new factions of (k+1) layer, and at this moment factions' number of (k+1) layer adds 1.
Step 5:, network is carried out (N-1) inferior mapping according to step 4.If (N-1) of network layer constitutes factions, promptly can be mapped to desirable N degree of depth factions network, get into step 5, if can not, get into step 6.
Step 6: if (N-1) of network layer can not become factions; Black real point in as shown in Figure 2; Then in primitive network, select corresponding factions that it is interconnected, guarantee that (N-1) layer network can become factions all the time according to interdenominational maximum similarity.
Step 7: return step 3, if all factions all join in the network, and this network is a desirable N degree of depth factions network, then finishes.
In the above-mentioned steps 2 and 3, m～N (μ, σ 2), m 1～N (μ 1, σ 1 2), m 2～N (μ 2, σ 2 2) and μ=μ 1+ μ 2, m=m 1+ m 2, wherein, m, m 1And m 2Be the random number of accord with normal distribution, the average of m and variance are respectively μ and σ 2, m 1Average and variance be respectively μ 1And σ 1 2, m 2Average and variance be respectively μ 2And σ 2 2
In the above-mentioned steps 4, the method for finding out new node place factions is, adopting bipartite graph to describe under the situation of network, if all nodes of factions all link to each other with this new node, then these factions can constitute new factions with new node.
In the above-mentioned steps 6, interdenominational similarity is meant two interdenominational common node numbers, and the many more similarities of number are big more.When actual public traffic network was operated, the distance between the considered website can use longitude and latitude to calculate.
In the said step 7, desirable N degree of depth factions network is from show as (N+1) layer structure in logic, and primitive network is made up of many overlapping factions, and the definition primitive network is 0 degree of depth factions network; Factions in the primitive network are mapped to node; If between the factions in the primitive network overlapping node is arranged, think that then its corresponding mapping node has the limit of company, forms a new network; Be referred to as 1 degree of depth factions network, 1 degree of depth factions network also will be made up of different factions connected to one another; Repeat above process, promptly generate (m+1) layer network by the m layer network, 0≤m≤N-1, (N-1) layer network will be factions, and the N layer of network is a point, obtains a network of total (N+1) layer in logic.
Embodiment 2
See figures.1.and.2, the public traffic network model is:
(1) original state: existing c of factions that length is m 0
(2) random overlapping factions increase: increase a c of factions that length is m i, c iMiddle m 1Individual node is a picked at random from existing node, m 2Individual for increasing node newly;
(3) desirable N degree of depth factions network mapping: carry out subideal N degree of depth factions network struction,,, regulate the newly-increased c of factions according to interdenominational similarity if can not become desirable N degree of depth factions network iConnection, make primitive network can become desirable N degree of depth factions network.
M～N (μ, σ 2), m 1～N (μ 1, σ 1 2), m 2～N (μ 2, σ 2 2) and μ=μ 1+ μ 2, wherein, m, m 1And m 2Be the random number of accord with normal distribution, the average of m and variance are respectively μ and σ 2, m 1Average and variance be respectively μ 1And σ 1 2, m 2Average and variance be respectively μ 2And σ 2 2Interdenominational similarity is meant the number of two overlapping nodes between the factions.When in to actual public traffic network, operating, also will consider the distance between the website, available longitude and latitude calculates.

Claims (4)

1.一种基于随机重叠派系的网络直径可控的公交网络模型建立方法，其特征在于：将公交网络表示成站点和线路的关系，在数值表述时采用邻接矩阵表示网络关系图，所述公交网络模型建立方法包括以下步骤：1. A method for establishing a public transport network model based on the controllable network diameter of random overlapping factions, characterized in that: the public transport network is represented as the relationship between stations and lines, and an adjacency matrix is used to represent the network relationship graph when numerically expressed. The network model building method includes the following steps: 步骤1：设定网络直径为N，N为自然数；网络将从逻辑上表现为(N+1)层结构，其中第(h-1)层的派系映射为第h层的一点，1≤h≤N+1，h为自然数；Step 1: Set the diameter of the network to be N, where N is a natural number; the network will be logically expressed as a (N+1) layer structure, where the faction at the (h-1)th layer is mapped to a point at the hth layer, 1≤h ≤N+1, h is a natural number; 步骤2：初始化每一层网络：初始的原始网络为一个派系c0，所述原始网络为第0层网络，c0由m个节点构成，即初始有一个具有m个站点的公交线路；第1～N层网络为1个节点；Step 2: Initialize each layer of network: the initial original network is a faction c 0 , the original network is the 0th layer network, c 0 is composed of m nodes, that is, initially there is a bus line with m stations; 1-N layer network is 1 node; 步骤3：向原始网络中新增一个派系，即增加一个大小为m的派系ci，ci中m1个节点是从原始网络已有的节点中随机选取，m2个为新增节点，其中，i＝1，2，...；Step 3: Add a faction to the original network, that is, add a faction c i with size m, m1 nodes in c i are randomly selected from existing nodes in the original network, and m2 are newly added nodes, where , i=1,2,...; 步骤4：若第k层有新派系出现，其中，0≤k≤N-2，将新增派系映射成第(k+1)层的一个节点，若该节点与某个已有的第(k+1)层派系构成新的最大派系，找出该派系，使它们组成新派系，这时第(k+1)层的派系数不变；否则从第(k+1)层的已有派系中找出一个包含该节点的最大完全子图，即包含该节点的最大派系，使它们与该节点构成第(k+1)层的一个新派系，这时第(k+1)层的派系数加1；Step 4: If there is a new faction in the kth layer, where 0≤k≤N-2, map the new faction to a node in the (k+1)th layer, if the node is related to an existing ( K+1) layer factions constitute a new largest faction, find out the faction, make them form a new faction, at this time the faction coefficient of the (k+1) layer remains unchanged; otherwise, from the existing (k+1) layer Find a maximum complete subgraph containing the node in the faction, that is, the largest faction containing the node, so that they and the node form a new faction of the (k+1)th layer, then the (k+1)th layer faction factor plus 1; 步骤5：对网络进行(N-1)次映射，若网络的第N-1层构成一个派系，即得到理想N深度派系网络；Step 5: Map the network (N-1) times, if the N-1th layer of the network forms a faction, the ideal N-depth faction network is obtained; 步骤6：若网络的第(N-1)层不能构成一个派系，在原始网络中，根据派系间的最大相似度选择相应的派系使其相互连接，保证第(N-1)层网络始终能成为一个派系；Step 6: If the (N-1) layer of the network cannot form a faction, in the original network, select the corresponding faction according to the maximum similarity between the factions to connect with each other to ensure that the (N-1) layer network can always be become a faction; 步骤7：重复步骤3～步骤6，当所有的派系都加入到网络中，该网络为一个理想N深度派系网络，则结束；Step 7: Repeat steps 3 to 6. When all factions are added to the network and the network is an ideal N-depth faction network, it ends; 所述步骤2和步骤3中，m～N(μ，σ2)，
Figure FSB00000663204300021
且μ＝μ1+μ2，
Figure FSB00000663204300022
m＝m1+m2，其中，m、m1和m2均为符合正态分布的随机数，m的均值和方差分别为μ和σ2，m1的均值和方差分别为μ1和σ1 2，m2的均值和方差分别为μ2和σ2 2。In the step 2 and step 3, m~N(μ, σ 2 ),
Figure FSB00000663204300021
And μ=μ 1 +μ 2 ,
Figure FSB00000663204300022
m=m 1 +m 2 , where, m, m 1 and m 2 are random numbers conforming to normal distribution, the mean and variance of m are μ and σ 2 respectively, and the mean and variance of m 1 are μ 1 and σ 1 2 , the mean and variance of m 2 are μ 2 and σ 2 2 respectively. 2.如权利要求1所述的基于随机重叠派系的网络直径可控的公交网络模型建立方法，其特征在于：所述步骤4中，找出新节点所在派系的方法是，采用二分图描述网络，若一个派系的所有节点与这个新节点都相连，则该派系与新节点构成新派系。2. The method for establishing a public transport network model with controllable network diameter based on random overlapping factions as claimed in claim 1, characterized in that: in said step 4, the method for finding out the faction where the new node is located is to use a bipartite graph to describe the network , if all the nodes of a faction are connected to this new node, then the faction and the new node form a new faction. 3.如权利要求1所述的基于随机重叠派系的网络直径可控的公交网络模型建立方法，其特征在于：所述步骤6中，派系间的相似度是指两个派系间的公共节点数目，数目越多相似度越大。3. the method for establishing a public transport network model based on the controllable network diameter of random overlapping factions as claimed in claim 1, characterized in that: in the step 6, the similarity between factions refers to the number of common nodes between two factions , the greater the number, the greater the similarity. 4.如权利要求1所述的基于随机重叠派系的网络直径可控的公交网络模型建立方法，其特征在于：所述步骤7中，理想N深度派系网络从逻辑上表现为(N+1)层结构，原始网络由许多重叠的派系构成，定义原始网络为0深度派系网络；将原始网络中的派系映射成节点，若原始网络中的派系之间有重叠的节点，则认为其相应的映射节点有连边，组成一个新的网络，称之为1深度派系网络，1深度派系网络也将由不同的彼此连接的派系组成；重复以上过程，即由m层网络生成(m+1)层网络，0≤m≤N-1，第(N-1)层网络将是一个派系，而网络的第N层是一个点，得到一个逻辑上共有(N+1)层的网络。4. the method for establishing a public transport network model based on the controllable network diameter of random overlapping factions as claimed in claim 1, characterized in that: in the step 7, the ideal N-depth faction network is logically expressed as (N+1) Layer structure, the original network is composed of many overlapping factions, and the original network is defined as a 0-depth faction network; the factions in the original network are mapped into nodes, and if there are overlapping nodes between the factions in the original network, the corresponding mapping is considered Nodes have edges to form a new network, which is called a 1-depth faction network, and a 1-depth faction network will also be composed of different connected factions; repeat the above process, that is, a (m+1) layer network is generated from an m-layer network , 0≤m≤N-1, the (N-1)th layer of the network will be a faction, and the Nth layer of the network is a point, resulting in a network that logically shares (N+1) layers.
CN2010100398114A 2010-01-19 2010-01-19 The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model Expired - Fee Related CN101799839B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010100398114A CN101799839B (en) 2010-01-19 2010-01-19 The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010100398114A CN101799839B (en) 2010-01-19 2010-01-19 The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model

Publications (2)

Publication Number Publication Date
CN101799839A CN101799839A (en) 2010-08-11
CN101799839B true CN101799839B (en) 2012-05-23

Family

ID=42595513

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010100398114A Expired - Fee Related CN101799839B (en) 2010-01-19 2010-01-19 The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model

Country Status (1)

Country Link
CN (1) CN101799839B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108897920A (en) * 2018-06-06 2018-11-27 北京科技大学 A method for constructing a subway network model

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102122434B (en) * 2011-01-24 2013-07-24 浙江工业大学 Urban public transport network optimization method capable of improving overall transfer performance
CN102331919B (en) * 2011-09-09 2013-11-20 西安电子科技大学 Maximum complete subgraph-based embedded system register allocation method
CN102982395B (en) * 2012-11-28 2015-10-28 浙江工业大学 A kind of bus rapid transit transfer method based on space nodes clustering method
CN104239965B (en) * 2014-08-27 2017-06-30 浙江工业大学 A kind of extensive road network bilayer method for routing divided based on overlap corporations
CN111915884B (en) * 2020-06-18 2021-09-28 北京航空航天大学 Traffic network behavior description method and device, electronic equipment and storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108897920A (en) * 2018-06-06 2018-11-27 北京科技大学 A method for constructing a subway network model
CN108897920B (en) * 2018-06-06 2021-03-05 北京科技大学 Subway network model construction method

Also Published As

Publication number Publication date
CN101799839A (en) 2010-08-11

Similar Documents

Publication Publication Date Title
CN101799839B (en) The establishment method of public transport network model with controllable network diameter based on random overlapping factions and public transport network model
CN102122434B (en) Urban public transport network optimization method capable of improving overall transfer performance
CN108537710A (en) A kind of urban growth boundary demarcation method based on Markov-FLUS models
CN107392355A (en) A kind of multimachine field coordination scheduling robust Optimal methods based on differential evolution algorithm
Wang et al. HSR mechanisms and effects on the spatial structure of regional tourism in China
Li et al. Tourism flow between major cities during China’s national day holiday: A social network analysis using Weibo Check-in data
CN107782323B (en) A Generation Method of High-level Navigation Road Network Based on Optimal Routes Between Cities
CN106156887A (en) A method for planning a travel itinerary
Ma et al. Coupling study on territory space suitability evaluation and construction land expansion simulation: a case study of Jiangxi province, China
CN103646132A (en) Layout method of urban public bicycle leasing network
Ghonimi et al. Towards sustainable new settlements in Egypt: lessons learned from a comparison between traditional and modern settlements in Greater Cairo Region–Egypt
QIAO et al. Optimization of the town-village construction pattern from the perspective of urban-rural symbiosis: A case study of Guanyun county, Jiangsu province
CN104537229A (en) Road network building and evolving method improving travel efficiency
CN104318333A (en) Transmission line channel preferring system and method based on multi-source spatial data
Wu et al. [Retracted] Rural Architectural Planning and Landscape Optimization Design under the Background of Ecological Environment Protection
Mele Urban Issues and Sustainability
Mohamedmeki et al. Multi Land Use Approach towards Sustainable Baghdad City: Bab Al-Muatham Garage as a Case Study
Ali Sustainable urban life in skyscraper cities of the 21st century
Akl et al. Population Density and Solar Radiation Effect on the Residential Buildings Forms: Case Study of the Graduates Villages at El-Burullus Lake.
Min A Study on the Spatial Distribution of Tourist Attractions above 3A Level in Hangzhou Based on POI Extraction
Yin et al. Importance Node Analysis of Shared Bicycle Network Based on Degree and Clustering Coefficient
Suzuki et al. Perspective of Savan-Seno special economic zone and Vientiane industrial park in the Lao PDR
Chiu et al. GIS-based decision supporting system in hydraulic simulation and economic analysis for rainwater harvesting design
Li et al. Transportation Demand Modeling Method Research—A Case Study of Chengdu
Li et al. Research on Numerical Simulation and Theoretical Method of Water Resources Carrying Capacity

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20201224

Address after: 276800 Yatou Xishan, Houcun Town, Donggang District, Rizhao City, Shandong Province

Patentee after: Shandong Shengshi Gongqing Tea Co.,Ltd.

Address before: Room 3a12, building A1, 1983 creative Town, 29 Nanxin street, Nanling village community, Nanwan street, Longgang District, Shenzhen, Guangdong 518114

Patentee before: Shenzhen Chengze Information Technology Co.,Ltd.

Effective date of registration: 20201224

Address after: Room 3a12, building A1, 1983 creative Town, 29 Nanxin street, Nanling village community, Nanwan street, Longgang District, Shenzhen, Guangdong 518114

Patentee after: Shenzhen Chengze Information Technology Co.,Ltd.

Address before: Hangzhou City, Zhejiang province 310014 City Zhaohui District Six

Patentee before: ZHEJIANG University OF TECHNOLOGY

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120523

CF01 Termination of patent right due to non-payment of annual fee