IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v275y2019i2d10.1007_s10479-018-3014-9.html
   My bibliography  Save this article

The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

Author

Listed:
  • Chandra Ade Irawan

    (Nottingham University Business School China, University of Nottingham Ningbo China)

  • Martino Luis

    (University of Exeter)

  • Said Salhi

    (University of Kent)

  • Arif Imran

    (Institut Teknologi Nasional)

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.

Suggested Citation

  • Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.
  • Handle: RePEc:spr:annopr:v:275:y:2019:i:2:d:10.1007_s10479-018-3014-9
    DOI: 10.1007/s10479-018-3014-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-3014-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-018-3014-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. N Aras & M Orbay & I K Altinel, 2008. "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 64-79, January.
    2. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    3. Trevor Hale & Christopher Moberg, 2003. "Location Science Research: A Review," Annals of Operations Research, Springer, vol. 123(1), pages 21-35, October.
    4. Chen, Chia-Ho & Ting, Ching-Jung, 2008. "Combining Lagrangian heuristic and Ant Colony System to solve the Single Source Capacitated Facility Location Problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(6), pages 1099-1122, November.
    5. J. Brimberg & S. Salhi, 2005. "A Continuous Location-Allocation Problem with Zone-Dependent Fixed Cost," Annals of Operations Research, Springer, vol. 136(1), pages 99-115, April.
    6. Aydin, Nezir & Murat, Alper, 2013. "A swarm intelligence based sample average approximation algorithm for the capacitated reliable facility location problem," International Journal of Production Economics, Elsevier, vol. 145(1), pages 173-183.
    7. J Brimberg & N Mladenovic & S Salhi, 2004. "The multi-source Weber problem with constant opening cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 640-646, June.
    8. Necati Aras & İ. Kuban Altınel & Metin Orbay, 2007. "New heuristic methods for the capacitated multi‐facility Weber problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(1), pages 21-32, February.
    9. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    10. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    11. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.
    12. Guastaroba, G. & Speranza, M.G., 2014. "A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 438-450.
    13. Lin, C.K.Y., 2009. "Stochastic single-source capacitated facility location model with service level requirements," International Journal of Production Economics, Elsevier, vol. 117(2), pages 439-451, February.
    14. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    15. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    16. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.
    17. Isabel Correia & M. Captivo, 2003. "A Lagrangean Heuristic for a Modular Capacitated Location Problem," Annals of Operations Research, Springer, vol. 122(1), pages 141-161, September.
    18. T Drezner & Z Drezner & S Salhi, 2006. "A multi-objective heuristic approach for the casualty collection points location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 727-734, June.
    19. Leon Cooper, 1972. "The Transportation-Location Problem," Operations Research, INFORMS, vol. 20(1), pages 94-108, February.
    20. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    21. M D H Gamal & S Salhi, 2001. "Constructive heuristics for the uncapacitated continuous location-allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(7), pages 821-829, July.
    22. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2010. "Single-assignment hub location problems with multiple capacity levels," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1047-1066, September.
    23. Zainuddin, Z.M. & Salhi, S., 2007. "A perturbation-based heuristic for the capacitated multisource Weber problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1194-1207, June.
    24. Hanif D. Sherali & Frederick L. Nordai, 1988. "NP-Hard, Capacitated, Balanced p -Median Problems on a Chain Graph with a Continuum of Link Demands," Mathematics of Operations Research, INFORMS, vol. 13(1), pages 32-49, February.
    25. Correia, Isabel & Gouveia, Luís & Saldanha-da-Gama, Francisco, 2010. "Discretized formulations for capacitated location problems with modular distribution costs," European Journal of Operational Research, Elsevier, vol. 204(2), pages 237-244, July.
    26. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    2. Ioannis Avgerinos & Ioannis Mourtos & Georgios Zois, 2022. "Multi-type facility location in printing and parcel delivery services," Annals of Operations Research, Springer, vol. 309(1), pages 365-393, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chandra Ade Irawan & Said Salhi & Kusmaningrum Soemadi, 2020. "The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods," Journal of Global Optimization, Springer, vol. 78(2), pages 271-294, October.
    2. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    3. M. Akyüz & İ. Altınel & Temel Öncan, 2014. "Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 222(1), pages 45-71, November.
    4. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    5. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    6. Faiz, Tasnim Ibn & Noor-E-Alam, Md, 2019. "Data center supply chain configuration design: A two-stage decision approach," Socio-Economic Planning Sciences, Elsevier, vol. 66(C), pages 119-135.
    7. Jean-Paul Arnaout & John Khoury, 2022. "Adaptation of WO to the Euclidean location-allocation with unknown number of facilities," Annals of Operations Research, Springer, vol. 315(1), pages 57-72, August.
    8. Sanjay Dominik Jena & Jean-François Cordeau & Bernard Gendron, 2015. "Dynamic Facility Location with Generalized Modular Capacities," Transportation Science, INFORMS, vol. 49(3), pages 484-499, August.
    9. Guastaroba, G. & Speranza, M.G., 2014. "A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 438-450.
    10. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
    11. N Aras & M Orbay & I K Altinel, 2008. "Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 64-79, January.
    12. Ashu Kedia & Diana Kusumastuti & Alan Nicholson, 2019. "Establishing Collection and Delivery Points to Encourage the Use of Active Transport: A Case Study in New Zealand Using a Consumer-Centric Approach," Sustainability, MDPI, vol. 11(22), pages 1-23, November.
    13. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    14. Weninger, Dieter & Wolsey, Laurence A., 2023. "Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing," European Journal of Operational Research, Elsevier, vol. 310(1), pages 84-99.
    15. Liu, Yanchao, 2023. "An elliptical cover problem in drone delivery network design and its solution algorithms," European Journal of Operational Research, Elsevier, vol. 304(3), pages 912-925.
    16. Huizhen Zhang & Cesar Beltran-Royo & Bo Wang & Ziying Zhang, 2019. "Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce," Computational Optimization and Applications, Springer, vol. 72(3), pages 827-848, April.
    17. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    18. Walid Klibi & Francis Lasalle & Alain Martel & Soumia Ichoua, 2010. "The Stochastic Multiperiod Location Transportation Problem," Transportation Science, INFORMS, vol. 44(2), pages 221-237, May.
    19. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2021. "On single-source capacitated facility location with cost and fairness objectives," European Journal of Operational Research, Elsevier, vol. 289(3), pages 959-974.
    20. Yang, Zhen & Chen, Haoxun & Chu, Feng & Wang, Nengmin, 2019. "An effective hybrid approach to the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 275(2), pages 467-480.

    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:spr:annopr:v:275:y:2019:i:2:d:10.1007_s10479-018-3014-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.