Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2016 / Article

Research Article | Open Access

Volume 2016 |Article ID 3898762 | 12 pages | https://doi.org/10.1155/2016/3898762

Analysis of Public Bus Transportation of a Brazilian City Based on the Theory of Complex Networks Using the P-Space

Academic Editor: Guangming Xie
Received06 Dec 2015
Accepted17 Apr 2016
Published22 Jun 2016

Abstract

The city of Curitiba, located at Southern Brazil, is recognized by its urban planning structured on three pillars: land use, collective transportation, and traffic. With 3.8 million people in its metropolitan area, the public transport system deals with approximately 2.5 million passengers daily. The structure and properties of such a transportation system have substantial implications for the urban planning and public politics for sustainable development of Curitiba. Therefore, this paper analyzes the structure of the public transportation system of Curitiba through the theory of complex networks in a static approach of network topology and presents a comparative analysis of the results from Curitiba, three cities from China (Shanghai, Beijing, and Guangzhou), and three cities from Poland (GOP, Warszawa, and Łódź). The transportation network was modeled as a complex network with exact geographical coordinates of its bus stops. In all bus lines, the method used was the P-Space. The results show that this bus network has characteristics of both small-world and scale-free networks.

1. Introduction

The theory of complex networks had its origins in graph theory with concepts from statistical mechanics, physics, and systems considered as complex [1]. These networks can be classified into social, technological, biological, information categories. As networks, their vertices and edges can describe their properties. For example, in a complex network, people can be represented by the nodes and the various relations between them by edges (connections between nodes).

Complex networks may have various topologies and characteristics according to the studied domain and can be analyzed, characterized, and modeled using some metrics [2]. Networks can also be static or dynamic: static when the number of nodes and vertices is time-independent and dynamic when it is possible to model their growth by an analysis of its structure variation throughout time.

Since the publication of the first article about small-world networks [3], research on complex networks has been a topic studied in the academia. Thereafter various concepts and models were introduced aiming at observing various physical processes, such as network dynamics, and how a network structure affects its dynamic behavior [4]. Public transportation systems (PTS) have been empirically analyzed under complex network framework. Complex network models of PTS (for bus and metropolitan train networks) can have a significant role in relieving congestion of increasingly heavy traffic in large cities due to urban expansion and population growing. The objective of many studies in the past two decades has been understanding and seeking to solve the existing urban mobility problem in all major cities in the world. Many studies have focused on some complex network static properties like degree distribution, average distance of the shortest path, clustering coefficient, closeness, and betweenness centrality that had some meaning to the studied PTS. One of the first studies [5] investigated the USA Boston subway network and highlighted the small-world properties and the so-called local and global efficiency of the PTS. Indian railway network was also studied [6] and indicated that it had small-world properties, like small average distances, and exponential degree distribution. Also urban train networks of Vienna (Austria) and Boston (USA) were analyzed by extending the use of random bipartite graph models from social networks to technological ones [7].

Public bus networks of 22 polish cities were modeled as complex networks using 2 different representations (P-Space and L-Space) [8] and obtained power-law and exponential degree distributions followed, respectively. Similar analysis conducted over 3 bus transportation networks of Chinese cities [9] revealed that these networks had small-world behavior. Similar results from PTS of some major Chinese cities [10] confirmed such a behavior. A study of public transportation of 14 cities in the world [11] showed that their complex network models had power-law degree distribution with different exponents; a result also is shown in [8]. Later, those authors [12] proposed an evolutionary model of mapping PTS growth in order to conduct a more comprehensive analysis. Scale-free network behavior was identified in several analyses performed over 33 metro-based PTS [13]. It happened due to the presence of large transfer hubs (or station) in 3 metro lines. It has also revealed that 19 of these systems had close relationship between the number of passengers and the network layout. It was identified from studies of topological and functional properties of complex networks [14] that Shanghai’s subway network was robust against random attacks but weak for targeted attacks and that the disconnection of the subway stops with the highest betweenness values could cause serious damage into this network. Although dynamic properties of transport networks have been studied, their common characteristics have not been identified [15]. All previous studies addressed statistical behavior of complex networks generated from PTS data (bus stops and bus lines). However the usefulness of complex network framework for the city planner was barely discussed. City planners have to answer population expectations like fast way to reach all PTS stops in the city, increase in vehicle frequency of transportation lines, reduction in the number of connections to reach a destination, and so forth. Nowadays Curitiba (a city in Sothern Brazil well-known by its bus-based transportation system) and its planners have addressed these expectations purely based on their experimental knowledge of years of PTS management. This paper analyzes the static topology of Curitiba PTS using complex network theory based on P-Space representation. Its characteristics were objectively measured by complex network metrics as degree, degree distribution, the shortest averaged path, clustering coefficient, community structure metric, and centrality metrics (betweenness and closeness ones). Using these metrics, comparisons with results from other cities of comparable size were performed. The second purpose was to relate this complex network analysis to geographic information (spatial location of the bus stops) in order to provide useful information for city planners by answering questions like the following. Which Curitiba’s neighbors were well and ill served by the PTS layout? Are the central bus stops (closeness) well spread along the city? Are the most important bus stops (betweenness) close to each other in order to easily allow lines detours in case of a localized strike, for example? Are the bus stops capable of sustaining the amount of lines served by it? These are questions that city’s planners are interested in and this paper will address them. This paper is organized as follows: first the concepts of complex networks and Curitiba’s public transportation system (CPTS) are shown. Then a topological analysis is performed, and a comparison to recent researches (based on similar conditions) is made in order to find better understanding of the topological properties of CPTS.

2. Complex Network

A complex network is a graph with nontrivial topological characteristics that are found in transport networks, computer networks, telecommunications networks, social networks, and biological networks [20]. Basic concepts of graph theory can be applied directly to any real-world network: vertices (nodes), edges (links or connections), degree of a vertex, loops, directed or undirected graphs, and paths. For example, the degree of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice [21]. Such networks may be static when the number of vertices and edges or even the configuration of the connections does not vary with time or dynamic. The later allows modeling the network growth by analysis of the variation in time of their structure. Although real-world networks are dynamic, they may still be analyzed as static ones if time-based variations are nonexistent or less important [2]. The understanding of the complex network topology primarily allows the development of mathematical models used for simulation of events and processes that may occur on the network. The following sections describe the application of these concepts for characterization of complex networks.

2.1. Random Networks

The most basic model of complex networks consists of generating random graphs with vertices and edges. Initially proposed by Erdős and Rényi [16] as random graph or random network, this was the first model with capability of coherently describing networks of diverse sizes. For example, it can represent a bus transportation system if the majority of bus stops (nodes) have approximately the same number of connections and only a few vertices (connections between bus stops according to their bus lines) differ on a larger scale of the global average degree. The random network null-hypothesis thus makes a specific prediction: degree distributions are bell-shaped normal distribution [22].

2.2. Small-World Networks

The small-world network, proposed by Watts and Strogatz [3], is the most popular model of random networks [2, 23] because of its treatments for high transitivity and clustering coefficient (a complex network property that defines how the vertices are connected). A small-world network with vertices [3], as shown in Figure 1, consists of a regular network with vertices connecting the nearest neighbor vertices in each direction totaling initial connections/edges, . Then, all the possible edges are randomly reconnected with a fixed probability (a concept from random network). If , the network will have a large number of loops and long paths. If , it becomes a totally random network with few loops and short paths. Another way to build a small-world network is to start with a regular network and then just randomly add some new connections/edges [23].

In Figure 1 shows how changes the network randomness: for , vertices are connected in pairs and they determine a regular network; as increases, the number of connections grows and therefore defines a small-world network; represents a random network. A small-world network is a common representation of many domains and presents a large number of connections between three vertices.

2.3. Scale-Free Networks

The models proposed by Erdős and Rényi (random networks) and Watts and Strogatz (small-world networks) [3] show a random pattern in edges and a characteristic degree in the majority of the vertices. The model proposed by Albert and Barabási [24] showed that several real systems are characterized by an unequal distribution of connections or a pattern of preferred connections called rich-get-richer (proposed by Albert and Barabási [23]) what in fact can be explained as a competitive advantage. This fact results in some highly connected vertices and others with low number of edges and the absence of a characteristic degree on the vertices [2]. The resulting model is known as scale-free network which shows an irregular distribution of edges. The set of edges to a same vertex indicates the appearance of central vertices called hubs, which are vertices that concentrate edges to many other vertices, as shown in Figure 2.

3. Curitiba’s Public Transportation System

Curitiba’s public transportation system (CPTS) is founded on the integrated use of buses in order to allow users to change among several bus lines and pay only one fare ticket with comfort and fast access to their destinations. Structurally it is based on north-south and east-west lines where the so-called express buses travel in exclusive roads. Adjacent to these roads there are slow-speed parallel ways for private cars. These pathways (fast bus and slow cars ways) establish a ternary system that structures all Curitiba’s urban planning as a whole, moving people from and to downtown [25]. Also there are bus lines connecting distinct Curitiba’s city neighbors directly and connecting Curitiba downtown to specific city neighbors not as fast as express bus does. All those lines form the so-called Integrated Transport Network (because of the complexity and number of lines, a vision of the Curitiba public transport based only on transport using buses is shown in Figure 3 in simplified form, because there is no metro stations in the city of Curitiba). The integration process (one fare-multiple bus uses) occurs in places called integration terminals. Thus, the user can choose their own path to scroll through several neighborhoods of Curitiba and its metropolitan region.

Altogether there are 14 cities interconnected by this network of bus lines which provides wide mobility to approximately 2.5 million people daily. Table 1 summarizes the CPTS operation [25]. It is important to mention that Curitiba does not have a train or metro system.


Operational dataUrbanMetropolitan integratedTotal

Number of buses1,3625831,945
Number of buses ()1,5006452,145
Passengers transported ()1,811.000459.0002,270.000
Equivalent paying passengers ()828,500.00201.5001,030.000
Equivalent paying passengers ()19,950.0005,050.00025,000.000
Lines509106615
Integration terminals21930
Tube station 34512357
Bus stops6,5162,5509,066
Kilometers traveled ()330,000150,000480,000

1: including reserves, 2: business day, and 3: average, month, year.

A bus line in CPTS is defined by its bus stops (origin, destination, and intermediate stops) that must be followed sequentially (a fixed path) according to a day-based timetable schedule, all predefined. A bus line usually has a reverse line associated: given a line with A and B as origin and destination bus stops, its reverse line will be B and A.

CPTS also has different kinds of bus stops. They can be classified according to their infrastructure and capacity to attend passengers and how they are charged for tickets. These are the three kinds of bus stops in Curitiba:(1)Regular bus stop is characterized by a simple infrastructure which attends few passengers and does not have accessibility devices. The fare is charged once inside the bus.(2)Integration terminal is characterized by large infrastructure to support lots of passengers and buses. It also has accessibility devices and passengers are charged at terminal entrance.(3)Tube station has intermediate infrastructure to support not too many passengers and buses. It is an intermediate infrastructure which also confines commuters inside it like an integration terminal but in a small scale. They have accessibility devices and passengers are charged at tube entrance. Inside terminals and tube stations, Curitiba’s passengers are allowed to change between buses without being charged. It is expected the CPTS commuting the largest number of users with comfort to/from the largest amount of destinations. By promoting a better public commuting service, a reduction on private car circulating is expected in the city. This is an important goal of Curitiba’s planners for the sustainable urban development of the city [26].

4. P-Space and L-Space

The definition of the complex network elements of a public transport network and how this network shall be modeled requires a lot of attention to establish a simple model where the extraction of results can be performed in a limited time [27]. The most widely used topologies are the P-Space and L-Space [810, 19, 2730]; sometimes P-Space was called space-of-changes [5, 6]. L-Space is shown in Figure 4(a). In this network for transportation modeling, a node corresponds to a bus stop and an edge represents a connection/link between two adjacent bus stops on the same route [19, 29, 30]. The aim of using L-Space networks is to find out if there are isolated lines or evaluate the possibility of accessing a certain city region by taking buses from any lines. A measurement as network degree allows comparison between two lines in terms of their node degree. P-Space is also shown in Figure 4 and is considered a transfer network, where a node is also a bus stop. The edges are formed by the links between all pairs of bus stops in the same bus line. So based on a P-Space topology shown in Figure 4(b), it is possible to observe that bus stop 3 has a degree of 8, so 8 bus stops can be reached from bus stop 3 without transfer, and the length between bus stop 4 and bus stop 7 is 2, so the passenger has to make one transfer to reach bus stop 4 from bus stop 7. Clearly the order of bus stops in a line has no effect in P-Space representation because all the bus stops in a bus line are considered first-order neighbors of an analyzed bus stop in that bus line. Therefore P-Space modeling of a network enables us to compute the amount of transshipment bus stops (they connect bus stops belonging to more than one bus line) and therefore estimate the average amount of bus transfer to reach a destination bus stop from any other bus stop, for example. P-Space can better describe the accessibility and convenience of transportation network. Furthermore, it has a strong generalization due to ignoring the sequential order of the stops in a route [30].

These P-Space characteristics can be used to support real planning of an integrated transport system as shown in [10, 19], with the advantage of modeling a connection between any two bus stops in the same route in random order. The L-Space generates less edges than P-Space, and L-Space preserves the geographical information more than P-Space.

5. Methodology Used to CPTS

The chosen method of topological construction and modeling of CPTS is as follows. As discussed in [10], L-Space method does not directly evaluate characteristics like transferring between bus lines, something useful to compare different public transportation systems. Data used here were obtained from Curitiba’s public transportation authority through an agreement signed with the UTFPR (Federal University of Technology of Paraná, Brazil). It involved () bus stops and 615 bus lines which needed to be filtered out before their use. Here duplicated records (duplicated bus lines) were eliminated. After filtering such data out, a complex network was built using P-Space method with 558,810 edges with the following characteristics and restrictions:(1)Only static properties of CPTS were considered.(2)The bus transport network was described as an undirected graph where the node (bus stop) and the edges represented connections between bus stops according to their bus lines [31].(3)All the bus stops (nodes in the built complex network) had unique identifiers and were associated with their geographical location.(4)The timetable schedules that each bus should follow to transverse its line were not considered here.(5)A bus line was represented by a set of bus stops identifiers that were ordered according to the sequence of bus stops that should be transverse by the bus attending such a line.(6)The connections (edges in the complex network) between bus stops could be set for one or more bus lines.(7)All the bus lines had unique identifiers.(8)At least one bus line was associated with a bus stop.(9)All intersections occurred at bus stops that were shared by more than one bus lines.

6. Analysis of Properties Based on P-Space Modeling

