We consider the continuous version of the refueling station location problem on a tree network to maximize the traffic flow covered in round‐trips/day.
Two reduction properties regarding the problem size and some optimality conditions are derived.
A 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.
