Hongmou Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hongmou Zhang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Jinhua Zhao
Massachusetts Institute of Technology
4 shared publications Carlo Ratti
2 shared publications- Paolo Santi
Senseable City Lab, Massachusetts Institute of Technology, Cambridge, USA
2 shared publications - Xiaotong Guo
Massachusetts Institute of Technology, Cambridge, MA, USA
2 shared publications - Ao Qu
Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
1 shared publication - Dániel Kondor
Complexity Science Hub, Vienna, Austria
1 shared publication
Latest Publications
- 7 May 2026
- Published by SAGE Publications in Transactions in Urban Data, Science, and Technology
- Vol. 5 (2) , 181-199
Redrawing boundaries for balance: A population-based regional division model
Balancing the span of management across administrative divisions is a persistent challenge in urban and regional spatial governance. This study adapts a spatial optimization model originally developed for electoral districting to partition a given region into contiguous and compact divisions while satisfying explicit balance constraints for a chosen target variable, such as population. The model combines an enumeration–recursion search strategy to generate all feasible divisions with a binary programming problem that minimizes deviations from the target balance. Using population as the illustrative variable, we apply the model to redraw prefecture, urban district, and subdistrict boundaries in three respective cases in China—Anhui Province, the urban area of Chengdu, and Shijingshan District, Beijing—and compare the optimization results with the status quo. The results show substantial reductions in population disparity between divisions relative to existing administrative boundaries, indicating a more balanced distribution of population, and therefore a more equal span of management. The model can be extended to various spatial governance tasks, including school districting, police districting, and infrastructure catchment area planning.
- 7 May 2026
- Published by SAGE Publications in Transactions in Urban Data, Science, and Technology
- Vol. 5 (2) , 181-199
Redrawing boundaries for balance: A population-based regional division model
Balancing the span of management across administrative divisions is a persistent challenge in urban and regional spatial governance. This study adapts a spatial optimization model originally developed for electoral districting to partition a given region into contiguous and compact divisions while satisfying explicit balance constraints for a chosen target variable, such as population. The model combines an enumeration–recursion search strategy to generate all feasible divisions with a binary programming problem that minimizes deviations from the target balance. Using population as the illustrative variable, we apply the model to redraw prefecture, urban district, and subdistrict boundaries in three respective cases in China—Anhui Province, the urban area of Chengdu, and Shijingshan District, Beijing—and compare the optimization results with the status quo. The results show substantial reductions in population disparity between divisions relative to existing administrative boundaries, indicating a more balanced distribution of population, and therefore a more equal span of management. The model can be extended to various spatial governance tasks, including school districting, police districting, and infrastructure catchment area planning.
- 12 March 2026
- Published by Wiley in Geographical Analysis
- Vol. 58 (2)
Massive Retail Location Choice as a Human‐Flow‐Covering Problem
In this article we reframe the massive location choice problem for retail chains by proposing an optimization model that integrates human mobility. Traditional methods of massive location choice encounter limitations rooted in assumptions such as power‐law distance decay and oversimplified travel patterns. In response, we present a spatial operations research model aimed at maximizing customer coverage, using massive individual trajectories as a robust “sampling” of human flows. Using a deduplication‐based greedy algorithm, we maximize customer coverage within a predefined number of stores while maintaining computational efficiency. Through a case study in Shenzhen, China, we demonstrate that our model significantly improves population coverage compared to existing retail locations. Additionally, the optimized coverage follows a power‐law distribution, providing implications for the scaling effects and robustness of retail location potential.
- 12 March 2026
- Published by Wiley in Geographical Analysis
- Vol. 58 (2)
Massive Retail Location Choice as a Human‐Flow‐Covering Problem
In this article we reframe the massive location choice problem for retail chains by proposing an optimization model that integrates human mobility. Traditional methods of massive location choice encounter limitations rooted in assumptions such as power‐law distance decay and oversimplified travel patterns. In response, we present a spatial operations research model aimed at maximizing customer coverage, using massive individual trajectories as a robust “sampling” of human flows. Using a deduplication‐based greedy algorithm, we maximize customer coverage within a predefined number of stores while maintaining computational efficiency. Through a case study in Shenzhen, China, we demonstrate that our model significantly improves population coverage compared to existing retail locations. Additionally, the optimized coverage follows a power‐law distribution, providing implications for the scaling effects and robustness of retail location potential.
- Open Access
- 23 January 2026
- Published by Springer Nature in Computational Urban Science
- Vol. 6 (1)
Reconceptualising regional boundaries: depicting blurred regions in China through individual mobility data
Delineating the boundary or impact area of an economic, cultural, or lifestyle region has been a long-lasting problem in urban and regional geography. The fundamental difficulty lies in the exact definition of a region, and what criteria need to be considered. Existing methods either use criterion-based definitions or network-based measures to evaluate the affiliation of a city to a region. However, both types of methods only give static and definitive results but ignore the dynamism and graduality between regions. In this paper, we propose a Singular Value Decomposition (SVD)-based method to depict the impact areas of regions in China using individual connections among cities. Using the individual mobility data from an online map service, we decompose the mobility patterns of China into a series of eigen-mobility-patterns—each corresponds to the impact area of a city, or a mobility-based region. The overlay of multiple eigen-mobility patterns depicts the “blurred” boundary between the respective regions—or their competing hinterlands. We hope the method could be used to help understand the complexity of drawing regional boundaries and help policymakers to identify the non-confined but blurred economic and cultural landscape of various contexts in regional governance.
- 23 January 2026
- Published by Springer Nature in Computational Urban Science
- Vol. 6 (1)
Open AccessReconceptualising regional boundaries: depicting blurred regions in China through individual mobility data
Delineating the boundary or impact area of an economic, cultural, or lifestyle region has been a long-lasting problem in urban and regional geography. The fundamental difficulty lies in the exact definition of a region, and what criteria need to be considered. Existing methods either use criterion-based definitions or network-based measures to evaluate the affiliation of a city to a region. However, both types of methods only give static and definitive results but ignore the dynamism and graduality between regions. In this paper, we propose a Singular Value Decomposition (SVD)-based method to depict the impact areas of regions in China using individual connections among cities. Using the individual mobility data from an online map service, we decompose the mobility patterns of China into a series of eigen-mobility-patterns—each corresponds to the impact area of a city, or a mobility-based region. The overlay of multiple eigen-mobility patterns depicts the “blurred” boundary between the respective regions—or their competing hinterlands. We hope the method could be used to help understand the complexity of drawing regional boundaries and help policymakers to identify the non-confined but blurred economic and cultural landscape of various contexts in regional governance.
- 29 November 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 183
Assessing the benefits of collaborative ridesharing across transportation network companies
- 29 November 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 183
Assessing the benefits of collaborative ridesharing across transportation network companies
- 9 November 2023
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 157
Dissolving the segmentation of a shared mobility market: A framework and four market structure designs
- 9 November 2023
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 157
Dissolving the segmentation of a shared mobility market: A framework and four market structure designs
- 1 March 2019
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 121, 75-91
Optimizing the deployment of electric vehicle charging stations using pervasive mobility data
- 1 March 2019
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 121, 75-91
Optimizing the deployment of electric vehicle charging stations using pervasive mobility data
- 19 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (8) , 2903-2912
Estimating Savings in Parking Demand Using Shared Vehicles for Home–Work Commuting
- 19 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (8) , 2903-2912
Estimating Savings in Parking Demand Using Shared Vehicles for Home–Work Commuting
- Open Access
- 2 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (7) , 2584-2592
Mobility Sharing as a Preference Matching Problem
Traffic congestion, dominated by single-occupancy vehicles, reflects not only transportation system inefficiency and negative externalities but also a sociological state of human isolation. Advances in information and communication technology are enabling the growth of real-time ridesharing to improve system efficiency. While most ridesharing algorithms optimize fellow passenger matching based on efficiency criteria (maximum number of paired trips, minimum total vehicle-time, or vehicle-distance traveled), very few explicitly consider passengers' preference for their peers as the matching objective. The existing literature either considers the bipartite driver-passenger matching problem, which is structurally different from the monopartite passenger-passenger matching, or only considers the passenger-passenger problem in a simplified one-origin-multiple-destination setting. We formulate a general monopartite passenger matching model in a road network and illustrate the model by pairing 301,430 taxi trips in Manhattan in two scenarios: one considering 1000 randomly generated preference orders and the other considering four sets of group-based preference orders. In both scenarios, compared with efficiency-based matching models, preference-based matching improves the average ranking of paired fellow passenger to the near-top position of people's preference orders with only a small efficiency loss at the individual level and a moderate loss at the aggregate level. The near-top-ranking results fall in a narrow range even with the random variance of passenger preference as inputs.
- 2 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 20 (7) , 2584-2592
Open AccessMobility Sharing as a Preference Matching Problem
Traffic congestion, dominated by single-occupancy vehicles, reflects not only transportation system inefficiency and negative externalities but also a sociological state of human isolation. Advances in information and communication technology are enabling the growth of real-time ridesharing to improve system efficiency. While most ridesharing algorithms optimize fellow passenger matching based on efficiency criteria (maximum number of paired trips, minimum total vehicle-time, or vehicle-distance traveled), very few explicitly consider passengers' preference for their peers as the matching objective. The existing literature either considers the bipartite driver-passenger matching problem, which is structurally different from the monopartite passenger-passenger matching, or only considers the passenger-passenger problem in a simplified one-origin-multiple-destination setting. We formulate a general monopartite passenger matching model in a road network and illustrate the model by pairing 301,430 taxi trips in Manhattan in two scenarios: one considering 1000 randomly generated preference orders and the other considering four sets of group-based preference orders. In both scenarios, compared with efficiency-based matching models, preference-based matching improves the average ranking of paired fellow passenger to the near-top position of people's preference orders with only a small efficiency loss at the individual level and a moderate loss at the aggregate level. The near-top-ranking results fall in a narrow range even with the random variance of passenger preference as inputs.
- Top Cited Papers
- 1 July 2018
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 113, 125-136
Integrating shared autonomous vehicle in public transportation system: A supply-side simulation of the first-mile service in Singapore
- 1 July 2018
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 113, 125-136
Top Cited PapersIntegrating shared autonomous vehicle in public transportation system: A supply-side simulation of the first-mile service in Singapore