Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities
In this paper, the multi-product facility location problem in a two-stage supply chain is investigated. In this problem, the locations of depots (distribution centres) need to be determined along with their corresponding capacities. Moreover, the product flows from the plants to depots and onto cust...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer New York LLC
2018
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/59780/ |
| _version_ | 1848799674291453952 |
|---|---|
| author | Irawan, Chandra Ade Jones, Dylan |
| author_facet | Irawan, Chandra Ade Jones, Dylan |
| author_sort | Irawan, Chandra Ade |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | In this paper, the multi-product facility location problem in a two-stage supply chain is investigated. In this problem, the locations of depots (distribution centres) need to be determined along with their corresponding capacities. Moreover, the product flows from the plants to depots and onto customers must also be optimised. Here, plants have a production limit whereas potential depots have several possible capacity levels to choose from, which are defined as multilevel capacities. Plants must serve customer demands via depots. Two integer linear programming (ILP) models are introduced to solve the problem in order to minimise the fixed costs of opening depots and transportation costs. In the first model, the depot capacity is based on the maximum number of each product that can be stored whereas in the second one, the capacity is determined by the size (volume) of the depot. For large problems, the models are very difficult to solve using an exact method. Therefore, a matheuristic approach based on an aggregation approach and an exact method (ILP) is proposed in order to solve such problems. The methods are assessed using randomly generated data sets and existing data sets taken from the literature. The solutions obtained from the computational study confirm the effectiveness of the proposed matheuristic approach which outperforms the exact method. In addition, a case study arising from the wind energy sector in the UK is presented. |
| first_indexed | 2025-11-14T20:39:25Z |
| format | Article |
| id | nottingham-59780 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T20:39:25Z |
| publishDate | 2018 |
| publisher | Springer New York LLC |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-597802020-02-28T05:59:26Z https://eprints.nottingham.ac.uk/59780/ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities Irawan, Chandra Ade Jones, Dylan In this paper, the multi-product facility location problem in a two-stage supply chain is investigated. In this problem, the locations of depots (distribution centres) need to be determined along with their corresponding capacities. Moreover, the product flows from the plants to depots and onto customers must also be optimised. Here, plants have a production limit whereas potential depots have several possible capacity levels to choose from, which are defined as multilevel capacities. Plants must serve customer demands via depots. Two integer linear programming (ILP) models are introduced to solve the problem in order to minimise the fixed costs of opening depots and transportation costs. In the first model, the depot capacity is based on the maximum number of each product that can be stored whereas in the second one, the capacity is determined by the size (volume) of the depot. For large problems, the models are very difficult to solve using an exact method. Therefore, a matheuristic approach based on an aggregation approach and an exact method (ILP) is proposed in order to solve such problems. The methods are assessed using randomly generated data sets and existing data sets taken from the literature. The solutions obtained from the computational study confirm the effectiveness of the proposed matheuristic approach which outperforms the exact method. In addition, a case study arising from the wind energy sector in the UK is presented. Springer New York LLC 2018-01-18 Article PeerReviewed application/pdf en cc_by https://eprints.nottingham.ac.uk/59780/2/Formulation%20and%20solution%20of%20a%20two-stage%20capacitated%20facility%20location%20problem%20with%20multilevel%20capacities.pdf Irawan, Chandra Ade and Jones, Dylan (2018) Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities. Annals of Operations Research, 272 (1-2). pp. 41-67. ISSN 0254-5330 Facility location; Matheuristic; ILP http://dx.doi.org/10.1007/s10479-017-2741-7 doi:10.1007/s10479-017-2741-7 doi:10.1007/s10479-017-2741-7 |
| spellingShingle | Facility location; Matheuristic; ILP Irawan, Chandra Ade Jones, Dylan Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| title | Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| title_full | Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| title_fullStr | Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| title_full_unstemmed | Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| title_short | Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| title_sort | formulation and solution of a two-stage capacitated facility location problem with multilevel capacities |
| topic | Facility location; Matheuristic; ILP |
| url | https://eprints.nottingham.ac.uk/59780/ https://eprints.nottingham.ac.uk/59780/ https://eprints.nottingham.ac.uk/59780/ |