IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v67y2016i8d10.1057_jors.2016.5.html
   My bibliography  Save this article

A modelling framework for solving restricted planar location problems using phi-objects

Author

Listed:
  • Murat Oğuz

    (University of Southampton)

  • Tolga Bektaş

    (University of Southampton)

  • Julia A Bennell

    (University of Southampton)

  • Jörg Fliege

    (University of Southampton)

Abstract

This paper presents a general modelling framework for restricted facility location problems with arbitrarily shaped forbidden regions or barriers, where regions are modelled using phi-objects. Phi-objects are an efficient tool in mathematical modelling of 2D and 3D geometric optimization problems, and are widely used in cutting and packing problems and covering problems. The paper shows that the proposed modelling framework can be applied to both median and centre facility location problems, either with barriers or forbidden regions. The resulting models are either mixed-integer linear or non-linear programming formulations, depending on the shape of the restricted region and the considered distance measure. Using the new framework, all instances from the existing literature for this class of problems are solved to optimality. The paper also introduces and optimally solves a realistic multi-facility problem instance derived from an archipelago vulnerable to earthquakes. This problem instance is significantly more complex than any other instance described in the literature.

Suggested Citation

  • Murat Oğuz & Tolga Bektaş & Julia A Bennell & Jörg Fliege, 2016. "A modelling framework for solving restricted planar location problems using phi-objects," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1080-1096, August.
    • Handle: RePEc:pal:jorsoc:v:67:y:2016:i:8:d:10.1057_jors.2016.5
    DOI: 10.1057/jors.2016.5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2016.5
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2016.5?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. Sarkar, Avijit & Batta, Rajan & Nagi, Rakesh, 2004. "Commentary on facility location in the presence of congested regions with the rectilinear distance metric," Socio-Economic Planning Sciences, Elsevier, vol. 38(4), pages 291-306, December.
    2. Katz, I. Norman & Cooper, Leon, 1981. "Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle," European Journal of Operational Research, Elsevier, vol. 6(2), pages 166-173, February.
    3. Hamacher, H. W. & Nickel, S., 1994. "Combinatorial algorithms for some 1-facility median problems in the plane," European Journal of Operational Research, Elsevier, vol. 79(2), pages 340-351, December.
    4. Canbolat, Mustafa S. & Wesolowsky, George O., 2010. "The rectilinear distance Weber problem in the presence of a probabilistic line barrier," European Journal of Operational Research, Elsevier, vol. 202(1), pages 114-121, April.
    5. Butt, Steven E. & Cavalier, Tom M., 1997. "Facility location in the presence of congested regions with the rectilinear distance metric," Socio-Economic Planning Sciences, Elsevier, vol. 31(2), pages 103-113, June.
    6. Y. P. Aneja & M. Parlar, 1994. "Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel," Transportation Science, INFORMS, vol. 28(1), pages 70-76, February.
    7. Bischoff, M. & Klamroth, K., 2007. "An efficient solution method for Weber problems with barriers based on genetic algorithms," European Journal of Operational Research, Elsevier, vol. 177(1), pages 22-41, February.
    8. Rajan Batta & Anjan Ghose & Udatta S. Palekar, 1989. "Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions," Transportation Science, INFORMS, vol. 23(1), pages 26-36, February.
    9. Klamroth, K., 2004. "Algebraic properties of location problems with one circular barrier," European Journal of Operational Research, Elsevier, vol. 154(1), pages 20-35, April.
    10. Dasci, Abdullah & Verter, Vedat, 2001. "A continuous model for production-distribution system design," European Journal of Operational Research, Elsevier, vol. 129(2), pages 287-298, March.
    11. Foulds, L. R. & Hamacher, H. W., 1993. "Optimal bin location and sequencing in printed circuit board assembly," European Journal of Operational Research, Elsevier, vol. 66(3), pages 279-290, May.
    12. Butt, Steven E. & Cavalier, Tom M., 1996. "An efficient algorithm for facility location in the presence of forbidden regions," European Journal of Operational Research, Elsevier, vol. 90(1), pages 56-70, April.
    13. Horst Hamacher & Kathrin Klamroth, 2000. "Planar Weber location problems with barriers and block norms," Annals of Operations Research, Springer, vol. 96(1), pages 191-208, November.
    14. J. Bennell & G. Scheithauer & Y. Stoyan & T. Romanova, 2010. "Tools of mathematical modeling of arbitrary object packing problems," Annals of Operations Research, Springer, vol. 179(1), pages 343-368, September.
    15. Klamroth, K., 2001. "A reduction result for location problems with polyhedral barriers," European Journal of Operational Research, Elsevier, vol. 130(3), pages 486-497, May.
    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. Andrea Maier & Horst W. Hamacher, 2019. "Complexity results on planar multifacility location problems with forbidden regions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 433-484, June.
    2. Farahani, Reza Zanjirani & Fallah, Samira & Ruiz, Rubén & Hosseini, Sara & Asgari, Nasrin, 2019. "OR models in urban service facility location: A critical review of applications and future developments," European Journal of Operational Research, Elsevier, vol. 276(1), pages 1-27.
    3. Amiri-Aref, Mehdi & Farahani, Reza Zanjirani & Hewitt, Mike & Klibi, Walid, 2019. "Equitable location of facilities in a region with probabilistic barriers to travel," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 66-85.
    4. Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    5. Oğuz, Murat & Bektaş, Tolga & Bennell, Julia A., 2018. "Multicommodity flows and Benders decomposition for restricted continuous location problems," European Journal of Operational Research, Elsevier, vol. 266(3), pages 851-863.

    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. Masashi Miyagawa, 2012. "Rectilinear distance to a facility in the presence of a square barrier," Annals of Operations Research, Springer, vol. 196(1), pages 443-458, July.
    2. Oğuz, Murat & Bektaş, Tolga & Bennell, Julia A., 2018. "Multicommodity flows and Benders decomposition for restricted continuous location problems," European Journal of Operational Research, Elsevier, vol. 266(3), pages 851-863.
    3. Malgorzata Miklas-Kalczynska & Pawel Kalczynski, 2024. "Multiple obnoxious facility location: the case of protected areas," Computational Management Science, Springer, vol. 21(1), pages 1-21, June.
    4. Masashi Miyagawa, 2017. "Continuous location model of a rectangular barrier facility," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 95-110, April.
    5. Amiri-Aref, Mehdi & Farahani, Reza Zanjirani & Hewitt, Mike & Klibi, Walid, 2019. "Equitable location of facilities in a region with probabilistic barriers to travel," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 66-85.
    6. Canbolat, Mustafa S. & Wesolowsky, George O., 2010. "The rectilinear distance Weber problem in the presence of a probabilistic line barrier," European Journal of Operational Research, Elsevier, vol. 202(1), pages 114-121, April.
    7. Kathrin Klamroth & Margaret M. Wiecek, 2002. "A Bi-Objective Median Location Problem With a Line Barrier," Operations Research, INFORMS, vol. 50(4), pages 670-679, August.
    8. P.M. Dearing & H.W. Hamacher & K. Klamroth, 2002. "Dominating sets for rectilinear center location problems with polyhedral barriers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 647-665, October.
    9. Bischoff, M. & Klamroth, K., 2007. "An efficient solution method for Weber problems with barriers based on genetic algorithms," European Journal of Operational Research, Elsevier, vol. 177(1), pages 22-41, February.
    10. Canbolat, Mustafa S. & Wesolowsky, George O., 2012. "On the use of the Varignon frame for single facility Weber problems in the presence of convex barriers," European Journal of Operational Research, Elsevier, vol. 217(2), pages 241-247.
    11. Andrea Maier & Horst W. Hamacher, 2019. "Complexity results on planar multifacility location problems with forbidden regions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(3), pages 433-484, June.
    12. P. Dearing & K. Klamroth & R. Segars, 2005. "Planar Location Problems with Block Distance and Barriers," Annals of Operations Research, Springer, vol. 136(1), pages 117-143, April.
    13. H. W. Hamacher & S. Nickel, 1995. "Restricted planar location problems and applications," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 967-992, September.
    14. Klamroth, K., 2004. "Algebraic properties of location problems with one circular barrier," European Journal of Operational Research, Elsevier, vol. 154(1), pages 20-35, April.
    15. Selçuk Savaş & Rajan Batta & Rakesh Nagi, 2002. "Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel," Operations Research, INFORMS, vol. 50(6), pages 1018-1031, December.
    16. Pawel Kalczynski & Zvi Drezner, 2021. "The obnoxious facilities planar p-median problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 577-593, June.
    17. 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.
    18. Sarkar, Avijit & Batta, Rajan & Nagi, Rakesh, 2007. "Placing a finite size facility with a center objective on a rectangular plane with barriers," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1160-1176, June.
    19. Byrne, Thomas & Kalcsics, Jörg, 2022. "Conditional facility location problems with continuous demand and a polygonal barrier," European Journal of Operational Research, Elsevier, vol. 296(1), pages 22-43.
    20. Zhang, Min & Savas, Selçuk & Batta, Rajan & Nagi, Rakesh, 2009. "Facility placement with sub-aisle design in an existing layout," European Journal of Operational Research, Elsevier, vol. 197(1), pages 154-165, August.

    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:67:y:2016:i:8:d:10.1057_jors.2016.5. 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.