A polynomial-time algorithm for the continuous single refueling station location problem considering vehicle deviations on a tree network

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

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

Abstract

The purpose of this continuous refueling station location problem is to find the location for a refueling station anywhere along a tree-like transportation network that maximizes the total traffic flow covered. In this paper, we consider a version of the problem that considers vehicle deviations, so that vehicles can branch off from their preplanned simple paths to obtain refueling service. Novel properties regarding vehicle deviations are derived, and a polynomial-time algorithm is developed to identify all vehicle deviations for the continuous single station location problem. A numerical example is solved to illustrate the performance of the proposed algorithm.

Original languageEnglish (US)
Title of host publication67th Annual Conference and Expo of the Institute of Industrial Engineers 2017
EditorsHarriet B. Nembhard, Katie Coperich, Elizabeth Cudney
PublisherInstitute of Industrial Engineers
Pages247-252
Number of pages6
ISBN (Electronic)9780983762461
StatePublished - Jan 1 2017
Event67th Annual Conference and Expo of the Institute of Industrial Engineers 2017 - Pittsburgh, United States
Duration: May 20 2017May 23 2017

Publication series

Name67th Annual Conference and Expo of the Institute of Industrial Engineers 2017

Other

Other67th Annual Conference and Expo of the Institute of Industrial Engineers 2017
Country/TerritoryUnited States
CityPittsburgh
Period5/20/175/23/17

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'A polynomial-time algorithm for the continuous single refueling station location problem considering vehicle deviations on a tree network'. Together they form a unique fingerprint.

Cite this