CPTS was represented as a graph , where is the set of nodes and is the set of edges. Mathematically is , an adjacent matrix, which graphically represents a complex network (formed by nodes and edges), which can be seen in Figure 5. It was verified that CPTS is a totally connected complex network, which means that there are no isolated bus lines.

Figure 6 shows in detail some bus stops (node) represented by their unique identifier: bus stop (node) NGNP8020 is connected to bus stops (node) NGNP4816 and NGNP4815 by a lines (edges), with degree 2.

After modeling CPTS as a complex network, some metrics were calculated in order to characterize it in terms of scale-free or small-world networks.

6.1. Degree Distribution ( and )

An edge between two nodes means that there is a direct bus that links them. So the degree of an analyzed bus stop () represents the number of its reachable bus stops without transferring between bus lines and is described mathematically by (1). The degree of the th bus stop in P-Space is proportional to the number of lines served by this bus stop [9]:

In Figure 7, the lowest, the highest, and the average degree () of were 2, 2969, and 65.72, respectively. The later result means that approximately 65 bus stops can be reached from any CPTS bus stop without transferring from the current bus line to the other one.

It is important to mention that nodes with were obtained because there were records of special bus lines in Curitiba’s transportation which are intended to stop only at a single bus stop during late night or whose disembarking does not occur at existing bus stops. The main characteristic of special lines is that they are composed of two interconnected nodes, that is, a graph of two points.

The degree distribution in Figure 7 also shows that there are around 10 bus stops from which a passenger can reach more than 1000 bus stops without bus transferring. It also shows the high average degree of Curitiba’s bus stops. In terms of type of bus stop, Table 2 shows that two of the ten bus stops with the highest degree are regular bus stops, while others ones are integration terminals. In terms of connectivity these bus stops may have remarkable importance for the CPTS.


TagDegree ()Type of bus stopBus stop name

A2969Integration terminalPinheirinho
B2945Integration terminal Capão Raso
C2178Integration terminal Hauer
D2075Integration terminal Cabral
E1618Integration terminalCampina do Sequeira
F1603Integration terminalCapão da Imbuia
G1440Integration terminalCIC
H1439RegularSt. Sandro
Carlos Sarda, 371-Jardim Amelia
I1405Integration terminal Portão
J1384RegularSt. Campos Sales; 842-Juvevê

The tag is used to geographically locate the bus stops in Figure 8.

Figure 8 shows that 50 percent of top 10 bus stops with the highest degree are concentrated in southwestern neighbors in Curitiba. This fact will be discussed later.

6.2. Cumulative Degree Distribution

In order to reduce large fluctuations, the cumulative distribution [1] was also used to describe the degree distribution in P-Space. On the downside, the resulting plot does not give a direct visualization of the degree distribution itself. The cumulative distribution (2) in the P-Space is presented in Figure 9:

Based on Figure 9, it is possible to say that the degree of CPTS network does not follow a Poisson distribution (a characteristic of small-world networks) but has a power-law distribution behavior in the log-log plot, growing with a preferential attachment.

Many empirical studies have shown that the degree distribution is mostly between a power-law and an exponential decay [32]. The degree distributions of these networks have been described as “having a power-law tail,” “truncated power-law,” “truncated exponential,” “double power-law,” and so forth. These distributions are better described using stretched exponential distribution (SED) as was proposed by Laherrère and Sornette in 1998 [33]. The latter form indicates a linear relation between and . Obviously, SED degenerates to an exponential distribution when is close to 1 and to a power-law when is close to 0. When is between 0 and 1, the degree distribution is between a power-law and an exponential function. The center region of an empirical distribution in a log-log plot may appear to have a linear part (scale-free region). However, there are typically curvatures in the head and tail parts. The closer the value of to 0, the wider the scale-free region.

Node degree in scale-free networks presents power-law distribution. Such distribution has no peak, most of its nodes have only few connections, and few of its nodes have large amount of connections. Based on analysis of cumulative degree distribution, which showed an approximately straight-line shape on doubly logarithmic scale, CPTS degree distribution resembles a power-law distribution. Therefore Curitiba’s transportation system showed scale-free network behavior.

6.3. Average Shortest Path Length

It is calculated from the shortest length between two network nodes since generally there are more than one way to connect them. The average shortest path has the property to reflect the network information efficiency. Mathematically (3) is the average shortest number of steps between all pairs of nodes, where is the shortest path between the th and the th nodes and is the number of vertices. In Figure 10, this metric was approximately equal to 3.37. It means that any bus stop in the CPTS can be reached from any other bus stop by changing bus times on average:

6.4. Cluster Coefficient

It refers to the number of connections between the closest neighbors of the th node. It has the property of characterizing the local cohesiveness of the th node or how the network nodes are clustered [2]. This metric reflects how easily passengers can move between the th bus stop and its neighbor ones possibly transferring between bus lines. It is calculated from (4) where is degree of the th node and is the number of connections between its neighbors. The average clustering coefficient of the entire network is described as (5). The resulting average for PTS was 0.809:

