IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v136y2005i1p193-20910.1007-s10479-005-2045-1.html
   My bibliography  Save this article

The K-Connection Location Problem in a Plane

Author

Listed:
  • Simin Huang
  • Rajan Batta
  • Kathrin Klamroth
  • Rakesh Nagi

Abstract

This paper determines the optimal location of K connections in the plane, where a connection links pairs of existing facilities. Both uncapacitated and capacitated versions of the problem are considered. Discretization results for general polyhedral gauges and other properties are established. Two heuristic algorithms are developed for each case using the concept of a shortest path flow set coupled with a sequential location and allocation approach. Computational results show that the algorithms are efficient and accurate. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • Simin Huang & Rajan Batta & Kathrin Klamroth & Rakesh Nagi, 2005. "The K-Connection Location Problem in a Plane," Annals of Operations Research, Springer, vol. 136(1), pages 193-209, April.
    • Handle: RePEc:spr:annopr:v:136:y:2005:i:1:p:193-209:10.1007/s10479-005-2045-1
    DOI: 10.1007/s10479-005-2045-1
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-2045-1
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-2045-1?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. James E. Ward & Richard E. Wendell, 1985. "Using Block Norms for Location Modeling," Operations Research, INFORMS, vol. 33(5), pages 1074-1090, October.
    2. Turgut Aykin, 1988. "On the Location of Hub Facilities," Transportation Science, INFORMS, vol. 22(2), pages 155-157, May.
    3. R. L. Francis & T. J. Lowe & M. B. Rayco, 1996. "Row-Column Aggregation for Rectilinear Distance p -Median Problems," Transportation Science, INFORMS, vol. 30(2), pages 160-174, May.
    4. Montreuil, Benoit & Ratliff, H. Donald, 1988. "Optimizing the location of input/output stations within facilities layout," Engineering Costs and Production Economics, Elsevier, vol. 14(3), pages 177-187, September.
    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. 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.
    2. Simin Huang & Rajan Batta & Rakesh Nagi, 2009. "Simultaneous siting and sizing of distribution centers on a plane," Annals of Operations Research, Springer, vol. 167(1), pages 157-170, March.
    3. Rastpour, Amir & Esfahani, M.S., 2010. "Mathematical models for selection of optimal place and size of connections considering the time-value of money," European Journal of Operational Research, Elsevier, vol. 200(3), pages 764-773, February.
    4. Jochen Gorski & Frank Pfeuffer & Kathrin Klamroth, 2007. "Biconvex sets and optimization with biconvex functions: a survey and extensions," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(3), pages 373-407, December.

    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. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    2. Rastpour, Amir & Esfahani, M.S., 2010. "Mathematical models for selection of optimal place and size of connections considering the time-value of money," European Journal of Operational Research, Elsevier, vol. 200(3), pages 764-773, February.
    3. H. Emir-Farinas & R. Francis, 2005. "Demand Point Aggregation for Planar Covering Location Models," Annals of Operations Research, Springer, vol. 136(1), pages 175-192, April.
    4. 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.
    5. Vladimir Marianov & Daniel Serra, 2000. "Location models for airline hubs behaving as M/D/c queues," Economics Working Papers 453, Department of Economics and Business, Universitat Pompeu Fabra.
    6. Phipps Arabie, 1991. "Was euclid an unnecessarily sophisticated psychologist?," Psychometrika, Springer;The Psychometric Society, vol. 56(4), pages 567-587, December.
    7. Sönke Behrends & Anita Schöbel, 2020. "Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 911-935, September.
    8. 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.
    9. I. Jerin Leno & S. Saravana Sankar & S. G. Ponnambalam, 2018. "MIP model and elitist strategy hybrid GA–SA algorithm for layout design," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 369-387, February.
    10. Sohn, Jinhyeon & Park, Sungsoo, 1997. "A linear program for the two-hub location problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 617-622, August.
    11. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, March.
    12. 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.
    13. Nickel, Stefan, 1998. "Restricted center problems under polyhedral gauges," European Journal of Operational Research, Elsevier, vol. 104(2), pages 343-357, January.
    14. J. Fliege, 1997. "Nondifferentiability Detection and Dimensionality Reduction in Minisum Multifacility Location Problems," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 365-380, August.
    15. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    16. Aykin, Turgut, 1995. "The hub location and routing problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 200-219, May.
    17. Anita Schöbel, 2014. "Generalized light robustness and the trade-off between robustness and nominal quality," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 80(2), pages 161-191, October.
    18. Víctor Blanco, 2019. "Ordered p-median problems with neighbourhoods," Computational Optimization and Applications, Springer, vol. 73(2), pages 603-645, June.
    19. H Younies & G O Wesolowsky, 2007. "Planar maximal covering location problem under block norm distance measure," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 740-750, June.
    20. Carrizosa, Emilio & Goerigk, Marc & Schöbel, Anita, 2017. "A biobjective approach to recoverable robustness based on location planning," European Journal of Operational Research, Elsevier, vol. 261(2), pages 421-435.

    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:136:y:2005:i:1:p:193-209:10.1007/s10479-005-2045-1. 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.