The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
- 105 Downloads
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.
KeywordsDiscrete and continuous capacitated location Opening fixed cost Mathematical formulation Matheuristic VNS
We would like to thank the referees for their interesting suggestions that improved both the content as well as the presentation of the paper. The third author is supported in part by the Spanish Ministry of Economy and Competitiveness Research Project MTM2015-70260-P.
- Aras, N., Yumusak, S., & Altnel, I. K. (2007b). Solving the capacitated multi-facility weber problem by simulated annealing, threshold accepting and genetic algorithms. In K. F. Doerner, P. G. Gendreau, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Progress in complex systems optimization: Metaheuristics (pp. 91–112). Berlin: Springer.Google Scholar
- Brimberg, J., & Mladenović, N. (1996). A variable neighbourhood algorithm for solving the continuous location-allocation problem. Studies of Locational Analysis, 10, 1–12.Google Scholar
- Brimberg, J., Hansen, P., Mladenović, N., & Salhi, S. (2008). A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research, 5, 1–12.Google Scholar
- Eiselt, H. A., & Marianov, V. (Eds.). (2011). Foundations of location analysis (Vol. 155). New York: Springer.Google Scholar
- Gamal, M. D. H., & Salhi, S. (2001). Constructive heuristics for the uncapacitated location-allocation problem. Journal of the Operational Research Society, 51, 1233–1240.Google Scholar