It has been shown [8] that the clustering coefficient in the P-Space decays linearly with the logarithm of degree for large and is almost constant and close to unity for small . Here, Figure 11 shows this dependency which can be described by a power-law distribution. It is mentioned [10] that all bus stops belonging to a complete subgraph of a single bus line have while generally decreases if the th bus stop belongs to more than one bus line. This indicates that the clustering coefficient of a node is strongly correlated with the node degree in public transport network. As grows, the relationship between , the average clustering coefficient of nodes with degree , and approximates to a power-law distribution; that is,In CPTS’s case, .

6.5. Community Structure

It is possible to find communities in -edges complex networks with few edges between the communities themselves [34]. The metric aims to detect the summation of the weights of intercommunity and intracommunity edges. In CPTS 187 communities were found. For the sake of comparison, the amount of Curitiba city neighborhoods was only 75 [17]. In many complex networks, communities can be defined hierarchically. When there are communities inside other communities, the concept of modularity is used to obtain the quality of such a hierarchical division in the community structure: higher modularity means stronger interconnections in the community structure. Newman and Girvan [35] proposed the measure of modularity described by (7). For a division with groups, it defines a matrix , where is the fraction of edges in the original network that connect vertices in the th group to those in the th group. So for a network is formed of disconnected modules and for higher the network presents modular structures. Values of close to 1 (maximum possible value) indicate strong community structure. Typically varies from 0.3 to 0.7 while higher values are rare [35].

Due to the large number of detected communities, CPTS modularity was , which indicates a strong community structure:

According to [35], the property that seems to be common to many networks is community structure (dense intergroup and sparse intragroup node connections).

Based on the result, the CPTS has the same characteristic of different complex systems that can overlap and interfere with each other in real-life, forming a network of networks. So in CPTS it is possible to say that individual network is one component within a much larger complex network of networks. As technology has advanced, coupling between networks has become increasingly strong. Node failures in one network will cause the failure of dependent nodes in other networks and vice versa based on the strong community structure noticed from the CPTS data. This recursive process can lead to a cascade of failures throughout the network of networks system.

Such is also the case in network theory, where the study of isolated single networks brings extremely limited results; real-world noninteracting systems are extremely rare in both classical physics and network study. Most real-world network systems continuously interact with other networks, especially since modern technology has accelerated network interdependency.

To adequately model most real-world systems, understanding the interdependence of networks and effect of this interdependence on the structural and functional behavior of the coupled system is crucial. Introducing coupling between networks is analogous to the introduction of interactions between particles in statistical physics, which allowed physicists to understand the cooperative behavior of such rich phenomena as phase transitions. Surprisingly, recent results on mathematical models [36] show that analyzing complex systems as a network of coupled networks may alter the basic assumptions that network theory has relied on for single networks.

6.6. Closeness Centrality ()

It measures how close a node is from the other ones in a network. It is the inverse of the sum of the shortest distances between each node and all other nodes as described inwhere is the central node, is another node (), and is the shortest distance between both nodes. The nodes with high closeness centrality are central in the network because they are close to most other nodes, while nodes with low closeness centrality are remote in the network [35]. According to Table 3 and Figures 12 and 13, 10 main bus stops of CPTS presented the shortest distance to any other bus stops since they presented the highest closeness centrality.


AliasValueType of bus stopBus stop name

A0.4410788 Integration terminalCabral
B0.43344954 Integration terminalCapão Raso
C0.41930044 Integration terminalPinheirinho
D0.41579488 Integration terminalFazendinha
E0.41356078 Integration terminalSanta Cândida
F0.41196212 Integration terminalPortão
G0.40734208 Integration terminalHauer
H0.4061649 Integration terminalCIC
I0.4061649 Integration terminalMaracanã
J0.40094262 Integration terminalBairro Alto

The alias identifier is used to geographically locate the bus stops in Figure 13.

It is important to mention that all of the bus stops shown in Table 3 are an integration terminal. Notably the largest bus flows were concentrated in integration terminals. Figure 12 shows that 60 percent of top 10 bus stops with the highest closeness centrality are concentrated in Southwestern Curitiba, the same behavior previously exhibited by the top 10 bus stops with the highest degree.

6.7. Betweenness Centrality ()

This centrality measurement is a very interesting quantity which characterizes the importance of a node in the network. The more central the node, the larger the number of shortest paths going through this node [37]. The metric can also be used to identify the nodes with high congestion [38, 39]. It can be defined for the th node by the sum of the fraction of all pairs of shortest paths which passes through the th node as shown in (9). Figures 14 and 15 and Table 4 show the obtained results for CPTS:where means the number of shortest paths from the th bus stop to the th bus stop and is the number of those that pass through the th bus stop.


AliasValueType of bus stopBus stop name

