IJIEPR                   Back to the articles list | Back to browse issues page

XML Print

AN ACCELERATED BENDERS DECOMPOSITION APPROACH FOR THE MULTI-LEVEL MULTI-CAPACITATED FACILITY LOCATION PROBLEM
Khalil ABBAL 1, Mohammed EL AMRANI2 , Youssef BENADADA3
1- Smart Systems Laboratory, ENSIAS, Mohammed V University in Rabat , khalil.abbal@gmail.com
2- ANISSE Research Team, Faculty of sciences, Mohammed V University in Rabat
3- Smart Systems Laboratory, ENSIAS, Mohammed V University in Rabat
Abstract:   (270 Views)
In this paper, we study the Multi-Level Multi-Capacitated Facility Location Problem (ML-MCLP), which was first introduced in 2022 as a double generalization of the Capacitated P-Median Problem (CPMP). The objective of this problem is to determine the optimal facilities to open at each level, and their appropriate capacities to meet customer demands, while minimizing assignment costs. We adopt the Benders Decomposition exact approach, complemented by modern acceleration techniques to enhance convergence speed. The performance of the accelerated BD algorithm is evaluated using a dataset generated based on justified difficulty criteria and data generation methods from the literature. The results showed that hybridization of acceleration techniques, such as subproblem reformulation and cut selection, significantly improves convergence. However, decomposition-based technique proved to be inefficient, particularly due to the structure of the ML-MCLP, and was therefore excluded.
Keywords: Multi-Level, Facility location, Benders decomposition, Acceleration technique, pareto-optimality, Relax-and-Fix
     
Type of Study: Research | Subject: Operations Research
Received: 2024/11/22 | Accepted: 2025/01/1
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.