Multi-Objective Optimization for Green BTS Site Selection in Telecommunication Networks Using NSGA-II and MOPSO
Today, facility location planning primarily pertains to the long-term strategic and operational decision-making of large public and private organizations, and the significant costs associated with facility location, construction, and operation have turned location research into long-term decision-ma...
Saved in:
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-01-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/18/1/9 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Today, facility location planning primarily pertains to the long-term strategic and operational decision-making of large public and private organizations, and the significant costs associated with facility location, construction, and operation have turned location research into long-term decision-making. Presenting a hub location model for the green supply chain can address the current status of facilities and significantly improve demand coverage at an acceptable cost. Therefore, in this study, a network of facilities for hub location in the service site domain, considering existing and potential facilities under probable scenarios, has been proposed. After presenting the mathematical model, validation was performed on a small scale, followed by sensitivity analysis of the main parameters of the model. Furthermore, a metaheuristic algorithm was employed to analyze the NP-Hardness of the model. Additionally, two metaheuristic algorithms, NSGAII and MOPSO, were developed to demonstrate the efficiency of the model. Based on the conducted analysis, it can be observed that the computational time increases exponentially with the size of sample problems, indicating the NP-Hardness of the problem. However, the NSGAII algorithm performs better in terms of computational time for medium-sized problems compared to the MOPSO algorithm. These algorithms were chosen due to their proven efficiency in handling NP-hard optimization problems and their ability to balance exploration and exploitation in search spaces. |
---|---|
ISSN: | 1999-4893 |