A1.1264549E7Integration terminalPinheirinho
B8512526.0Integration terminalCapão raso
C7870579.0Integration terminalCabral
D6025762.0Integration terminalCampo Comprido
E5832170.5Integration terminalPinhais
F5832170.5Integration terminalSanta Felicidade
G4138122.2Integration terminalGuaraituba
H4063932.8Integration terminalMaracanã
I3352379.2Integration terminalHauer
J3039188.2Integration terminalCampina do Siqueira

The alias identifier is used to geographically locate the bus stops in Figure 15.

From the results of betweenness centrality analysis summarized in Table 4, it was possible to determine the bus stops with higher potential for bus congestion, which could be critical for CPTS. All the bus stops in the Table 4 are integration terminals.

Figure 15 shows 10 bus stops in the metropolitan region served by CPTS. Doing an analysis in accordance with [38, 39], the bus stops and in Table 4 are those with the highest potential for bus congestion based on betweenness centrality. Geographically, Figure 15 also shows that bus stops are spread along the city. It is noteworthy that none of the bus stops in Table 4 were located in downtown area.

7. CPTS Compared with Other Cities

The results for CPTS were compared with those obtained for other Chinese cities [10] (Shanghai, Beijing, and Guangzhou) and Polish cities [8] (GOP, Warszawa, and Łódź). Their public transportation systems were also evaluated through P-Space complex networks.

Humphries et al. [40] introduced a quantitative metric—the small-world coefficient —which uses the ratio of network clustering to the average shortest path length, both calculated from the studied complex network ( and ) and an equivalent random network ( and ). Then their ratios are used to calculate the small-world coefficient as

The conditions that must be met for a network to be classified as small-world one are (or ) and which results in [40]. In case of CPTS, , , and , which means that CPTS should be classified as a small-world network according to [40]. Analyzing only and would classify CPTS as a small-world network since CPTS presented shorter average path length and higher clustering coefficient. However only few bus stops had high degree (according to Figure 7), which is a characteristic of scale-free networks considering [19, 31]. Therefore, this mixing behavior (CPTS being classified as both small-world and scale-free network) seemed to happen in transportation systems of both Chinese and Polish cities (Table 5). is intended to show how many bus stops can be reached from a given bus stop without transferring between bus lines. In Curitiba the values of and indicated that Curitiba had good transportation performance. Particularly the value of obtained for Curitiba showed a very sparse network, the same behavior observed in [19]. However was worse in CPTS when compared to other cities, except Shanghai. It is possible to infer that Curitiba city planners tried to compensate such a situation by increasing the number of bus lines that did not have a hub as a bus stop (based on the analysis they could be the integration terminals listed on Table 4), making “short cuts” across the city. It amplified the small-world characteristic of Curitiba transportation system. Since the amount of bus stops in Curitiba, Shanghai, and Beijing is quite close, it is possible to infer that CPTS had better performance if their population size was considered in a comparative analysis: Curitiba transportation system had higher number of bus stops by population, higher , and lower , and lower population than Chinese and Polish cities. Therefore, through these metrics, Curitiba may have better public transportation system in comparison to [8, 10].


Citybs

Curitiba - CPTS6159699380065.723.370.809
Shanghai164195022200044.403.450.772
Beijing171493611900092.543.000.754
Guangzhou125638911100075.583.130.750
GOP14122811210068.422.900.760
Warszawa4941530161590.932.420.691
Łódź294102380059.792.450.721

: routes or bus lines; bs: number of bus stops; : average degree; : average path length; : clustering coefficient; : city population in thousands of inhabitants based on [12, 17, 18].

8. Conclusions

Here a P-Space representation of Curitiba’s bus-based public transportation enabled the analysis of the main topological static properties of CPTS: the betweenness and closeness centrality. Through P-Space modeling, it was feasible to say that accessibility in CPTS was good due to its bus stops distribution (number of bus stops/number of bus lines). This was emphasized by examining the complex network results along with the geographic position of the bus stops. Also the mobility was considered better than Chinese and Polish cities because any of its destination bus stop could be reached by any other 65.72 bus stops (on average) located in metropolitan area (include bus stops located far from downtown). A comparative analysis of the results from [8, 10] was carried out and showed that CPTS has characteristics of both scale-free and small-world networks, which is a behavior encountered in the bus transportation networks. Since CPTS has also high modularity, it is possible to consider it as a scale-free network (hub-based network) with small-world characteristics and hierarchical structures built up around its hubs. These statistical results are similar to features observed in other transport networks (underground, railway, or airline systems) [9, 2731] where such networks tend to share small-world characteristics. It is possible to speculate that bus transportation system of other cities with comparable population and transportation infrastructure can be modeled as complex networks with mixing characteristics. Particularly for Curitiba and based on the results of Tables 2, 3, and 4 (the top 10 bus stops with the highest degree, closeness centrality, and betweenness centrality) the integration terminals named as “Pinheirinho,” “Capão Raso,” and “Cabral” (all located in Southwestern Curitiba) are the most important bus stops and these are the main hubs of the Curitiba transportation system. It is possible to say that these points focus much on CPTS congestion flow. Based on this congestion the city planners could use this high flow congestion information to improve the infrastructure of these terminals.

