Intersection of a continuous 1-location problem on a tree network

Sang Jin Kweon, Seong Wook Hwang, José A. Ventura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


This study develops the methodology that determines the continuous interval of the potential locations for a single alternative-fuel refueling station on a tree network, with an objective of maximizing the amount of traffic flows in round trips per time unit captured by the station, if the assumption that positive traffic flows are required is relaxed. The set consisting of all intersection vertices is constructed to check the feasible locations of the network, and the properties of the intersection vertex are discussed. Based on these properties, the finite dominating set that guarantees the optimal locations either on the intersection vertex or the endpoint of the segment that identifies all feasible candidate sites of a single refueling station is derived. Then it goes through the computational complexity of the methodology and extends the optimal solution to some interior line segment.

Original languageEnglish (US)
Title of host publicationIIE Annual Conference and Expo 2015
PublisherInstitute of Industrial Engineers
Number of pages10
ISBN (Electronic)9780983762447
StatePublished - 2015
EventIIE Annual Conference and Expo 2015 - Nashville, United States
Duration: May 30 2015Jun 2 2015

Publication series

NameIIE Annual Conference and Expo 2015


OtherIIE Annual Conference and Expo 2015
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'Intersection of a continuous 1-location problem on a tree network'. Together they form a unique fingerprint.

Cite this