### Abstract

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 language | English (US) |
---|---|

Title of host publication | IIE Annual Conference and Expo 2015 |

Publisher | Institute of Industrial Engineers |

Pages | 1399-1408 |

Number of pages | 10 |

ISBN (Electronic) | 9780983762447 |

State | Published - Jan 1 2015 |

Event | IIE Annual Conference and Expo 2015 - Nashville, United States Duration: May 30 2015 → Jun 2 2015 |

### Publication series

Name | IIE Annual Conference and Expo 2015 |
---|

### Other

Other | IIE Annual Conference and Expo 2015 |
---|---|

Country | United States |

City | Nashville |

Period | 5/30/15 → 6/2/15 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Industrial and Manufacturing Engineering

### Cite this

*IIE Annual Conference and Expo 2015*(pp. 1399-1408). (IIE Annual Conference and Expo 2015). Institute of Industrial Engineers.

}

*IIE Annual Conference and Expo 2015.*IIE Annual Conference and Expo 2015, Institute of Industrial Engineers, pp. 1399-1408, IIE Annual Conference and Expo 2015, Nashville, United States, 5/30/15.

**Intersection of a continuous 1-location problem on a tree network.** / Kweon, Sang Jin; Hwang, Seong Wook; Ventura, Jose Antonio.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Kweon, Sang Jin

AU - Hwang, Seong Wook

AU - Ventura, Jose Antonio

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

T3 - IIE Annual Conference and Expo 2015

SP - 1399

EP - 1408

BT - IIE Annual Conference and Expo 2015

PB - Institute of Industrial Engineers

ER -