The p-center flow-refueling facility location problem

Cheng-Chang Lin, Chuan Chih Lin

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The p-center flow-refueling facility location problem locates p refueling facilities to minimize the maximum percentage deviation of all drivers. It is a social equity resource allocation model as opposed to a social efficiency p-maximum coverage flow-refueling model. We propose a nonlinear integer program based on link formulation and analyze its relationship with p-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.

Original languageEnglish
Pages (from-to)124-142
Number of pages19
JournalTransportation Research Part B: Methodological
Volume118
DOIs
Publication statusPublished - 2018 Dec 1

Fingerprint

coverage
Resource allocation
equity
driver
efficiency
resources

All Science Journal Classification (ASJC) codes

  • Civil and Structural Engineering
  • Transportation

Cite this

@article{f00bf373baa142eeb079413345bedffa,
title = "The p-center flow-refueling facility location problem",
abstract = "The p-center flow-refueling facility location problem locates p refueling facilities to minimize the maximum percentage deviation of all drivers. It is a social equity resource allocation model as opposed to a social efficiency p-maximum coverage flow-refueling model. We propose a nonlinear integer program based on link formulation and analyze its relationship with p-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.",
author = "Cheng-Chang Lin and Lin, {Chuan Chih}",
year = "2018",
month = "12",
day = "1",
doi = "10.1016/j.trb.2018.10.008",
language = "English",
volume = "118",
pages = "124--142",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

The p-center flow-refueling facility location problem. / Lin, Cheng-Chang; Lin, Chuan Chih.

In: Transportation Research Part B: Methodological, Vol. 118, 01.12.2018, p. 124-142.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The p-center flow-refueling facility location problem

AU - Lin, Cheng-Chang

AU - Lin, Chuan Chih

PY - 2018/12/1

Y1 - 2018/12/1

N2 - The p-center flow-refueling facility location problem locates p refueling facilities to minimize the maximum percentage deviation of all drivers. It is a social equity resource allocation model as opposed to a social efficiency p-maximum coverage flow-refueling model. We propose a nonlinear integer program based on link formulation and analyze its relationship with p-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.

AB - The p-center flow-refueling facility location problem locates p refueling facilities to minimize the maximum percentage deviation of all drivers. It is a social equity resource allocation model as opposed to a social efficiency p-maximum coverage flow-refueling model. We propose a nonlinear integer program based on link formulation and analyze its relationship with p-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.

UR - http://www.scopus.com/inward/record.url?scp=85055647218&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055647218&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2018.10.008

DO - 10.1016/j.trb.2018.10.008

M3 - Article

AN - SCOPUS:85055647218

VL - 118

SP - 124

EP - 142

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -