Topological evolution of surface transportation networks

Xie, Feng; Levinson, David

doi:10.1016/j.compenvurbsys.2008.09.009

Cited by 93 publications

(59 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, entropy calculations have been used to model the evolution of river channels [10], transportation and trip distributions (using maximum entropy methods) [11,12], to assess city heterogeneity [13,14], to quantify urban sprawls [15][16][17], and as a part of "spatial entropy" measures [18]. The entropy approach used in the present paper, however, is somewhat different from those above.…”

Section: Introductionmentioning

confidence: 95%

Entropy Measures of Street-Network Dispersion: Analysis of Coastal Cities in Brazil and Britain

Mohajeri

French

Guðmundsson

2013

Entropy

View full text Add to dashboard Cite

Geographical location and landforms of various types have strong effects on the developments of many cities and associated street networks. This study presents new results of landform effects, in particular the geometry of shorelines, on the grid street networks (a total of 10,442 streets) of three Brazilian coastal cities. The results are compared with the street networks of three coastal cities in Britain (a total of 22,002 streets) that have evolved through a more natural "bottom-up" process. Gibbs/Shannon entropy (a measure of dispersion) generally has a positive linear correlation with length ranges and the average lengths of the street, and for the power-law tails in particular. The geometry of the adjacent shorelines has great effect on the spatial orientation of streets in the Brazilian cities but less so for the networks of the British cities. More specifically, the more curved the shoreline, the greater is the dispersion in the street orientation and the greater the associated entropy. The results also show that the length-entropies of the outer parts of the Brazilian cities are generally lower than those of the inner parts, whereas the entropies of outer parts of the British cities are higher than those of the inner parts, indicating dispersion during streetnetwork growth in the British cities.

show abstract

Section: Introductionmentioning

confidence: 95%

Entropy Measures of Street-Network Dispersion: Analysis of Coastal Cities in Brazil and Britain

Mohajeri

French

Guðmundsson

2013

Entropy

View full text Add to dashboard Cite

show abstract

“…In that context, the main advantages following the regular structure of supply network layout are the flexibility and robustness that are vital to the improvement of robustness of supply networks (Haghani and Oh, 1996;Susan, 2014). More exhaustive studies, respectively, concerning mesh-like or grid-like as well as fractal-like structures of urban transportation networks, can be found in the papers (Buhl et al, 2006;Xie and Levinson, 2009;. Among many others the following findings showing "that grids' greater connectivity offers shorter trips, trip frequency may be expected" (Stead and Marshall, 2001) and that "fractal geometry could be of interest for reducing negative impacts of urban sprawl" motivate this work, too.…”

Section: Grid-like Supply Networkmentioning

confidence: 99%

Traffic flow routing and scheduling in a food supply network

Bocewicz

Janardhanan

Krenczyk

et al. 2017

IMDS

View full text Add to dashboard Cite

If you would like to write for this, or any other Emerald publication, then please use our Emerald for Authors service information about how to choose which publication to write for and submission guidelines are available for all. Please visit www.emeraldinsight.com/authors for more information. About Emerald www.emeraldinsight.comEmerald is a global publisher linking research and practice to the benefit of society. The company manages a portfolio of more than 290 journals and over 2,350 books and book series volumes, as well as providing an extensive range of online products and additional customer resources and services.Emerald is both COUNTER 4 and TRANSFER compliant. The organization is a partner of the Committee on Publication Ethics (COPE) and also works with Portico and the LOCKSS initiative for digital archive preservation. Purpose -The purpose of this paper is to focus on the reference model of a grid-like supply network that enables formulation of delivery routing and scheduling problems in the context of the periodic vehicle routing problem. Design/methodology/approach -The conditions for seamless (collision-free) synchronization of periodically executed local transport processes presented in this paper guarantee cyclic execution of supply processes, thereby preventing traffic flow congestion. Findings -Systems that satisfy this characteristic, cyclic deliveries executed along supply chains are given and what is sought is the number of vehicles needed to operate the local transport processes in order to ensure delivery from and to specific loading/unloading points on given dates. Determination of sufficient conditions guaranteeing the existence of feasible solutions that satisfy these constraints makes it possible to solve the considered class of problems online. Practical implications -The computer experiments reported in this paper show the possibilities of practical application of the proposed approach in the construction of decision support systems for food supply chain management. Originality/value -The aim of the present work is to develop a methodology for the synthesis of regularly structured supply networks that would ensure fixed cyclic execution of local transport processes. The proposed methodology, which implements sufficient conditions for the synchronization of local cyclic processes, allows one to develop a method for rapid prototyping of supply processes that satisfies the time windows constraints given.

show abstract

“…3) approximate road networks with many intersections and potential routes from one side of the network to the other (Xie and Levinson [44]). Their design corresponds to that used in [12] and [15], although neither of these papers specifies placement and orientation of diversion edges.…”

Section: Structured Test Networkmentioning

confidence: 99%

Theoretical and computational advances for network diversion

2013

View full text Add to dashboard Cite

The network-diversion problem (ND) is defined on a directed or undirected graph G = (V , E ) having nonnegative edge weights, a source vertex s, a sink vertex t , and a "diversion edge" e . This problem, with intelligence-gathering and war-fighting applications, seeks a minimum-weight, minimal s-t cut E C ⊆ E in G such that e ∈ E C . We present (a) a new NP-completeness proof for ND on directed graphs, (b) the first polynomialtime solution algorithm for a special graph topology, (c) an improved mixed-integer programming formulation (MIP), and (d) useful valid inequalities for that MIP. The proof strengthens known results by showing, for instance, that ND is strongly NP-complete on a directed graph even when e is incident from s or into t , but not both, and even when G is acyclic; a corollary shows the NP-completeness of a vertex-deletion version of ND on undirected graphs. The polynomial-time algorithm solves ND on s-t planar graphs. Compared to a MIP from the literature, the new MIP, coupled with valid inequalities, reduces the average duality gap by 10-50% on certain classes of test problems. It can also reduce solution times by an order of magnitude. We successfully solve unweighted problems with roughly 90,000 vertices and 360,000 edges and weighted problems with roughly 10,000 vertices and 40,000 edges.

show abstract

Topological evolution of surface transportation networks

Cited by 93 publications

References 32 publications

Entropy Measures of Street-Network Dispersion: Analysis of Coastal Cities in Brazil and Britain

Entropy Measures of Street-Network Dispersion: Analysis of Coastal Cities in Brazil and Britain

Traffic flow routing and scheduling in a food supply network

Theoretical and computational advances for network diversion

Contact Info

Product

Resources

About