Traditional location-allocation models aim to locate network facilities to optimally serve demand expressed as weights at nodes. For some types of facilities demand is not expressed at nodes, but as passing network traffic. The flow-capturing location-allocation model responds to this type of demand and seeks to maximize one-time exposure of such traffic to facilities. This new model has previously been investigated only with small and contrived problems. In this paper, we apply the flow-capturing location-allocation model to morning-peak traffic in Edmonton, Canada. We explore the effectiveness of exact, vertex substitution, and greedy solution procedures; the first two are computationally demanding, the greedy is very efficient and extremely robust. We hypothesize that the greedy algorithm's robustness is enhanced by the structured flow present in an authentic urban road network. The flow-capturing model was derived to overcome flow cannibalization, wasteful redundant flow-capturing; we demonstrate that this is an important consideration in an authentic network. We conclude that real-world testing is an important aspect of location model development.

Flow-capturing, Heuristics, Network, Transportation,
European Journal of Operational Research
Tinbergen Institute

Hodgson, M.J, Rosing, K.E, & Storrier, A.L.G. (1996). Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada. European Journal of Operational Research, 90(3), 427–443. doi:10.1016/0377-2217(95)00034-8