IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v177y2007i1p22-41.html
   My bibliography  Save this article

An efficient solution method for Weber problems with barriers based on genetic algorithms

Author

Listed:
  • Bischoff, M.
  • Klamroth, K.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:177:y:2007:i:1:p:22-41
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00926-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. 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.
    3. Pierre Hansen & Dominique Peeters & Denis Richard & Jacques-Francois Thisse, 1985. "The Minisum and Minimax Location Problems Revisited," Operations Research, INFORMS, vol. 33(6), pages 1251-1265, December.
    4. 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.
    5. repec:cor:louvrp:-683 is not listed on IDEAS
    6. 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.
    7. 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.
    8. Plastria, Frank, 1992. "GBSSS: The generalized big square small square method for planar single-facility location," European Journal of Operational Research, Elsevier, vol. 62(2), pages 163-174, October.
    9. 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.
    10. 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.
    11. Richard C. Larson & Ghazala Sadiq, 1983. "Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel," Operations Research, INFORMS, vol. 31(4), pages 652-669, August.
    12. Pavankumar Nandikonda & Rajan Batta & Rakesh Nagi, 2003. "Locating a 1-Center on a Manhattan Plane with “Arbitrarily” Shaped Barriers," Annals of Operations Research, Springer, vol. 123(1), pages 157-172, October.
    13. 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.
    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. S. Nobakhtian & A. Raeisi Dehkordi, 2018. "An algorithm for generalized constrained multi-source Weber problem with demand substations," 4OR, Springer, vol. 16(4), pages 343-377, December.
    2. Abdolsalam Ghaderi & Mohammad Jabalameli & Farnaz Barzinpour & Ragheb Rahmaniani, 2012. "An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation Problem," Networks and Spatial Economics, Springer, vol. 12(3), pages 421-439, September.
    3. Murray, Alan T. & Church, Richard L. & Feng, Xin, 2020. "Single facility siting involving allocation decisions," European Journal of Operational Research, Elsevier, vol. 284(3), pages 834-846.
    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. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Bischoff, Martin & Dächert, Kerstin, 2009. "Allocation search methods for a generalized class of location-allocation problems," European Journal of Operational Research, Elsevier, vol. 192(3), pages 793-807, February.
    14. 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.

    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. 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.
    2. 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.
    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. 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. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    11. 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.
    12. 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.
    13. 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.
    14. Kelachankuttu, Hari & Batta, Rajan & Nagi, Rakesh, 2007. "Contour line construction for a new rectangular facility in an existing layout with rectangular departments," European Journal of Operational Research, Elsevier, vol. 180(1), pages 149-162, July.
    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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:177:y:2007:i:1:p:22-41. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.