An efficient formulation of the flow refueling location model for alternative-fuel stations

Ismail Capar, Michael Kuby

Research output: Contribution to journalArticle

62 Citations (Scopus)

Abstract

The Flow-Refueling Location Model (FRLM) locates a given number of refueling stations on a network to maximize the traffic flow among origin-destination pairs that can be refueled given the driving range of alternative-fuel vehicles. Traditionally, the FRLM has been formulated using a two-stage approach: the first stage generates combinations of locations capable of serving the round trip on each route, and then a mixed-integer programming approach is used to locate p facilities to maximize the flow refueled given the feasible combinations created in the first stage. Unfortunately, generating these combinations can be computationally burdensome and heuristics may be necessary to solve large-scale networks. This article presents a radically different mixed-binaryinteger programming formulation that does not require pre-generation of feasible station combinations. Using several networks of different sizes, it is shown that the proposed model solves the FRLM to optimality as fast as or faster than currently utilized greedy and genetic heuristic algorithms. The ability to solve real-world problems in reasonable time using commercial math programming software offers flexibility for infrastructure providers to customize the FRLM to their particular fuel type and business model, which is demonstrated in the formulation of several FRLM extensions.

Original languageEnglish (US)
Pages (from-to)622-636
Number of pages15
JournalIIE Transactions (Institute of Industrial Engineers)
Volume44
Issue number8
DOIs
StatePublished - Aug 2012

Fingerprint

Alternative fuels
Integer programming
Heuristic algorithms
Genetic algorithms
Industry

Keywords

  • Alternative-fuel vehicles
  • Facility location
  • Flow capturing
  • Mixed-integer programming

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

An efficient formulation of the flow refueling location model for alternative-fuel stations. / Capar, Ismail; Kuby, Michael.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 44, No. 8, 08.2012, p. 622-636.

Research output: Contribution to journalArticle

@article{bcbebbe1cc6c466889545514b123c353,
title = "An efficient formulation of the flow refueling location model for alternative-fuel stations",
abstract = "The Flow-Refueling Location Model (FRLM) locates a given number of refueling stations on a network to maximize the traffic flow among origin-destination pairs that can be refueled given the driving range of alternative-fuel vehicles. Traditionally, the FRLM has been formulated using a two-stage approach: the first stage generates combinations of locations capable of serving the round trip on each route, and then a mixed-integer programming approach is used to locate p facilities to maximize the flow refueled given the feasible combinations created in the first stage. Unfortunately, generating these combinations can be computationally burdensome and heuristics may be necessary to solve large-scale networks. This article presents a radically different mixed-binaryinteger programming formulation that does not require pre-generation of feasible station combinations. Using several networks of different sizes, it is shown that the proposed model solves the FRLM to optimality as fast as or faster than currently utilized greedy and genetic heuristic algorithms. The ability to solve real-world problems in reasonable time using commercial math programming software offers flexibility for infrastructure providers to customize the FRLM to their particular fuel type and business model, which is demonstrated in the formulation of several FRLM extensions.",
keywords = "Alternative-fuel vehicles, Facility location, Flow capturing, Mixed-integer programming",
author = "Ismail Capar and Michael Kuby",
year = "2012",
month = "8",
doi = "10.1080/0740817X.2011.635175",
language = "English (US)",
volume = "44",
pages = "622--636",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "8",

}

TY - JOUR

T1 - An efficient formulation of the flow refueling location model for alternative-fuel stations

AU - Capar, Ismail

AU - Kuby, Michael

PY - 2012/8

Y1 - 2012/8

N2 - The Flow-Refueling Location Model (FRLM) locates a given number of refueling stations on a network to maximize the traffic flow among origin-destination pairs that can be refueled given the driving range of alternative-fuel vehicles. Traditionally, the FRLM has been formulated using a two-stage approach: the first stage generates combinations of locations capable of serving the round trip on each route, and then a mixed-integer programming approach is used to locate p facilities to maximize the flow refueled given the feasible combinations created in the first stage. Unfortunately, generating these combinations can be computationally burdensome and heuristics may be necessary to solve large-scale networks. This article presents a radically different mixed-binaryinteger programming formulation that does not require pre-generation of feasible station combinations. Using several networks of different sizes, it is shown that the proposed model solves the FRLM to optimality as fast as or faster than currently utilized greedy and genetic heuristic algorithms. The ability to solve real-world problems in reasonable time using commercial math programming software offers flexibility for infrastructure providers to customize the FRLM to their particular fuel type and business model, which is demonstrated in the formulation of several FRLM extensions.

AB - The Flow-Refueling Location Model (FRLM) locates a given number of refueling stations on a network to maximize the traffic flow among origin-destination pairs that can be refueled given the driving range of alternative-fuel vehicles. Traditionally, the FRLM has been formulated using a two-stage approach: the first stage generates combinations of locations capable of serving the round trip on each route, and then a mixed-integer programming approach is used to locate p facilities to maximize the flow refueled given the feasible combinations created in the first stage. Unfortunately, generating these combinations can be computationally burdensome and heuristics may be necessary to solve large-scale networks. This article presents a radically different mixed-binaryinteger programming formulation that does not require pre-generation of feasible station combinations. Using several networks of different sizes, it is shown that the proposed model solves the FRLM to optimality as fast as or faster than currently utilized greedy and genetic heuristic algorithms. The ability to solve real-world problems in reasonable time using commercial math programming software offers flexibility for infrastructure providers to customize the FRLM to their particular fuel type and business model, which is demonstrated in the formulation of several FRLM extensions.

KW - Alternative-fuel vehicles

KW - Facility location

KW - Flow capturing

KW - Mixed-integer programming

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

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

U2 - 10.1080/0740817X.2011.635175

DO - 10.1080/0740817X.2011.635175

M3 - Article

AN - SCOPUS:84870940082

VL - 44

SP - 622

EP - 636

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 8

ER -