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

Mohammad Khalilzadeh, Mahsa Ahmadi and Omid Kebriyaii

SAGE Open, 2025, vol. 15, issue 1, 21582440251324335

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.

Keywords: hub covering location problem; bi-objective mathematical programming model; goal attainment method; meta-heuristic algorithm; multi-objective imperialist competitive algorithm; multi-objective particle swarm optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/21582440251324335 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:sagope:v:15:y:2025:i:1:p:21582440251324335

DOI: 10.1177/21582440251324335

Access Statistics for this article

More articles in SAGE Open
Bibliographic data for series maintained by SAGE Publications ().