A continuous network location problem for a single refueling station on a tree

Jose Antonio Ventura, Seong Wook Hwang, Sang Jin Kweon

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

This article considers the continuous version of the refueling station location problem on a tree network, which is a common structure in numerous toll roads worldwide, so as to locate a single alternative-fuel refueling station to maximize the traffic flow covered in round trips/day. Two reduction properties regarding the problem size and some optimality conditions are derived. Based on these conditions, an exact polynomial algorithm is developed to determine the set of optimal locations for the refueling station. A small tree network example is solved to illustrate the algorithm.

Original languageEnglish (US)
Pages (from-to)257-265
Number of pages9
JournalComputers and Operations Research
Volume62
DOIs
StatePublished - Jul 28 2015

Fingerprint

Tree Networks
Location Problem
Toll highways
Optimal Location
Alternative fuels
Polynomial Algorithm
Exact Algorithms
Optimality Conditions
Traffic Flow
Maximise
Polynomials
Alternatives
Location problem
Roads
Traffic flow
Optimality conditions

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Cite this

@article{7a25307344704a32af88ba4632e825ca,
title = "A continuous network location problem for a single refueling station on a tree",
abstract = "This article considers the continuous version of the refueling station location problem on a tree network, which is a common structure in numerous toll roads worldwide, so as to locate a single alternative-fuel refueling station to maximize the traffic flow covered in round trips/day. Two reduction properties regarding the problem size and some optimality conditions are derived. Based on these conditions, an exact polynomial algorithm is developed to determine the set of optimal locations for the refueling station. A small tree network example is solved to illustrate the algorithm.",
author = "Ventura, {Jose Antonio} and Hwang, {Seong Wook} and Kweon, {Sang Jin}",
year = "2015",
month = "7",
day = "28",
doi = "10.1016/j.cor.2014.07.017",
language = "English (US)",
volume = "62",
pages = "257--265",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

A continuous network location problem for a single refueling station on a tree. / Ventura, Jose Antonio; Hwang, Seong Wook; Kweon, Sang Jin.

In: Computers and Operations Research, Vol. 62, 28.07.2015, p. 257-265.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A continuous network location problem for a single refueling station on a tree

AU - Ventura, Jose Antonio

AU - Hwang, Seong Wook

AU - Kweon, Sang Jin

PY - 2015/7/28

Y1 - 2015/7/28

N2 - This article considers the continuous version of the refueling station location problem on a tree network, which is a common structure in numerous toll roads worldwide, so as to locate a single alternative-fuel refueling station to maximize the traffic flow covered in round trips/day. Two reduction properties regarding the problem size and some optimality conditions are derived. Based on these conditions, an exact polynomial algorithm is developed to determine the set of optimal locations for the refueling station. A small tree network example is solved to illustrate the algorithm.

AB - This article considers the continuous version of the refueling station location problem on a tree network, which is a common structure in numerous toll roads worldwide, so as to locate a single alternative-fuel refueling station to maximize the traffic flow covered in round trips/day. Two reduction properties regarding the problem size and some optimality conditions are derived. Based on these conditions, an exact polynomial algorithm is developed to determine the set of optimal locations for the refueling station. A small tree network example is solved to illustrate the algorithm.

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

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

U2 - 10.1016/j.cor.2014.07.017

DO - 10.1016/j.cor.2014.07.017

M3 - Article

VL - 62

SP - 257

EP - 265

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -