MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Community detection on urban street networks : a segmentation model for urban logistics policy and planning

Author(s)
Wilson, Margaret Olivia.
Thumbnail
Download1129597909-MIT.pdf (10.25Mb)
Other Contributors
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering.
Advisor
Matthias Winkenbach and Yossi Sheffi.
Terms of use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
This thesis considers the community detection methods employed by network studies in a wide variety of contexts and adapts their use to the segmentation of an urban street network. In order to form partitions of urban street networks that are manageable as delivery territories or similar units of spatial aggregation, e.g., discrete demand zones, to be used in a study of urban freight distribution, extant community detection methods are assessed and adapted. Numerical experiments demonstrate that the sub-networks formed by these partitions display travel properties that make them a useful model for logistics transportation, especially in contexts where continuum approximation methods might be employed. The ratio of simulated trip distances over the actual road network to the idealized distance between the trip endpoints is used as a metric to quantify some travel properties of these segments.
 
This ratio describes the magnitude of detour required by network conditions, which can offer a proxy for travel efficiency due to road network variations across a city. Using this metric, network-based partitioning algorithms are shown to produce sub-networks with internal travel conditions that are on average more efficient and less variable than sub-networks produced from extant methods of urban segmentation. This result is demonstrated on a wide variety of test networks in cities worldwide. In addition, a secondary use case as a decision-support tool for policymakers is proposed. Since this algorithm creates areas with a flexible spatial resolution in which boundaries are defined by infrastructure and geography, it may constitute a useful way to delineate areas where policy interventions should be employed.
 
Because the impact and presence of freight traffic vary with local land uses (e.g., commercial, residential, industrial), the land use characteristics of these segments are also investigated to determine if network-based segmentation models capture more variation in land use characteristics than alternative methods.
 
Description
Thesis: S.M. in Transportation, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2019
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 81-86).
 
Date issued
2019
URI
https://hdl.handle.net/1721.1/123238
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Publisher
Massachusetts Institute of Technology
Keywords
Civil and Environmental Engineering.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.