Abstract
In this study we investigate the single source location problem with the presence of several possible capacities and the opening (fixed) cost of a facility that is depended on the capacity used and the area where the facility is located. Mathematical models of the problem for both the discrete and the continuous cases using the Rectilinear and Euclidean distances are produced. Our aim is to find the optimal number of open facilities, their corresponding locations, and their respective capacities alongside the assignment of the customers to the open facilities in order to minimise the total fixed and transportation costs. For relatively large problems, two solution methods are proposed namely an iterative matheuristic approach and VNS-based matheuristic technique. Dataset from the literature is adapted to assess our proposed methods. To assess the performance of the proposed solution methods, the exact method is first applied to small size instances where optimal solutions can be identified or lower and upper bounds can be recorded. Results obtained by the proposed solution methods are also reported for the larger instances.
Original language | English |
---|---|
Pages (from-to) | 367-392 |
Number of pages | 26 |
Journal | Annals of Operations Research |
Volume | 275 |
Issue number | 2 |
DOIs | |
Publication status | Published - 15 Apr 2019 |
Keywords
- Discrete and continuous capacitated location
- Mathematical formulation
- Matheuristic
- Opening fixed cost
- VNS
ASJC Scopus subject areas
- General Decision Sciences
- Management Science and Operations Research