<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Barcelona Effect: Studying the Instability of Shortest Paths in Urban Settings</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Giuliano</forename><surname>Cornacchia</surname></persName>
							<email>giuliano.cornacchia@phd.unipi.it</email>
							<affiliation key="aff0">
								<orgName type="institution">University of Pisa</orgName>
								<address>
									<settlement>Pisa</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="institution">ISTI-CNR</orgName>
								<address>
									<settlement>Pisa</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Mirco</forename><surname>Nanni</surname></persName>
							<email>mirco.nanni@isti.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="institution">ISTI-CNR</orgName>
								<address>
									<settlement>Pisa</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Francesco</forename><surname>Grassi</surname></persName>
							<email>fragrassi94@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="institution">University of Pisa</orgName>
								<address>
									<settlement>Pisa</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<address>
									<settlement>Paestum</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Barcelona Effect: Studying the Instability of Shortest Paths in Urban Settings</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">E11A122B173ADEB0C36A15A18CC68317</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T17:18+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Urban mobility</term>
					<term>Shortest path instability</term>
					<term>Road network efficiency</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Human mobility is one of the important factors affecting the efficiency of cities and the quality of life of their dwellers. However, while city planners aim to improve the urban road network design to satisfy the local mobility demand and distribute traffic in an optimal way, the structure of cities across different areas and countries vary considerably and in complex ways, sometimes being the result of historical stratifications. One question that emerges, then, is how we can characterize cities in terms of (potential) traffic efficiency. In this work we aim to study the problem from a new perspective, introducing the concept of (shortest) path instability, which quantifies the tendency of a road network to provide very different travel alternatives for just slightly different trips. A notable case of that, which stimulated this research, is the city of Barcelona, where, apparently, reaching very close destinations might require very different routes. The concept is implemented and applied to two case studies at different spatial scales, one comparing the European capitals and the other comparing municipalities of an Italian region. Results show that path instability is heterogeneously distributed, with some largely unstable cities and others very stable, and it is not directly determined by simple city characteristics, such as the city size or its "smartness".</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Vehicular traffic is one of the critical factors affecting the efficiency of cities and the quality of life of their citizens, the economic efficiency of cities, and the environmental impact of transportation. Nowadays, traffic optimization is of particular relevance, especially in the current context where cities continue to expand in population and density, impacting traffic management, pollution, and road safety. Efficient and sustainable road mobility is therefore essential to ensure that cities remain livable, competitive, and able to meet the needs of their residents.</p><p>As urban mobility forms a complex phenomenon, it is extremely important to understand how the travel infrastructures and the city's mobility needs combine, particularly whether the road network provides the correct connections for smooth mass mobility. One recent line of research deals with this aspect by assessing the reachability of city destinations in terms of efficient alternative paths available, which is a measure of road network robustness to high traffic loads and resilience to unexpected events (road closures, accidents, extreme traffic for public events, etc.). This work focuses on a related topic that stems from an anecdotal observation: in the city of Barcelona, Spain, mobility navigators often provide very different paths to reach two very similar destinations. A sample of that is shown in Figure <ref type="figure" target="#fig_0">1</ref>, where two almost identical destinations are suggested to follow completely different routes. Thus, the questions we study are: is this variability of paths a peculiarity of Barcelona? Or is it a peculiarity of all/most large European cities? Is it limited to carefully planned smart cities, or does it happen also in less developed areas? Are there contextual factors that determine the phenomenon?</p><p>To tackle the questions above, we develop an analytical framework implementing the concept of path instability -namely, a measure of how much small perturbations to the destination of a trip change the best path to reach it -and then apply it to evaluate empirically the presence and size of the phenomenon in several different cities. In particular, we provide results both at a continental scale, comparing European capitals (some of which provide good examples of very large and/or smart cities), and at a regional scale, comparing the municipalities in an Italian region (most of which are small and with a simple mobility infrastructure).</p><p>Our results show that path instability is relatively common, and the overall picture is quite complex. The phenomenon is not limited to a specific class of cities -e.g., large cities, highly populated ones, smart cities, etc.and, while some interesting correlations with features and mobility aspects of the cities were found, a clear explanation of the factors leading to instability is still missing, requiring further research.</p><p>In the following sections, we review the relevant literature on the topic (Section 2), describe our approach (Section 3), present the experiments and results (Sections 4 </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related Work</head><p>Road networks play a pivotal role in modern transportation systems, serving as the circulatory system that facilitates the movement of people and goods within urban landscapes. Understanding and optimizing traffic flow in these networks is a fundamental challenge in transportation research, with implications for efficiency, safety, and environmental sustainability.</p><p>Different works have focused on the topology and properties of road networks. Urban road networks are well-known to exhibit universal characteristics and scaleinvariant patterns despite cities' different geographical and historical contexts <ref type="bibr" target="#b0">[1]</ref>. For example, Barthélemy et al. <ref type="bibr" target="#b1">[2]</ref> demonstrate how the evolution of many different transportation networks follows a simple universal mechanism. In <ref type="bibr" target="#b0">[1]</ref>, the authors explore the detour index (DI), defined as the ratio between the shortest distance through the road network and the Euclidean distance through the road network for various spatial variables, and discover universal properties.</p><p>A lot of research interest has then been applied to how to navigate road networks efficiently, exploiting the well-known road network characteristics. The shortest path is the most straightforward way for tracing the path from origin to destination in a road network <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref>. However, from a collective point of view, aggregating all individual fastest paths may increase traffic congestion and CO2 emissions <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b5">6,</ref><ref type="bibr" target="#b6">7,</ref><ref type="bibr" target="#b7">8,</ref><ref type="bibr" target="#b8">9]</ref>. A way to overcome this problem and to distribute the vehicles more evenly on the road network is to go beyond the shortest path using Alternative Routing (AR) algorithms <ref type="bibr" target="#b9">[10]</ref> that provide a plurality of alternative paths between an origin and a destination location in a road network.</p><p>There are several ways to compute the alternatives. Edge-weight-based approaches compute the shortest paths iteratively, and at each iteration, they update the edge weights of the road network to compute 𝑘 alternative paths <ref type="bibr" target="#b9">[10,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b11">12]</ref>.</p><p>In contrast, Plateau-based methods generate alternative paths based on plateaus, i.e., common branches between the origin and destination shortest-path trees <ref type="bibr" target="#b12">[13]</ref>.</p><p>Chondrogiannis et al. <ref type="bibr" target="#b13">[14]</ref> propose the 𝑘-Shortest Paths with Limited Overlap (𝑘SPLO), seeking to recommend 𝑘-alternative paths that are as short as possible and sufficiently dissimilar. Chondrogiannis et al. <ref type="bibr" target="#b14">[15]</ref> formalize the 𝑘-Dissimilar Paths with Minimum Collective Length (𝑘DPML) providing 𝑘 paths sufficiently dissimilar while having the lowest collective path length. Hacker et al. <ref type="bibr" target="#b15">[16]</ref> propose 𝑘-Most Diverse Near Shortest Paths (KMD) to recommend the set of 𝑘 near-shortest paths (based on a user-defined cost threshold) with the highest diversity.</p><p>AR solutions may be employed for the Traffic assignment (TA) task to allocate vehicle trips on a road network to minimize congestion and travel time <ref type="bibr" target="#b16">[17]</ref>. In <ref type="bibr" target="#b17">[18]</ref>, the authors propose METIS, a one-shot TA algorithm that integrates an AR algorithm (𝑘-Most Diverse Near Shortest Paths <ref type="bibr" target="#b15">[16]</ref>) into TA, showing how generating alternative routes may improve Traffic Assignment and reducing traffic negative externalities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Position of our work</head><p>Our study focuses on an aspect of mobility within road networks closely related to alternative routing, aiming to understand the intrinsic tendency of a network to spontaneously induce some variability in the paths rather than trying to generate them artificially. Indeed, our generated paths follow the traditional and simple Dijkstra algorithm for shortest paths. We introduce the shortest path instability concept, quantifying the road network's inclination to present significantly different travel alternatives for slightly different trips.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Methods</head><p>This section details the procedure to analyse the shortest path instability within a road network. Path instability refers to a road network's propensity to exhibit markedly different route alternatives when the destination location is slightly changed. In this work, we consider the shortest path as the path to reach a destination starting from an origin. Understanding this phenomenon is crucial for enhancing the reliability and efficiency of transportation systems.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Path Instability Index</head><p>To assess the instability of the shortest path within an urban environment, we introduce the Path Instability Index, conceived as an analytical tool to measure and quantify the geographical variance among different routes. It is based on a set representation of routes, associating to a route the sequence of road segments it traverses, and the Jaccard Index, widely used in the field of data science as a metric for similarity and dissimilarity between sets.</p><p>The Path Instability Index 𝐼 between two routes 𝐴 and 𝐵 is then defined as:</p><formula xml:id="formula_0">𝐼(𝐴, 𝐵) = 1 − 𝐽(𝐴, 𝐵)</formula><p>where 𝐴 and 𝐵 are represented by their corresponding set of road segments visited along the path. The Path Instability Index, like the Jaccard Index, ranges on a scale between 0 to 1. A value of 𝐼(𝐴, 𝐵) equal to 0 means that the two routes 𝐴 and 𝐵 overlap, denoting complete path stability. Conversely, a value of 1 indicates that 𝐴 and 𝐵 do not have any common road segment between the two routes, showing total path instability. In summary, the closer the Path Instability Index is to 1, the greater the difference between the routes.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">City Instability Index</head><p>To efficiently analyze and quantify the shortest path instability within an urban environment, studying the shortest path instability between several origin-destination pairs (𝑜, 𝑑) within the road network is necessary. Such a pair, also denoted as OD pair, represents a trip within a mobility demand.</p><p>The steps required to quantify the shortest path instability of a city comprise the generation and selection of OD pairs within the area of interest, the generation of the shortest paths between the OD pairs, and the computation of the Path Instability Index for the paths associated with each OD.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.1.">OD Pairs Generation</head><p>To have an accurate idea of a city's shortest path instability, we need to compute the Path Instability Index for several origin-destination pairs. Clearly, it is not possible to analyse it between every possible OD pairs for computational matters, hence, we need to generate a set of OD pairs which are representative of a city's road network. We model a city's road network as a directed graph 𝐺 = (𝑉, 𝐸) where the set of edges 𝐸 contains roads, and the set of nodes 𝑁 contains the intersections between roads. We downloaded the road network representation for the geographical area of interest from OpenStreetMap (OSM<ref type="foot" target="#foot_0">1</ref> ).</p><p>To avoid introducing geographical bias in the sampling method, we generate a collection 𝐷 of 𝑁 origindestination pairs in which each pair (𝑜, 𝑑) ∈ 𝐷 is selected through a uniform random process for both the origin 𝑜 and destination 𝑑, while ensuring a minimum distance 𝛿 between the generated points.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.2.">Computing Path Perturbations</head><p>To compute the instability of the whole road infrastructure to quantify the tendency of a road network to provide very different travel alternatives for just slightly different trips, we need to create the variation of the sampled trips and assess its Path Instability Index 𝐼.</p><p>First, we generate four OD variations for each OD pair (𝑜, 𝑑) ∈ 𝐷 by deterministically displacing the destination location 𝑑 towards the four cardinal points at a distance 𝑟 from the original position. We refer to these variations as (𝑜, 𝑑 𝑥,𝑟 ) with x ∈ {N, S, E, W} denoting the displacement direction and 𝑟 representing the distance in meters from the original point 𝑑.</p><p>Then, for every origin-destination (OD) pair (𝑜, 𝑑), we calculate the shortest path 𝑝 connecting 𝑜 and 𝑑. Subsequently, for each variation (𝑜, 𝑑 𝑥,𝑟 ) of (𝑜, 𝑑), we compute 𝑝𝑥, the shortest path connecting 𝑜 and 𝑑 𝑥,𝑟 in the road network.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.3.">City-level Aggregation of Instability Index</head><p>For each OD pair (𝑜, 𝑑) we now have four perturbed paths 𝑃 𝑜,𝑑 = {𝑝𝑥|𝑥 ∈ {𝑁, 𝑆, 𝐸, 𝑊 }}. At this point, we compare all pairs of perturbations through the Path Instability Index, thus computing the multiset 𝐼 𝑜,𝑑 = {𝐼(𝑝𝑥, 𝑝𝑦)|𝑝𝑥 ∈ 𝑃 𝑜,𝑑 , 𝑥𝑦 ∈ 𝑃 𝑜,𝑑 , 𝑥 ̸ = 𝑦}. This results in a multiset of Path Instability Indexes 𝑃𝐷 = </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>⋃︀</head><p>(𝑜,𝑑)∈𝐷 𝐼 𝑜,𝑑 for the whole city. We aggregate the values in this multiset either through a global average or through a box-plot distribution.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Experimental Settings</head><p>In this section we summarize the experimental setting adopted to analyze the Path Instability Index across various urban scenarios and two different geographical contexts.</p><p>On the large geographical scale, we focus our study on European capitals (Figure <ref type="figure" target="#fig_1">2</ref>(left)) plus Barcelona, since it was the motivating example of the work. European capitals provide several examples of large and highly developed cities with complex traffic structures. On a smaller scale, we study the municipalities in Tuscany, Italy (Figure <ref type="figure" target="#fig_1">2</ref>(right)). Most municipalities have a small city center, yet some of them cover also a significantly large sub-urban area and have a complex road network. For both contexts, we obtain the road network representation for each geographical area of interest from OpenStreetMap.</p><p>Following our experimental strategy, for each urban scenario, we generate N=10,000 OD-pairs having a minimum distance 𝛿 of 500 meters, considering their displacement towards the four cardinal points with a distance 𝑟 equal to 50 meters.</p><p>To retrieve the routes between an origin location 𝑜 and a destination location 𝑑, we utilize the OSMnx service, built upon OpenStreetMap. Through this service, we obtain a path 𝑝 representing the shortest route to reach the desired destination 𝑑, starting from the specified origin location 𝑜. Associated with the shortest path, we col-lected other relevant information about the route, such as its length and expected travel time.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Results</head><p>In this section, we examine and discuss the results of the Instability Index analysis on the European capitals and the city of Barcelona, subsequently extending the analysis to the municipalities in Tuscany, Italy. As discussed previously, the goal is to discover, highlight, and understand the dynamics characterizing the presence of the Instability phenomenon within different geographical contexts and to assess the possible influence that the collected variables may have on the observed phenomenon.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">European Capitals and Barcelona</head><p>Figure <ref type="figure" target="#fig_2">3</ref> illustrates the distribution of the Path Instability Index among European Capitals through box-plots sorted by descending average values, highlighting the particular case of Barcelona. As we expected, the results are significantly heterogeneous. Also, only very few cities lean towards shortest path stability, denoted by a value of 𝐼 close to 0, while most cities display a more prevalent tendency towards instability in their shortest paths.</p><p>Confirming our initial intuition, Barcelona is indeed among the top unstable-path cities, with instability values up to 0.15 and extreme cases close to 0.4. Top cities are quite heterogeneous in terms of size, including large cases like Paris (ranked 3rd) and rather small ones like Nicosia (ranked 4th). Similarly, some large and complex cities like London, Rome, and Moskow are ranked at the bottom, further suggesting that path instability cannot be Additionally, looking at the inter-quartile range of boxes, we can observe that certain cities emerge as stability islands, having an Instability Index that is consistently low for most of the OD pairs and not just on average, e.g., London and Oslo; in contrast, cities such as Lisbon (among the most unstable ones) and Stockholm (among the medium ones) demonstrate a wider dispersion, suggesting that instability greatly depends on which parts of the city are involved in the trips.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Municipalities in Tuscany</head><p>The objective of the second case study is to explore the Path Instability Index, redirecting the analysis towards a smaller geographical scale scenario consisting of the municipalities of Tuscany, an Italian region. This approach intends to investigate the dynamics of the Instability Index in an environment characterized by varied urban centers that are relatively small and share a regional identity. Such an approach enables a more nuanced understanding of the Index's behavior.</p><p>Since the road networks of some municipalities are too small to create a significant set of distinct OD pairs, the analysis focused on a subset of 50 cases not affected by the issue. Figure <ref type="figure" target="#fig_3">4</ref> shows the distribution of the Path Instability Index for the selected municipalities.</p><p>In contrast to the findings from the analysis of European capitals, most Tuscan cities show very low median values, close to zero for all but the top 6 ones. At the same time, a larger portion of municipalities has inter-quartile ranges reaching 0.1, suggesting that the variability of outcomes for different trips in the same area (and thus their dependence from the specific portion of the municipality involved) is even higher than the European-scale case.</p><p>Geographically speaking (Figure <ref type="figure" target="#fig_1">2</ref>(right)), we can identify a clear cluster of municipalities in the Central-Northern part of the region, approximately around the Pisa-Florence line, which is the strongest communication axis of the region. In addition, a few municipalities along the coast emerged, including two of the top ones in terms of the Instability Index: Forte dei Marmi (ranked 1st) and Viareggio (ranked 6th). </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.">Correlations</head><p>To unveil the underlying dynamics of the Path Instability Index and its potential connections with other urban attributes, we analyzed the Pearson correlations between the index and two families of attributes: one is related to the general characteristics of the shortest paths generated and includes length and duration of the trip, the number of intersections and complex intersections (namely those connecting more than three roads), the number of one-way streets and turns performed; the other family regards the road geometry and infrastructure, including the number of intersections, one-way roads, bridges and bike lanes in the city.</p><p>The results, summarized in Table <ref type="table" target="#tab_0">1</ref> for both case studies, show some interesting outcomes. First, at both European and regional scales, the instability index is significantly negatively correlated to the length and duration of the generated trips. Thus, longer paths appear to be generally more stable than shorter ones. Second, all other features have a smaller, negative correlation to instability at the European level, while they show a positive and typically much larger correlation at the regional level. This highlights the fact that the two scales hide different mechanics, and thus, their relations with the instability index are widely different. This is also summarized in Figure <ref type="figure" target="#fig_4">5</ref>, where average trip lengths and number of intersections are plotted together with the instability index at the two scales: it is clear how the trip length has a similar behavior in the two scenarios, while the number of intersections is diametrally opposite.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Discussion</head><p>Path Instability: a universal phenomenon. The shortest path instability phenomenon is not limited to our motivating example of Barcelona, which indeed exhibits high levels of instability, confirming our initial intuition, but manifests universally, although with varying degrees. The analysis performed among different European capitals reveals that path instability in urban pathways is a common characteristic, irrespective of differences in road network size or urban planning patterns, suggesting that beyond architectural and urbanistic specificities, there are mobility and planning dynamics that go beyond geographical boundaries. Results on Tuscany also show that this phenomenon's emergence is not linked to the 'smart city' status, as it can be observed even in simple realities such as the majority of regional municipalities.</p><p>The  the sea, raises interesting questions about the influence of coastal features on path instability. One potential reason for this phenomenon is that the radial growth of roads in coastal cities may be constrained. This limitation could result in higher road concentrations with a prevalence of one-way roads, as there is limited space for expanding roads in both directions within the city. Consequently, when displacing the destination location towards one of the four cardinal points, it may be assigned to a road that is either not directly connected to the original ones or even going in the opposite direction, leading to a significantly different route.</p><p>Trip distance impacts Path Instability. The correlations among the Path Instability Index and the trip length for the European capitals (𝑟 = −0.76) and municipalities in Tuscany (𝑟 = −0.49) suggest that longer paths are slightly less prone to instability or, as observed, subject to instability with low values.</p><p>Longer trips exhibit greater stability, possibly due to the fact that they tend to flow into fast, long-range roads, such as highways and motorways, that represent the main part of the trip and remain unchanged when slightly perturbing the destination. In contrast, using such roads might not be convenient for short trips since reaching highways and fast connections usually requires deviations whose cost outbalances the faster travel speed.</p><p>Intersections impact Path Instability. The Path Instability Index exhibits a positive correlation (𝑟 = 0.49) with the average number of intersections along paths within municipalities in Tuscany. This implies that as the density of intersections in a road network increases, there is a corresponding rise in path instability. In simpler terms, more intersections contribute to a greater likelihood of paths being perturbed and diversifying the available routes. In essence, the density of intersections emerges as a significant factor influencing the complex dynamics of path instability, fostering a more varied generation of perturbed paths.</p><p>Different scales, different results. While less significant than the two cases discussed above, the correlations between path instability and various other features are nevertheless not negligible. Yet, we observed that such correlations have an opposite direction in the two geographical scales analyzed (Europe vs. Tuscany), which requires further investigations. For instance, the number of intersections, which has a strong positive correlation with the instability index in Tuscany, has a weaker, negative correlation in Europe, suggesting that the ways intersections influence paths are completely different in the two cases.</p><p>All this evidence leads to the conclusion that the shortest path instability is a complex phenomenon where many factors influence the results, and those identified in this study only partially cover them.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Conclusion</head><p>In this paper, we introduced path instability, a phenomenon that emerges from the road network structure and is expected to significantly influence the network's capability to deal with urban traffic. The framework we developed allowed us to check and analyze the phenomenon of cities of different natures -capitals of Europe vs. (small) regional municipalities -revealing some interesting factors but also a high variability across the two groups and within each group.</p><p>The preliminary results obtained in this work open the door to other studies needed to fully understand the phenomenon of path instability, its relations with characteristics of the road network, and its potential impact on network efficiency. We believe that instability has strong links with the potential of road networks to generate efficient alternative routings for mobility demand in a city and, thus, to better sustain a heavily loaded traffic infrastructure. This kind of knowledge is expected to be valuable in the process of design of city layout and traffic infrastructures. We plan to pursue this direction, also studying its relations with urban planning aspects and the historical development of cities.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Example of two almost identical origin-destination pairs (green and red markers) that lead to different shortest paths (routes generated by OpenStreetMap).</figDesc><graphic coords="2,155.96,84.19,283.33,159.07" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Geographical areas considered: European capitals (plus Barcelona in red, left) and Municipalities of Tuscany, Italy (right). Municipalities and cities highlighted in yellow correspond to the top highest Path Instability Index values.</figDesc><graphic coords="4,90.04,84.20,224.02,179.17" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Path Instability Index distribution across European Capitals, sorted in descending order by their average Path Instability Index. The highlighted red box plot specifically represents Barcelona, Spain.</figDesc><graphic coords="5,89.29,75.38,416.69,277.04" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Path Instability Index distribution across municipalities in Tuscany, sorted in descending order by their average Path Instability Index, which is also represented through bar colors (cold=low, hot=high).</figDesc><graphic coords="6,89.29,76.48,416.69,276.76" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Relation between trips length (red) and number of visited intersections (green) vs. Path Instability Index (blue).</figDesc><graphic coords="7,104.83,225.10,195.83,85.96" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>geographical distribution of high instability cities in South-Western European areas, particularly those on Correlations (Pearson's coefficients) between Path Instability and various trip and road network features.</figDesc><table><row><cell>Area</cell><cell>trip</cell><cell>trip</cell><cell>num. of</cell><cell>oneway</cell><cell>complex</cell><cell>trip</cell><cell>city</cell><cell>city</cell><cell>city</cell><cell>city</cell></row><row><cell></cell><cell>length</cell><cell>duration</cell><cell>inters.</cell><cell>streets</cell><cell>inters.</cell><cell>turns</cell><cell>inters.</cell><cell>oneways</cell><cell>bridges</cell><cell>bike lanes</cell></row><row><cell>Europe</cell><cell>-0.76</cell><cell>-0.76</cell><cell>-0.35</cell><cell>-0.32</cell><cell>-0.29</cell><cell>-0.33</cell><cell>-0.42</cell><cell>-0.18</cell><cell>-0.35</cell><cell>-0.32</cell></row><row><cell>Tuscany</cell><cell>-0.49</cell><cell>-0.49</cell><cell>0.49</cell><cell>0.52</cell><cell>0.54</cell><cell>0.61</cell><cell>0.27</cell><cell>0.31</cell><cell>0.05</cell><cell>0.32</cell></row><row><cell></cell><cell></cell><cell cols="2">European cities</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell>Tuscany</cell><cell></cell><cell></cell></row><row><cell>PII vs. length</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row><row><cell>PII vs. intersect.</cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell><cell></cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://www.openstreetmap.org/</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Acknowledgments. This work was partially funded by the Horizon Europe research and innovation programme under the funding scheme Green.Dat.AI, G.A. 101070416.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Exploring the relationship between the spatial distribution of roads and universal pattern of travel-route efficiency in urban road networks</title>
		<author>
			<persName><forename type="first">M</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Cheon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S.-W</forename><surname>Son</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Lee</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.chaos.2023.113770</idno>
	</analytic>
	<monogr>
		<title level="j">Chaos, Solitons Fractals</title>
		<imprint>
			<biblScope unit="volume">174</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Modeling urban street patterns</title>
		<author>
			<persName><forename type="first">M</forename><surname>Barthélemy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Flammini</surname></persName>
		</author>
		<idno type="DOI">10.1103/PhysRevLett.100.138702</idno>
		<ptr target="https://link.aps.org/doi/10.1103/PhysRevLett.100.138702.doi:10.1103/PhysRevLett.100.138702" />
	</analytic>
	<monogr>
		<title level="j">Phys. Rev. Lett</title>
		<imprint>
			<biblScope unit="volume">100</biblScope>
			<biblScope unit="page">138702</biblScope>
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<author>
			<persName><forename type="first">L</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Xiao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Deng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Cong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">D</forename><surname>Zhu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zhou</surname></persName>
		</author>
		<idno type="DOI">10.48550/ARXIV.1201.6564</idno>
		<ptr target="https://arxiv.org/abs/1201.6564.doi:10.48550/ARXIV.1201.6564" />
		<title level="m">Shortest path and distance queries on road networks: An experimental evaluation</title>
				<imprint>
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">The effects of route randomization on urban emissions</title>
		<author>
			<persName><forename type="first">G</forename><surname>Cornacchia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nanni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Pedreschi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename></persName>
		</author>
		<idno type="DOI">10.52825/scp.v4i.217</idno>
		<ptr target="https://www.tib-op.org/ojs/index.php/scp/article/view/217.doi:10.52825/scp.v4i.217" />
	</analytic>
	<monogr>
		<title level="j">SUMO Conference Proceedings</title>
		<imprint>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="page" from="75" to="87" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note>Pappalardo</note>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">How bad is selfish routing?</title>
		<author>
			<persName><forename type="first">T</forename><surname>Roughgarden</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Tardos</surname></persName>
		</author>
		<idno type="DOI">10.1145/506147.506153</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of the ACM</title>
		<imprint>
			<biblScope unit="volume">49</biblScope>
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">How routing strategies impact urban emissions</title>
		<author>
			<persName><forename type="first">G</forename><surname>Cornacchia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Böhm</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Mauro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nanni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Pedreschi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pappalardo</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 30th International Conference on Advances in Geographic Information Systems</title>
				<meeting>the 30th International Conference on Advances in Geographic Information Systems</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="1" to="4" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Navigation services and urban sustainability</title>
		<author>
			<persName><forename type="first">G</forename><surname>Cornacchia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nanni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Pedreschi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Fluctuation and Noise Letters</title>
		<imprint>
			<biblScope unit="page">2450016</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note>Pappalardo</note>
