IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i1d10.1057_palgrave.jors.2602262.html
   My bibliography  Save this article

Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem

Author

Listed:
  • N Aras

    (Boğaziçi University)

  • M Orbay

    (Casual Male Retail Group Inc.)

  • I K Altinel

    (Boğaziçi University)

Abstract

In this paper, we consider the capacitated multi-facility Weber problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the rectilinear distance separating them. We first give a new mixed integer linear programming formulation of the problem by making use of a well-known necessary condition for the optimal facility locations. We then propose new heuristic solution methods based on this formulation. Computational results on benchmark instances indicate that the new methods can provide very good solutions within a reasonable amount of computation time.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:1:d:10.1057_palgrave.jors.2602262
    DOI: 10.1057/palgrave.jors.2602262
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602262
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602262?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. Leon Cooper, 1972. "The Transportation-Location Problem," Operations Research, INFORMS, vol. 20(1), pages 94-108, February.
    2. Hanif D. Sherali & Intesar Al-Loughani & Shivaram Subramanian, 2002. "Global Optimization Procedures for the Capacitated Euclidean and l p Distance Multifacility Location-Allocation Problems," Operations Research, INFORMS, vol. 50(3), pages 433-448, June.
    3. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    4. Richard E. Wendell & Arthur P. Hurter, 1973. "Location Theory, Dominance, and Convexity," Operations Research, INFORMS, vol. 21(1), pages 314-320, February.
    5. P. Hansen & J. Perreur & J.-F. Thisse, 1980. "Technical Note—Location Theory, Dominance, and Convexity: Some Further Results," Operations Research, INFORMS, vol. 28(5), pages 1241-1250, October.
    6. 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.
    7. 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.
    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. Miyagawa, Masashi, 2010. "Distributions of rectilinear deviation distance to visit a facility," European Journal of Operational Research, Elsevier, vol. 205(1), pages 106-112, August.
    2. 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.
    3. 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.
    4. 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.
    5. Masashi Miyagawa, 2012. "Joint distribution of distances to the first and the second nearest facilities," Journal of Geographical Systems, Springer, vol. 14(2), pages 209-222, April.
    6. 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.

    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. 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.
    2. 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.
    3. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.
    4. 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.
    5. Cristiana L. Lara & Francisco Trespalacios & Ignacio E. Grossmann, 2018. "Global optimization algorithm for capacitated multi-facility continuous location-allocation problems," Journal of Global Optimization, Springer, vol. 71(4), pages 871-889, August.
    6. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Valentin Hartmann & Dominic Schuhmacher, 2020. "Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 133-163, August.
    12. E. Carrizosa & J. B. G. Frenk, 1998. "Dominating Sets for Convex Functions with Some Applications," Journal of Optimization Theory and Applications, Springer, vol. 96(2), pages 281-295, February.
    13. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2021. "Directional approach to gradual cover: the continuous case," Computational Management Science, Springer, vol. 18(1), pages 25-47, January.
    14. G. Wanka, 2000. "Multiobjective Control Approximation Problems: Duality and Optimality," Journal of Optimization Theory and Applications, Springer, vol. 105(2), pages 457-475, May.
    15. N Aras & K C Özkısacık & İ K Altınel, 2006. "Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 82-93, January.
    16. Roland Rathelot & Patrick Sillard, 2008. "The Importance of Local Corporate Taxes in Business Location Decisions: Evidence From French Micro Data," Economic Journal, Royal Economic Society, vol. 118(527), pages 499-514, March.
    17. Hanif D. Sherali & Intesar Al-Loughani & Shivaram Subramanian, 2002. "Global Optimization Procedures for the Capacitated Euclidean and l p Distance Multifacility Location-Allocation Problems," Operations Research, INFORMS, vol. 50(3), pages 433-448, June.
    18. Gökhan Altay & M. Hakan Akyüz & Temel Öncan, 2023. "Solving a minisum single facility location problem in three regions with different norms," Annals of Operations Research, Springer, vol. 321(1), pages 1-37, February.
    19. Tammy Drezner & Zvi Drezner, 2019. "Cooperative Cover of Uniform Demand," Networks and Spatial Economics, Springer, vol. 19(3), pages 819-831, September.
    20. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.

    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:pal:jorsoc:v:59:y:2008:i:1:d:10.1057_palgrave.jors.2602262. 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.palgrave-journals.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.