The p-center flow-refueling facility location problem

摘要

Thep-center flow-refueling facility location problem locatesprefueling facilities to minimize the maximum percentage deviation of all drivers. It is a social equity resource allocation model as opposed to a social efficiencyp-maximum coverage flow-refueling model. We propose a nonlinear integer program based on link formulation and analyze its relationship withp-maximum coverage and set covering location flow-refueling problems. We develop a link-based implicit enumeration algorithm with an embedded vehicle range-constrained shortest path subproblem to optimally solve the problem. The computational results show that multiple optimal solutions may exist but that they are associated with different total trip distances. In addition, the maximum deviation may not decrease as the vehicle range or the number of refueling facilities marginally increases.