The flow-refueling location problem for alternative-fuel vehicles

Michael Kuby, Seow Lim

Research output: Contribution to journalArticle

268 Citations (Scopus)

Abstract

Beginning with Hodgson (Geogr.Anal.22(1990) 270), several researchers have been developing a new kind of location-allocation model for "flow capturing." Instead of locating central facilities to serve demand at fixed points in space, their models aim to serve demand consisting of origin-destination flows along their shortest paths. This paper extends flow-capturing models to optimal location of refueling facilities for alternative-fuel (alt-fuel) vehicles, such as hydrogen fuel cells or natural gas. Existing flow-capturing models assume that if a flow passes just one facility along its path, it is covered. This assumption does not carry over to vehicle refueling because of the limited range of vehicles. For refueling, it may be necessary to stop at more than one facility in order to successfully refuel the entire path, depending on the vehicle range, the path length, and the node spacing. The Flow Refueling Location Model (FRLM) optimally locates p refueling stations on a network so as to maximize the total flow volume refueled. This paper presents a mixed-integer programming formulation for the nodes-only version of the problem, as well as an algorithm for determining all combinations of nodes that can refuel a given path. A greedy-adding approach is demonstrated to be suboptimal, and the tradeoff curve between number of facilities and flow volume refueled is shown to be nonconvex.

Original languageEnglish (US)
Pages (from-to)125-145
Number of pages21
JournalSocio-Economic Planning Sciences
Volume39
Issue number2
DOIs
StatePublished - Jun 2005

Fingerprint

alternative fuel
Location Problem
Alternatives
Path
demand
natural gas
location-allocation model
Vertex of a graph
Location-allocation
Location Model
Optimal Location
programming
Natural Gas
vehicle
Alternative fuel vehicles
Location problem
Fuel Cell
Mixed Integer Programming
Path Length
fuel cell

Keywords

  • Allocation
  • Alt-fuel vehicle
  • Facility location
  • Flow capturing
  • Flow refueling
  • Integer program
  • Network
  • Optimization
  • Shortest path

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Economics and Econometrics

Cite this

The flow-refueling location problem for alternative-fuel vehicles. / Kuby, Michael; Lim, Seow.

In: Socio-Economic Planning Sciences, Vol. 39, No. 2, 06.2005, p. 125-145.

Research output: Contribution to journalArticle

@article{d7ae72487c1a4310883d6e7ffcefad10,
title = "The flow-refueling location problem for alternative-fuel vehicles",
abstract = "Beginning with Hodgson (Geogr.Anal.22(1990) 270), several researchers have been developing a new kind of location-allocation model for {"}flow capturing.{"} Instead of locating central facilities to serve demand at fixed points in space, their models aim to serve demand consisting of origin-destination flows along their shortest paths. This paper extends flow-capturing models to optimal location of refueling facilities for alternative-fuel (alt-fuel) vehicles, such as hydrogen fuel cells or natural gas. Existing flow-capturing models assume that if a flow passes just one facility along its path, it is covered. This assumption does not carry over to vehicle refueling because of the limited range of vehicles. For refueling, it may be necessary to stop at more than one facility in order to successfully refuel the entire path, depending on the vehicle range, the path length, and the node spacing. The Flow Refueling Location Model (FRLM) optimally locates p refueling stations on a network so as to maximize the total flow volume refueled. This paper presents a mixed-integer programming formulation for the nodes-only version of the problem, as well as an algorithm for determining all combinations of nodes that can refuel a given path. A greedy-adding approach is demonstrated to be suboptimal, and the tradeoff curve between number of facilities and flow volume refueled is shown to be nonconvex.",
keywords = "Allocation, Alt-fuel vehicle, Facility location, Flow capturing, Flow refueling, Integer program, Network, Optimization, Shortest path",
author = "Michael Kuby and Seow Lim",
year = "2005",
month = "6",
doi = "10.1016/j.seps.2004.03.001",
language = "English (US)",
volume = "39",
pages = "125--145",
journal = "Socio-Economic Planning Sciences",
issn = "0038-0121",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - The flow-refueling location problem for alternative-fuel vehicles

AU - Kuby, Michael

AU - Lim, Seow

PY - 2005/6

Y1 - 2005/6

N2 - Beginning with Hodgson (Geogr.Anal.22(1990) 270), several researchers have been developing a new kind of location-allocation model for "flow capturing." Instead of locating central facilities to serve demand at fixed points in space, their models aim to serve demand consisting of origin-destination flows along their shortest paths. This paper extends flow-capturing models to optimal location of refueling facilities for alternative-fuel (alt-fuel) vehicles, such as hydrogen fuel cells or natural gas. Existing flow-capturing models assume that if a flow passes just one facility along its path, it is covered. This assumption does not carry over to vehicle refueling because of the limited range of vehicles. For refueling, it may be necessary to stop at more than one facility in order to successfully refuel the entire path, depending on the vehicle range, the path length, and the node spacing. The Flow Refueling Location Model (FRLM) optimally locates p refueling stations on a network so as to maximize the total flow volume refueled. This paper presents a mixed-integer programming formulation for the nodes-only version of the problem, as well as an algorithm for determining all combinations of nodes that can refuel a given path. A greedy-adding approach is demonstrated to be suboptimal, and the tradeoff curve between number of facilities and flow volume refueled is shown to be nonconvex.

AB - Beginning with Hodgson (Geogr.Anal.22(1990) 270), several researchers have been developing a new kind of location-allocation model for "flow capturing." Instead of locating central facilities to serve demand at fixed points in space, their models aim to serve demand consisting of origin-destination flows along their shortest paths. This paper extends flow-capturing models to optimal location of refueling facilities for alternative-fuel (alt-fuel) vehicles, such as hydrogen fuel cells or natural gas. Existing flow-capturing models assume that if a flow passes just one facility along its path, it is covered. This assumption does not carry over to vehicle refueling because of the limited range of vehicles. For refueling, it may be necessary to stop at more than one facility in order to successfully refuel the entire path, depending on the vehicle range, the path length, and the node spacing. The Flow Refueling Location Model (FRLM) optimally locates p refueling stations on a network so as to maximize the total flow volume refueled. This paper presents a mixed-integer programming formulation for the nodes-only version of the problem, as well as an algorithm for determining all combinations of nodes that can refuel a given path. A greedy-adding approach is demonstrated to be suboptimal, and the tradeoff curve between number of facilities and flow volume refueled is shown to be nonconvex.

KW - Allocation

KW - Alt-fuel vehicle

KW - Facility location

KW - Flow capturing

KW - Flow refueling

KW - Integer program

KW - Network

KW - Optimization

KW - Shortest path

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

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

U2 - 10.1016/j.seps.2004.03.001

DO - 10.1016/j.seps.2004.03.001

M3 - Article

VL - 39

SP - 125

EP - 145

JO - Socio-Economic Planning Sciences

JF - Socio-Economic Planning Sciences

SN - 0038-0121

IS - 2

ER -