A branch and price approach for routing and refueling station location model
Karaşan, O. E.
European Journal of Operational Research
815 - 826
Item Usage Stats
MetadataShow full item record
The 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.
KeywordsAlternative fuel vehicles
Branch and price
Alternative fuel vehicles
Branch and price
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.ejor.2015.05.021
Showing items related by title, author, creator and subject.
Yilmaz, Emre; Elbaşı, Sanem; Ferhatosmanoğlu, Hakan (ACM, 2017-08)Deriving meaningful insights from location data helps businesses make better decisions. One critical decision made by a business is choosing a location for its new facility. Optimal location queries ask for a location to ...
Mahmutogullari, A. I.; Kara, B. Y. (Elsevier, 2016)Hubs are consolidation and dissemination points in many-to-many flow networks. Hub location problem is to locate hubs among available nodes and allocate non-hub nodes to these hubs. The mainstream hub location studies ...
Calik, H.; Tansel, B. C. (Elsevier, 2013)We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ...