IDEAS home Printed from https://ideas.repec.org/a/sae/sagope/v15y2025i1p21582440251324335.html
   My bibliography  Save this article

A Bi-Objective Mathematical Programming Model for a Maximal Covering Hub Location Problem Under Uncertainty

Author

Listed:
  • Mohammad Khalilzadeh
  • Mahsa Ahmadi
  • Omid Kebriyaii

Abstract

Properly locating these facilities is a substantial factor in the success of the logistics systems. In this paper, a bi-objective mathematical model for a maximal covering hub location problem is presented to minimize time and environmental risks. The Goal Attainment method was employed to solve the small-sized problems for model validation. Since the problem is NP-Hard, the Multi-Objective Imperialist Competitive Algorithm (MOICA) meta-heuristic algorithm was exploited for solving the medium and large-sized problems. The performance of MOICA was compared with the performance of the Goal Attainment method and the Multi-Objective Particle Swarm Optimization (MOPSO) algorithm to validate the proposed model and solution approach. This paper can direct the logistics companies to reduce the cost, time, and environmental effects of their transportation networks. In addition, this research can optimize energy consumption in the transportation sector for the continuation of low-cost services and reduce fuel consumption, which leads to reducing environmental pollution.

Suggested Citation

  • Mohammad Khalilzadeh & Mahsa Ahmadi & Omid Kebriyaii, 2025. "A Bi-Objective Mathematical Programming Model for a Maximal Covering Hub Location Problem Under Uncertainty," SAGE Open, , vol. 15(1), pages 21582440251, March.
    • Handle: RePEc:sae:sagope:v:15:y:2025:i:1:p:21582440251324335
    DOI: 10.1177/21582440251324335
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/21582440251324335
    Download Restriction: no
    File URL: https://libkey.io/10.1177/21582440251324335?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
    ---><---

    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:sae:sagope:v:15:y:2025:i:1:p:21582440251324335. 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: SAGE Publications (email available below). General contact details of provider: .

    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.