Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto

• URL: http://arxiv.org/abs/2212.05192v1
• Date: Sat, 10 Dec 2022 03:52:03 GMT
• Title: Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto
• Authors: Weimin Huang, Elias B. Khalil
• Abstract summary: Land zoning and historic under-investment have resulted in walkability and social inequality among residents. We tackle the problem of Walkability Optimization through the lens of spatial- optimization. We derive Mixed-Integer Linear Programming (MILP) and Constraint Programming (CP) models. We conduct a case study on 31 underserved neighborhoods in the City of Toronto, Canada.
• Score: 10.882996403581524
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The concept of walkable urban development has gained increased attention due to its public health, economic, and environmental sustainability benefits. Unfortunately, land zoning and historic under-investment have resulted in spatial inequality in walkability and social inequality among residents. We tackle the problem of Walkability Optimization through the lens of combinatorial optimization. The task is to select locations in which additional amenities (e.g., grocery stores, schools, restaurants) can be allocated to improve resident access via walking while taking into account existing amenities and providing multiple options (e.g., for restaurants). To this end, we derive Mixed-Integer Linear Programming (MILP) and Constraint Programming (CP) models. Moreover, we show that the problem's objective function is submodular in special cases, which motivates an efficient greedy heuristic. We conduct a case study on 31 underserved neighborhoods in the City of Toronto, Canada. MILP finds the best solutions in most scenarios but does not scale well with network size. The greedy algorithm scales well and finds near-optimal solutions. Our empirical evaluation shows that neighbourhoods with low walkability have a great potential for transformation into pedestrian-friendly neighbourhoods by strategically placing new amenities. Allocating 3 additional grocery stores, schools, and restaurants can improve the "WalkScore" by more than 50 points (on a scale of 100) for 4 neighbourhoods and reduce the walking distances to amenities for 75% of all residential locations to 10 minutes for all amenity types. Our code and paper appendix are available at https://github.com/khalil-research/walkability.

Related papers

• Reconsidering utility: unveiling the limitations of synthetic mobility data generation algorithms in real-life scenarios [49.1574468325115]
  We evaluate the utility of five state-of-the-art synthesis approaches in terms of real-world applicability. We focus on so-called trip data that encode fine granular urban movements such as GPS-tracked taxi rides. One model fails to produce data within reasonable time and another generates too many jumps to meet the requirements for map matching.
  arXiv  Detail & Related papers  (2024-07-03T16:08:05Z)
• A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food [29.017017395878597]
  We developed a common algorithmic solution addressing the problem of resource-constrained outreach encountered by social change organizations with different missions and operations. We developed an estimation and optimization approach for partially-observed episodic restless bandits under $k$-step transitions.
  arXiv  Detail & Related papers  (2024-03-15T19:12:28Z)
• Using metaheuristics for the location of bicycle stations [4.2847927405489195]
  We model the problem as the p-median problem, that is a major existing localization problem in optimization. The p-median problem seeks to place a set of facilities (bicycle stations) in a way that minimizes the distance between a set of clients (citizens) and their closest facility (bike station)
  arXiv  Detail & Related papers  (2024-02-06T12:19:46Z)
• Nash Welfare and Facility Location [82.81742334337336]
  We consider the problem of locating a facility to serve a set of agents located along a line. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness and efficiency.
  arXiv  Detail & Related papers  (2023-10-06T09:06:44Z)
• Efficient Quality Diversity Optimization of 3D Buildings through 2D Pre-optimization [101.18253437732933]
  Quality diversity algorithms can be used to create a diverse set of solutions to inform engineers' intuition. But quality diversity is not efficient in very expensive problems, needing 100.000s of evaluations. We show that we can produce better machine learning models by producing training data with quality diversity.
  arXiv  Detail & Related papers  (2023-03-28T11:20:59Z)
• Optimization of the location and design of urban green spaces [3.58439716487063]
  This work showcases the application of classic tools from Operations Research to assist decision-makers to improve parks' accessibility, distribution and design. We present a two-stage fair facility location and design model, which serves as a template model to assist public decision-makers at the city-level for the planning of urban green spaces.
  arXiv  Detail & Related papers  (2023-03-13T15:37:21Z)
• Rearrange Indoor Scenes for Human-Robot Co-Activity [82.22847163761969]
  We present an optimization-based framework for rearranging indoor furniture to accommodate human-robot co-activities better. Our algorithm preserves the functional relations among furniture by integrating spatial and semantic co-occurrence extracted from SUNCG and ConceptNet. Our experiments show that rearranged scenes provide an average of 14% more accessible space and 30% more objects to interact with.
  arXiv  Detail & Related papers  (2023-03-10T03:03:32Z)
• Analysis of public transport (in)accessibility and land-use pattern in different areas in Singapore [0.0]
  We analyse the accessibility to public transport in terms of the spatial coverage of the transport nodes (stops) and the quality of service at these nodes across different areas. We find that the commercial areas in the CBD area expectedly have excellent accessibility and the residential areas also have good to very good accessibility. While the spatial coverage of stops in these areas is very good, the quality of service indicates substantial variation among different regions.
  arXiv  Detail & Related papers  (2022-07-04T14:32:47Z)
• Location-routing Optimisation for Urban Logistics Using Mobile Parcel Locker Based on Hybrid Q-Learning Algorithm [0.0]
  Parcel lockers (MPLs) have been introduced by urban logistics operators as a means to reduce traffic congestion and operational cost. This paper proposes an integer programming model to solve the Location Routing Problem for MPLs.
  arXiv  Detail & Related papers  (2021-10-29T01:27:12Z)
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
  The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
  arXiv  Detail & Related papers  (2021-06-11T09:43:09Z)
• Ridge Rider: Finding Diverse Solutions by Following Eigenvectors of the Hessian [48.61341260604871]
  Gradient Descent (SGD) is a key component of the success of deep neural networks (DNNs) In this paper, we present a different approach by following the eigenvectors of the Hessian, which we call "ridges" We show both theoretically and experimentally that our method, called Ridge Rider (RR), offers a promising direction for a variety of challenging problems.
  arXiv  Detail & Related papers  (2020-11-12T17:15:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.