Thus it can be said that in case of possible failure in one of these three integration terminals network could suffer large impact which would compromise the entire public transportation system. Also the location of the most important bus stops in the system identified by this complex network analysis showed that the north-south lines seemed to be the main lines of the CPTS in comparison with the east-west lines. It could be explained by population density distribution across the city or their social level distribution. City planners could use such information in order, for example, to verify the causes for such an unbalance in north-south lines in comparison to east-west lines.

With the results of Table 2 city planners may replan the bus stops “H” and “J,” promoting them to integration terminals, enabling better quality.

Finally, the presented results from P-Space modeling of CPTS could be used as reference and guidance to explore the mechanism of evolution and modeling Curitiba’s urban public transport both statically or dynamically, and through this model planners can view clearly and objectively the main characteristics of networks, but only through empirical knowledge.

Future works will address the effect of other variables (like travel time, bus line capacity, and time schedule) to evaluate their influence on complex network modeling of transportation systems and also evaluate how changes and possible failures in Curitiba transportation system affect the complex network metrics.

Competing Interests

The authors declare that there are no competing interests regarding the publication of this paper.

Acknowledgments

This research was supported by the UTFPR (Federal University of Technology of Paraná, Brazil). The authors would like to thank the URBS and Municipality of Curitiba for providing public transportation data.

References

  1. M. E. J. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003. View at: Publisher Site | Google Scholar
  2. L. D. F. Costa, F. A. Rodrigues, G. Travieso, and P. R. V. Boas, “Characterization of complex networks: a survey of measurements,” Advances in Physics, vol. 56, no. 1, pp. 167–242, 2007. View at: Publisher Site | Google Scholar
  3. D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at: Publisher Site | Google Scholar
  4. J. Feng, The construction and analysis of complex network model [M.S. thesis], Search Results Northeastern University, Shenyang, China, 2004.
  5. V. Latora and M. Marchiori, “Efficient behavior of small-world networks,” Physical Review Letters, vol. 87, pp. 1–4, 2001. View at: Google Scholar
  6. P. Sen, S. Dasgupta, A. Chatterjee, P. A. Sreeram, G. Mukherjee, and S. S. Manna, “Small-world properties of the Indian railway network,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 67, no. 3, 2003. View at: Google Scholar
  7. K. A. Seaton and L. M. Hackett, “Stations, trains and small-world networks,” Physica A: Statistical Mechanics and Its Applications, vol. 339, no. 3-4, pp. 635–644, 2004. View at: Publisher Site | Google Scholar
  8. J. Sienkiewicz and J. A. Hołyst, “Statistical analysis of 22 public transport networks in Poland,” Physical Review E, vol. 72, no. 4, Article ID 046127, 2005. View at: Publisher Site | Google Scholar
  9. X. Xu, J. Hu, F. Liu, and L. Liu, “Scaling and correlations in three bus-transport networks of China,” Physica A: Statistical Mechanics and its Applications, vol. 374, no. 1, pp. 441–448, 2007. View at: Publisher Site | Google Scholar
  10. Q. Xu, Z.-H. Zu, Z.-J. Xu, W.-D. Zhang, and T. Zheng, “Space P-based empirical research on public transport complex networks in 330 cities of China,” Journal of Transportation Systems Engineering and Information Technology, vol. 13, no. 1, pp. 193–198, 2013. View at: Google Scholar
  11. C. Von Ferber, T. Holovatch, Y. Holovatch, and V. Palchykov, “Network harness: metropolis public transport,” Physica A: Statistical Mechanics and Its Applications, vol. 380, no. 1-2, pp. 585–591, 2007. View at: Publisher Site | Google Scholar
  12. C. Von Ferber, T. Holovatch, Y. Holovatch, and V. Palchykov, “Public transport networks: empirical analysis and modeling,” The European Physical Journal B—Condensed Matter and Complex Systems, vol. 68, no. 2, pp. 261–275, 2009. View at: Publisher Site | Google Scholar
  13. S. Derrible and C. Kennedy, “The complexity and robustness of metro networks,” Physica A: Statistical Mechanics and Its Applications, vol. 389, no. 17, pp. 3678–3691, 2010. View at: Publisher Site | Google Scholar
  14. J. Zhang, X. Xu, L. Hong, S. Wang, and Q. Fei, “Networked analysis of the Shanghai subway network, in China,” Physica A: Statistical Mechanics and its Applications, vol. 390, no. 23-24, pp. 4562–4570, 2011. View at: Publisher Site | Google Scholar
  15. J. Wu, Z. Gao, and H. Sun, “Simulation of traffic congestion with SIR model,” Modern Physics Letters B, vol. 18, no. 30, pp. 1537–1542, 2004. View at: Publisher Site | Google Scholar
  16. P. Erdős and A. Rényi, “On random graphs. I,” Publicationes Mathematicae, vol. 6, pp. 290–297, 1959. View at: Google Scholar
  17. IPPUC, “Institute for Research and Urban Planning Curitiba,” 2014, http://www.ippuc.org.br/mostrarpagina.php?pagina=88&idioma=1&liar=n%E3o. View at: Google Scholar
  18. United Nations, “World Urbanization Prospects Revision,” 2011, http://www.un.org/en/development/desa/publications/world-urbanization-prospects-the-2011-revision.html. View at: Google Scholar
  19. H. Zhang, P. Zhao, J. Gao, and X.-M. Yao, “The analysis of the properties of bus network topology in Beijing basing on complex networks,” Mathematical Problems in Engineering, vol. 2013, Article ID 694956, 6 pages, 2013. View at: Publisher Site | Google Scholar
  20. S. Bornholdt and H. Schuster, Handbook of Graphs and Networks: From the Genome to the Internet, Wiley-VCH, Weinheim, Germany; University of Kiel, Kiel, Germany, 1st edition, 2006.
  21. E. Shimon, Graph Algorithms, Computer Science Press, Rockville, Md, USA, 2nd edition, 1979.
  22. A.-L. Barabási and E. Bonabeau, “Scale-free networks,” Scientific American, vol. 288, no. 5, pp. 60–69, 2003. View at: Google Scholar
  23. R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–97, 2002. View at: Publisher Site | Google Scholar
  24. R. Albert and A.-L. Barabási, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at: Publisher Site | Google Scholar
  25. URBS, “Integrated Transport Network of Curitiba-PR-Brazil,” 2014, http://www.urbs.curitiba.pr.gov.br/transporte/rede-integrada-de-transporte. View at: Google Scholar
  26. UTFPR, Smart City Concepts in Curitiba, Memorandum of Understanding no. 0639, Federal University of Technology of Parana, 2014.
  27. L. Zhang, X. Ma, H. Wang, M. Feng, and S. Xue, “Modelling and optimisation on bus transport system with graph theory and complex network,” International Journal of Computer Applications in Technology, vol. 48, no. 1, pp. 83–92, 2013. View at: Publisher Site | Google Scholar
  28. Y.-Z. Chen, N. Li, and D.-R. He, “A study on some urban bus transport networks,” Physica A: Statistical Mechanics and Its Applications, vol. 376, no. 1-2, pp. 747–754, 2007. View at: Publisher Site | Google Scholar
  29. Y.-Z. Chen and N. Li, “The randomly organized structure of urban ground bus-transport networks in China,” Physica A: Statistical Mechanics and its Applications, vol. 386, no. 1, pp. 388–396, 2007. View at: Publisher Site | Google Scholar
  30. Z.-T. Zhu, J. Zhou, P. Li, and X.-G. Chen, “An evolutionary model of urban bus transport network based on B-space,” Chinese Physics B, vol. 17, no. 8, pp. 2874–2880, 2008. View at: Publisher Site | Google Scholar
  31. L. Zhang, H. Ma, B. Sun, Y. Li, M. Wang, and S. Xue, “Computing and application on complex bus network system,” International Journal of Information and Computer Science, vol. 2, no. 7, pp. 127–132, 2013. View at: Google Scholar
  32. X. Li and G. Chen, “A local-world evolving network model,” Physica A: Statistical Mechanics and its Applications, vol. 328, no. 1-2, pp. 274–286, 2003. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  33. J. Laherrère and D. Sornette, “Stretched exponential distributions in nature and economy: ‘fat tails’ with characteristic scales,” The European Physical Journal B—Condensed Matter and Complex Systems, vol. 2, no. 4, pp. 525–539, 1998. View at: Publisher Site | Google Scholar
  34. M. E. J. Newman, “Detecting community structure in networks,” The European Physical Journal B, vol. 38, no. 2, pp. 321–330, 2004. View at: Publisher Site | Google Scholar
  35. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 2, article 26113, 2004. View at: Publisher Site | Google Scholar
  36. R. Parshani, S. V. Buldyrev, and S. Havlin, “Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition,” Physical Review Letters, vol. 105, no. 4, Article ID 048701, 2010. View at: Publisher Site | Google Scholar
  37. M. Barthélemy, “Spatial networks,” Physics Reports, vol. 499, no. 1–3, pp. 1–101, 2011. View at: Publisher Site | Google Scholar
  38. B. K. Singh and N. Gupte, “Congestion and decongestion in a communication network,” Physical Review E, vol. 71, no. 5, Article ID 055103, 2005. View at: Publisher Site | Google Scholar
  39. S. Mukherjee and N. Gupte, “Gradient mechanism in a communication network,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 77, no. 3, 12 pages, 2008. View at: Publisher Site | Google Scholar
  40. M. D. Humphries, K. Gurney, and T. J. Prescott, “The brainstem reticular formation is a small-world, not scale-free, network,” Proceedings of the Royal Society of London B: Biological, vol. 273, no. 1585, pp. 503–511, 2006. View at: Publisher Site | Google Scholar

Copyright © 2016 A. A. De Bona et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

2238 Views | 1005 Downloads | 11 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.