.png){kind=icon}
.png){kind=icon}
Return
Massive Retail Location Choice as a Human-Flow-Covering Problem
.png){kind=icon}
PRE
AI
H
Y
Q
刘
H
DOI：10.1111/gean.70036.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
human mobility
massive location choice
set-covering problem
Shenzhen
Journal
IF:
4.3
Papers:
699
Citations:
4.7K
Organization
Cited Papers