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

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.