IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v204y2010i1p51-61.html
   My bibliography  Save this article

Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model

Author

Listed:
  • Lim, Seow
  • Kuby, Michael

Abstract

This paper presents three heuristic algorithms that solve for the optimal locations for refueling stations for alternative-fuels, such as hydrogen, ethanol, biodiesel, natural gas, or electricity. The Flow-Refueling Location Model (FRLM) locates refueling stations to maximize the flow that can be refueled with a given number of facilities. The FRLM uses path-based demands, and because of the limitations imposed by the driving range of vehicles, longer paths require combinations of more than one station to refuel round-trip travel. A mixed-integer linear programming (MILP) version of the model has been formulated and published and could be used to obtain an optimal solution. However, because of the need for combinations of stations to satisfy demands, a realistic problem with a moderate size network and a reasonable number of candidate sites would be impractical to generate and solve with MILP methods. In this research, heuristic algorithms--specifically the greedy-adding, greedy-adding with substitution and genetic algorithm--are developed and applied to solve the FRLM problem. These algorithms are shown to be effective and efficient in solving complex FRLM problems. For case study purposes, the heuristic algorithms are applied to locate hydrogen-refueling stations in the state of Florida.

Suggested Citation

  • Lim, Seow & Kuby, Michael, 2010. "Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model," European Journal of Operational Research, Elsevier, vol. 204(1), pages 51-61, July.
    • Handle: RePEc:eee:ejores:v:204:y:2010:i:1:p:51-61
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00671-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John Hodgson, M. & Rosing, K. E. & Leontien, A. & Storrier, G., 1996. "Applying the flow-capturing location-allocation model to an authentic network: Edmonton, Canada," European Journal of Operational Research, Elsevier, vol. 90(3), pages 427-443, May.
    2. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    3. Michael Kuby & Seow Lim, 2007. "Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs," Networks and Spatial Economics, Springer, vol. 7(2), pages 129-152, June.
    4. David Simchi-Levi & Oded Berman, 1988. "A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks," Operations Research, INFORMS, vol. 36(3), pages 478-484, June.
    5. V. Chvatal, 1979. "A Greedy Heuristic for the Set-Covering Problem," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 233-235, August.
    6. Fernando Chiyoshi & Roberto Galvão, 2000. "A statistical analysis of simulated annealing applied to the p-median problem," Annals of Operations Research, Springer, vol. 96(1), pages 61-74, November.
    7. Osman Alp & Erhan Erkut & Zvi Drezner, 2003. "An Efficient Genetic Algorithm for the p-Median Problem," Annals of Operations Research, Springer, vol. 122(1), pages 21-42, September.
    8. Oded Berman & Richard C. Larson & Nikoletta Fouska, 1992. "Optimal Location of Discretionary Service Facilities," Transportation Science, INFORMS, vol. 26(3), pages 201-211, August.
    9. Kuby, Michael & Lim, Seow, 2005. "The flow-refueling location problem for alternative-fuel vehicles," Socio-Economic Planning Sciences, Elsevier, vol. 39(2), pages 125-145, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. S. A. MirHassani & R. Ebrazi, 2013. "A Flexible Reformulation of the Refueling Station Location Problem," Transportation Science, INFORMS, vol. 47(4), pages 617-628, November.
    2. Marković, Nikola & Ryzhov, Ilya O. & Schonfeld, Paul, 2017. "Evasive flow capture: A multi-period stochastic facility location problem with independent demand," European Journal of Operational Research, Elsevier, vol. 257(2), pages 687-703.
    3. Yıldız, Barış & Arslan, Okan & Karaşan, Oya Ekin, 2016. "A branch and price approach for routing and refueling station location model," European Journal of Operational Research, Elsevier, vol. 248(3), pages 815-826.
    4. Upchurch, Christopher & Kuby, Michael, 2010. "Comparing the p-median and flow-refueling models for locating alternative-fuel stations," Journal of Transport Geography, Elsevier, vol. 18(6), pages 750-758.
    5. Li, Shengyin & Huang, Yongxi, 2014. "Heuristic approaches for the flow-based set covering problem with deviation paths," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 144-158.
    6. Kuby, Michael & Lim, Seow, 2005. "The flow-refueling location problem for alternative-fuel vehicles," Socio-Economic Planning Sciences, Elsevier, vol. 39(2), pages 125-145, June.
    7. Monir Sabbaghtorkan & Rajan Batta & Qing He, 2022. "On the analysis of an idealized model to manage gasoline supplies in a short-notice hurricane evacuation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 911-945, September.
    8. Hwang, Seong Wook & Kweon, Sang Jin & Ventura, Jose A., 2015. "Infrastructure development for alternative fuel vehicles on a highway road system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 170-183.
    9. Tanaka, Ken-ichi & Furuta, Takehiro & Toriumi, Shigeki, 2019. "Railway flow interception location model: Model development and case study of Tokyo metropolitan railway network," Operations Research Perspectives, Elsevier, vol. 6(C).
    10. Michael Kuby & Seow Lim, 2007. "Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs," Networks and Spatial Economics, Springer, vol. 7(2), pages 129-152, June.
    11. Miyagawa, Masashi, 2010. "Distributions of rectilinear deviation distance to visit a facility," European Journal of Operational Research, Elsevier, vol. 205(1), pages 106-112, August.
    12. Mahmutoğulları, Özlem & Yaman, Hande, 2023. "Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty," European Journal of Operational Research, Elsevier, vol. 306(1), pages 173-188.
    13. Nourbakhsh, Seyed Mohammad & Ouyang, Yanfeng, 2010. "Optimal fueling strategies for locomotive fleets in railroad networks," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1104-1114, September.
    14. Weiping Zeng & Ignacio Castillo & M. Hodgson, 2010. "A Generalized Model for Locating Facilities on a Network with Flow-Based Demand," Networks and Spatial Economics, Springer, vol. 10(4), pages 579-611, December.
    15. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    16. Yongxi Huang & Shengyin Li & Zhen Qian, 2015. "Optimal Deployment of Alternative Fueling Stations on Transportation Networks Considering Deviation Paths," Networks and Spatial Economics, Springer, vol. 15(1), pages 183-204, March.
    17. B. Jayalakshmi & Alok Singh, 2017. "A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 67-93, March.
    18. Patrick Jochem & Carsten Brendel & Melanie Reuter-Oppermann & Wolf Fichtner & Stefan Nickel, 2016. "Optimizing the allocation of fast charging infrastructure along the German autobahn," Journal of Business Economics, Springer, vol. 86(5), pages 513-535, July.
    19. Hernandez, Adrian & Ng, Max & Durango-Cohen, Pablo L. & Mahmassani, Hani S., 2024. "Optimizing service networks to support freight rail decarbonization: Flow selection, facility location, and energy sourcing," European Journal of Operational Research, Elsevier, vol. 317(3), pages 906-920.
    20. Oded Berman & Zvi Drezner & Arie Tamir & George Wesolowsky, 2009. "Optimal location with equitable loads," Annals of Operations Research, Springer, vol. 167(1), pages 307-325, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:204:y:2010:i:1:p:51-61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.