</biblStruct>

<biblStruct xml:id="b7">
	<monogr>
		<author>
			<persName><forename type="first">D</forename><surname>Pedreschi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pappalardo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Baeza-Yates</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A.-L</forename><surname>Barabasi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Dignum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Dignum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Eliassi-Rad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Giannotti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kertesz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Knott</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Ioannidis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Lukowicz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Passarella</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">S</forename><surname>Pentland</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Shawe-Taylor</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Vespignani</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2306.13723</idno>
		<title level="m">Social ai and the challenges of the human-ai ecosystem</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Future directions in human mobility science</title>
		<author>
			<persName><forename type="first">L</forename><surname>Pappalardo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Manley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Sekara</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Alessandretti</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Nature computational science</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="588" to="600" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Comparing alternative route planning techniques: A comparative user study on melbourne, dhaka and copenhagen road networks</title>
		<author>
			<persName><forename type="first">L</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Cheema</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ali</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">N</forename><surname>Toosi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Trans. Knowl. Data Eng</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="5552" to="5557" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">On finding dissimilar paths</title>
		<author>
			<persName><forename type="first">V</forename><surname>Akgün</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Erkut</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Batta</surname></persName>
		</author>
		<idno type="DOI">10.1016/S0377-2217(99)00214-3</idno>
		<ptr target="https://doi.org/10.1016/S0377-2217(99)00214-3" />
	</analytic>
	<monogr>
		<title level="j">European Journal of Operational Research</title>
		<imprint>
			<biblScope unit="volume">121</biblScope>
			<biblScope unit="page" from="232" to="246" />
			<date type="published" when="2000">2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Shortest-path diversification through network penalization: A washington dc area case study</title>
		<author>
			<persName><forename type="first">D</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Gkountouna</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Züfle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Pfoser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Wenk</surname></persName>
		</author>
		<idno type="DOI">10.1145/3357000.3366137</idno>
		<ptr target="https://doi.org/10.1145/3357000.3366137" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 12th ACM SIGSPA-TIAL International Workshop on Computational Transportation Science, IWCTS&apos;19</title>
				<meeting>the 12th ACM SIGSPA-TIAL International Workshop on Computational Transportation Science, IWCTS&apos;19<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">V I T</forename><surname>Ltd</surname></persName>
		</author>
		<ptr target="http://www.camvit.com" />
		<title level="m">Choice routing</title>
				<imprint>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Finding k-shortest paths with limited overlap</title>
		<author>
			<persName><forename type="first">T</forename><surname>Chondrogiannis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bouros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Gamper</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Leser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">B</forename><surname>Blumenthal</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00778-020-00604-x</idno>
	</analytic>
	<monogr>
		<title level="j">The VLDB Journal</title>
		<imprint>
			<biblScope unit="volume">29</biblScope>
			<biblScope unit="page" from="1023" to="1047" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Finding k-dissimilar paths with minimum collective length</title>
		<author>
			<persName><forename type="first">T</forename><surname>Chondrogiannis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bouros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Gamper</surname></persName>
		</author>
		<author>
			<persName><forename type="first">U</forename><surname>Leser</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">B</forename><surname>Blumenthal</surname></persName>
		</author>
		<idno type="DOI">10.1145/3274895.3274903</idno>
	</analytic>
	<monogr>
		<title level="m">SIGSPATIAL &apos;18</title>
				<meeting><address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="404" to="407" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Most diverse near-shortest paths</title>
		<author>
			<persName><forename type="first">C</forename><surname>Häcker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Bouros</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Chondrogiannis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Althaus</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">ACM SIGSPA-TIAL GIS</title>
				<imprint>
			<date type="published" when="2021">2021</date>
			<biblScope unit="page" from="229" to="239" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<monogr>
		<title level="m" type="main">Route selection and traffic assignment: A compendium of correspondence relating to a suggested technique</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">E</forename><surname>Campbell</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1950">1950</date>
			<publisher>Highway Research Board</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">One-shot traffic assignment with forward-looking penalization</title>
		<author>
			<persName><forename type="first">G</forename><surname>Cornacchia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nanni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pappalardo</surname></persName>
		</author>
		<idno type="DOI">10.1145/3589132.3625637</idno>
		<idno>doi:10.1145/ 3589132.3625637</idno>
		<ptr target="https://doi.org/10.1145/3589132.3625637" />
	</analytic>
	<monogr>
		<title level="m">SIGSPATIAL &apos;23</title>
				<meeting><address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
