Yıldız, B.Arslan, O.Karaşan, O. E.2016-02-082016-02-0820160377-2217http://hdl.handle.net/11693/24147The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest path deviation tolerances of the drivers. We first provide an enhanced compact model based on a combination of existing models in the literature for this relatively new operations research problem. We then extend this problem and introduce the refueling station location problem which adds the routing aspect of the individual drivers. Our proposed branch and price algorithm relaxes the simple path assumption generally adopted in the existing studies and implicitly takes into account deviation tolerances without the pregeneration of the routes. Therefore, the decrease in solution times with respect to existing models is significant and our algorithm scales very efficiently to more realistic network dimensions.EnglishAlternative fuel vehiclesBranch and priceCombinatorial optimizationLocationRefueling stationAirshipsAlternative fuelsCombinatorial optimizationCostsLocationOperations researchResearch aircraftAlternative fuel vehiclesBranch and priceBranch-and-price algorithmsCompact modelLocation problemsNetwork dimensionsShortest pathStation locationInteger programmingArticle10.1016/j.ejor.2015.05.0211872-6860