Author
Listed:
- Mohammad Yavari
- Mohammad Mousavi-Saleh
- Armin Jabbarzadeh
Abstract
Purpose - A multi-objective mixed-integer linear program (MILP) model is developed to address this problem. The primary objective is to minimize the total restructuring cost, while the secondary objective aims to enhance the customer service level. To tackle the NP-hard nature of the problem, the non-dominated sorted genetic algorithm (NSGA-II) and a hybrid NSGA-II with the ɛ-constraint method are employed. The hybrid method combines the strengths of the ɛ-constraint method with NSGA-II. Various performance metrics, including the number of Pareto solutions (NPS), normalized set coverage and spacing metrics, are utilized to compare the characteristics of the non-dominated fronts obtained by NSGA-II and the hybrid methods. Design/methodology/approach - The Restructuring Facility Location Problem involves the closure, resizing or opening of a group of facilities and the assignment of customers to these selected facilities. The objective is to provide the required service to customers while minimizing the overall restructuring costs. This paper introduces a novel multi-objective model for hierarchical facilities called the Multi-Objective Restructuring Hierarchical Facility Location Problem (MO-RHFLP). The model specifically includes primary- and secondary-level facilities, with the primary facility offering broad coverage. In MO-RHFLP, customers within the coverage range of the primary facility can receive service from there. Findings - The results demonstrate that the NSGA-II-based method performs well in terms of normalized set coverage and spacing metrics. However, the hybrid method outperforms NSGA-II in these aspects. Additionally, the hybrid method achieves a mutation in the NPS metric. Originality/value - The present study, from three perspectives, has continued the way of the previous studies in restructuring channels. First, the multi-objective problem of restructuring the bi-level network executed in this study contains both levels of the network opening, closing and resizing. Taking a different perspective, the MO-RHFLP problem is introduced through the formulation of a multi-objective MILP model. This model serves as a framework for addressing the MO-RHFLP. By developing the hybrid ɛ-constraint method with NSGA-II, we solve the proposed problem.
Suggested Citation
Mohammad Yavari & Mohammad Mousavi-Saleh & Armin Jabbarzadeh, 2024.
"A novel hybrid epsilon-constraint and NSGA-II method for bi-objective restructuring hierarchical facility location problem,"
Journal of Advances in Management Research, Emerald Group Publishing Limited, vol. 22(2), pages 183-218, September.
Handle:
RePEc:eme:jamrpp:jamr-12-2023-0364
DOI: 10.1108/JAMR-12-2023-0364
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
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:eme:jamrpp:jamr-12-2023-0364. 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: Emerald Support (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.