IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v75y2024i1p99-121.html
   My bibliography  Save this article

Stochastic green profit-maximizing hub location problem

Author

Listed:
  • Reza Rahmati
  • Hossein Neghabi
  • Mahdi Bashiri
  • Majid Salari

Abstract

This article proposes a two-stage stochastic profit-maximizing hub location problem (HLP) with uncertain demand. Additionally, the model incorporates several carbon regulations, such as carbon tax policy (CTP), carbon cap-and-trade policy (CCTP), carbon cap policy (CCP), and carbon offset policy (COP). In the proposed models, an enhanced sample average approximation (ESAA) method was used to obtain a suitable number of scenarios. To cluster similar samples, k-means clustering and self-organizing map (SOM) clustering algorithms were embedded in the ESAA. The L-shaped algorithm was employed to solve the model inside the ESAA method more efficiently. The proposed models were analyzed using the well-known Australian Post (AP) data set. Computational experiments showed that all of the carbon regulations could reduce overall carbon emissions. Among carbon policies, CCTP could achieve better economic results for the transportation sector. The results also demonstrated that the SOM clustering algorithm within the ESAA method was superior to both k-means inside ESAA and classical SAA algorithms according to the %gap and standard deviation measures. In addition, the results showed that the L-shaped algorithm performed better than the commercial solver in large-scale instances.

Suggested Citation

  • Reza Rahmati & Hossein Neghabi & Mahdi Bashiri & Majid Salari, 2024. "Stochastic green profit-maximizing hub location problem," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 75(1), pages 99-121, January.
  • Handle: RePEc:taf:tjorxx:v:75:y:2024:i:1:p:99-121
    DOI: 10.1080/01605682.2023.2175734
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2023.2175734
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2023.2175734?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:75:y:2024:i:1:p:99-121. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.