A network transformation heuristic approach for the deviation flow refueling location model

• Published in: Computers & operations research 2013-04, Vol.40 (4), p.1122-1131
• Main Authors: Kim, Jong-Geun, Kuby, Michael
• Format: Article
• Language: English
• Subjects: Algorithms; Applied sciences; Detour; Deviation; Drivers; Energy; Exact sciences and technology; Flows in networks. Combinatorial problems; Heuristic; Heuristics; Location; Location of industry; Mathematical models; Network design; Networks; Operational research and scientific management; Operational research. Management science; Path deviation; Position (location); Refueling; Refueling station; Reliability theory. Replacement problems; Service stations; Shortest path algorithms; Shortest-path problems; Studies; Transformations; Vehicles
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2012.10.021

In the early stages of development, alternative-fuel vehicles will tend to have shorter driving ranges than conventional vehicles, and the availability of stations will be limited. Given these conditions, it is important to consider the willingness of drivers to deviate to some extent from their shortest paths in order to refuel their vehicles and complete their trips. Previously, we proposed the deviation-flow refueling location model (DFRLM) for locating a given number of refueling facilities to maximize the total alternative-fuel vehicle flows that can be refueled by drivers traveling on or deviating from their shortest paths. On a real-world problem, however, the large number of possible deviations from each path and of combinations of facilities that can cover each path would make it extremely difficult to generate and solve the mixed-integer formulation. This paper develops heuristic algorithms for the DFRLM that overcome this difficulty through network transformation. Specifically, a greedy heuristic constructs and edits an artificial feasible network in which each node represents a station, origin, or destination, and each arc represents a feasible path between two nodes given the assumed driving range of vehicles. At each step of the greedy and greedy-substitution algorithms, the feasible network is edited and a shortest path algorithm is run, which determines whether each origin–destination round trip can be completed. This method allows any possible detour to be taken (up to some user-defined maximum) while also ensuring that drivers take the smallest possible detour. Computational experiments on a simple network and a real-world network for Florida show the heuristics to be efficient in solving the problems. Comparisons between the results of the DFRLM and the FRLM indicate that taking driver deviations into account in the model can have a significant effect on the locations chosen and demand covered.