Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model

Seow Lim, Michael Kuby

Research output: Contribution to journalArticle

116 Citations (Scopus)

Abstract

This paper presents three heuristic algorithms that solve for the optimal locations for refueling stations for alternative-fuels, such as hydrogen, ethanol, biodiesel, natural gas, or electricity. The Flow-Refueling Location Model (FRLM) locates refueling stations to maximize the flow that can be refueled with a given number of facilities. The FRLM uses path-based demands, and because of the limitations imposed by the driving range of vehicles, longer paths require combinations of more than one station to refuel round-trip travel. A mixed-integer linear programming (MILP) version of the model has been formulated and published and could be used to obtain an optimal solution. However, because of the need for combinations of stations to satisfy demands, a realistic problem with a moderate size network and a reasonable number of candidate sites would be impractical to generate and solve with MILP methods. In this research, heuristic algorithms-specifically the greedy-adding, greedy-adding with substitution and genetic algorithm-are developed and applied to solve the FRLM problem. These algorithms are shown to be effective and efficient in solving complex FRLM problems. For case study purposes, the heuristic algorithms are applied to locate hydrogen-refueling stations in the state of Florida.

Original languageEnglish (US)
Pages (from-to)51-61
Number of pages11
JournalEuropean Journal of Operational Research
Volume204
Issue number1
DOIs
StatePublished - Jul 1 2010

Fingerprint

Location Model
Alternative fuels
Heuristic algorithms
Heuristic algorithm
Alternatives
Mixed Integer Linear Programming
Linear programming
Hydrogen
Optimal Location
Longest Path
Natural Gas
Ethanol
Biodiesel
Electricity
Substitution
Natural gas
Substitution reactions
Optimal Solution
Genetic algorithms
Maximise

Keywords

  • Combinatorial optimization
  • Genetic algorithms
  • Heuristics
  • Location
  • OR in energy

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Modeling and Simulation
  • Information Systems and Management

Cite this

Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model. / Lim, Seow; Kuby, Michael.

In: European Journal of Operational Research, Vol. 204, No. 1, 01.07.2010, p. 51-61.

Research output: Contribution to journalArticle

@article{50698be4f132431a8d1e6c5856a4c718,
title = "Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model",
abstract = "This paper presents three heuristic algorithms that solve for the optimal locations for refueling stations for alternative-fuels, such as hydrogen, ethanol, biodiesel, natural gas, or electricity. The Flow-Refueling Location Model (FRLM) locates refueling stations to maximize the flow that can be refueled with a given number of facilities. The FRLM uses path-based demands, and because of the limitations imposed by the driving range of vehicles, longer paths require combinations of more than one station to refuel round-trip travel. A mixed-integer linear programming (MILP) version of the model has been formulated and published and could be used to obtain an optimal solution. However, because of the need for combinations of stations to satisfy demands, a realistic problem with a moderate size network and a reasonable number of candidate sites would be impractical to generate and solve with MILP methods. In this research, heuristic algorithms-specifically the greedy-adding, greedy-adding with substitution and genetic algorithm-are developed and applied to solve the FRLM problem. These algorithms are shown to be effective and efficient in solving complex FRLM problems. For case study purposes, the heuristic algorithms are applied to locate hydrogen-refueling stations in the state of Florida.",
keywords = "Combinatorial optimization, Genetic algorithms, Heuristics, Location, OR in energy",
author = "Seow Lim and Michael Kuby",
year = "2010",
month = "7",
day = "1",
doi = "10.1016/j.ejor.2009.09.032",
language = "English (US)",
volume = "204",
pages = "51--61",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model

AU - Lim, Seow

AU - Kuby, Michael

PY - 2010/7/1

Y1 - 2010/7/1

N2 - This paper presents three heuristic algorithms that solve for the optimal locations for refueling stations for alternative-fuels, such as hydrogen, ethanol, biodiesel, natural gas, or electricity. The Flow-Refueling Location Model (FRLM) locates refueling stations to maximize the flow that can be refueled with a given number of facilities. The FRLM uses path-based demands, and because of the limitations imposed by the driving range of vehicles, longer paths require combinations of more than one station to refuel round-trip travel. A mixed-integer linear programming (MILP) version of the model has been formulated and published and could be used to obtain an optimal solution. However, because of the need for combinations of stations to satisfy demands, a realistic problem with a moderate size network and a reasonable number of candidate sites would be impractical to generate and solve with MILP methods. In this research, heuristic algorithms-specifically the greedy-adding, greedy-adding with substitution and genetic algorithm-are developed and applied to solve the FRLM problem. These algorithms are shown to be effective and efficient in solving complex FRLM problems. For case study purposes, the heuristic algorithms are applied to locate hydrogen-refueling stations in the state of Florida.

AB - This paper presents three heuristic algorithms that solve for the optimal locations for refueling stations for alternative-fuels, such as hydrogen, ethanol, biodiesel, natural gas, or electricity. The Flow-Refueling Location Model (FRLM) locates refueling stations to maximize the flow that can be refueled with a given number of facilities. The FRLM uses path-based demands, and because of the limitations imposed by the driving range of vehicles, longer paths require combinations of more than one station to refuel round-trip travel. A mixed-integer linear programming (MILP) version of the model has been formulated and published and could be used to obtain an optimal solution. However, because of the need for combinations of stations to satisfy demands, a realistic problem with a moderate size network and a reasonable number of candidate sites would be impractical to generate and solve with MILP methods. In this research, heuristic algorithms-specifically the greedy-adding, greedy-adding with substitution and genetic algorithm-are developed and applied to solve the FRLM problem. These algorithms are shown to be effective and efficient in solving complex FRLM problems. For case study purposes, the heuristic algorithms are applied to locate hydrogen-refueling stations in the state of Florida.

KW - Combinatorial optimization

KW - Genetic algorithms

KW - Heuristics

KW - Location

KW - OR in energy

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

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

U2 - 10.1016/j.ejor.2009.09.032

DO - 10.1016/j.ejor.2009.09.032

M3 - Article

VL - 204

SP - 51

EP - 61

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -