IDEAS home Printed from https://ideas.repec.org/a/sae/envirb/v18y1991i3p347-360.html
   My bibliography  Save this article

Towards the Solution of the (Generalised) Multi-Weber Problem

Author

Listed:
  • K E Rosing

    (Economisch-Googrofisch Instituut, Erasmus Universiteit Rotterdam, Postbus 1738, 3000 Dr Rotterdam, The Netherlands; and Department of Geography, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2)

Abstract

Despite the long history of the multi-Weber problem and the generalised multi-Weber problem, there is no general optimal method for its solution. This paper has two aims. The first aim is a study of the shape of the objective function of the single and multi-Weber problem. The form of the objective function and the relation of a heuristic to it are critical to the decision to use a heuristic or to seek an optimal solution. The objective function of the multi-Weber problem is shown to be extremely steep in the neighbourhood of the optimal solution, indicating the importance of an optimal rather than heuristic solution. The second aim is a description of a two-step algorithm which, although it cannot guarantee optimality, will frequently terminate optimally and thus appears to be superior to other available heuristics.

Suggested Citation

  • K E Rosing, 1991. "Towards the Solution of the (Generalised) Multi-Weber Problem," Environment and Planning B, , vol. 18(3), pages 347-360, September.
    • Handle: RePEc:sae:envirb:v:18:y:1991:i:3:p:347-360
    DOI: 10.1068/b180347
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/b180347
    Download Restriction: no
    File URL: https://libkey.io/10.1068/b180347?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
    ---><---

    References listed on IDEAS

    as
    1. S. L. Hakimi, 1965. "Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems," Operations Research, INFORMS, vol. 13(3), pages 462-475, 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. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    2. Alan Murray, 1998. "Assessing clustering methods for exploratory spatial data analysis," ERSA conference papers ersa98p346, European Regional Science Association.

    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. E L Hillsman, 1984. "The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis," Environment and Planning A, , vol. 16(3), pages 305-318, March.
    2. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    3. He, Yan & Wu, Tao & Zhang, Canrong & Liang, Zhe, 2015. "An improved MIP heuristic for the intermodal hub location problem," Omega, Elsevier, vol. 57(PB), pages 203-211.
    4. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    5. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    6. Wen, Meilin & Iwamura, Kakuzo, 2008. "Fuzzy facility location-allocation problem under the Hurwicz criterion," European Journal of Operational Research, Elsevier, vol. 184(2), pages 627-635, January.
    7. Kangxu Wang & Weifeng Wang & Tongtong Li & Shengjun Wen & Xin Fu & Xinhao Wang, 2023. "Optimizing Living Service Amenities for Diverse Urban Residents: A Supply and Demand Balancing Analysis," Sustainability, MDPI, vol. 15(16), pages 1-24, August.
    8. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    9. Xin Feng & Alan T. Murray, 2018. "Allocation using a heterogeneous space Voronoi diagram," Journal of Geographical Systems, Springer, vol. 20(3), pages 207-226, July.
    10. Wei Ding & Ke Qiu, 2020. "Approximating the asymmetric p-center problem in parameterized complete digraphs," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 21-35, July.
    11. Soudabeh Seyyedi Ghomi & Fahimeh Baroughi, 2024. "Robust vertex centdian facility location problem on tree networks," Annals of Operations Research, Springer, vol. 341(2), pages 1135-1149, October.
    12. Averbakh, Igor & Berman, Oded, 1996. "Locating flow-capturing units on a network with multi-counting and diminishing returns to scale," European Journal of Operational Research, Elsevier, vol. 91(3), pages 495-506, June.
    13. Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    14. Peeters, Peter H., 1998. "Some new algorithms for location problems on networks," European Journal of Operational Research, Elsevier, vol. 104(2), pages 299-309, January.
    15. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    16. Milosav Georgijevic & Sanja Bojic & Dejan Brcanov, 2013. "The location of public logistic centers: an expanded capacity-limited fixed cost location-allocation modeling approach," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(2), pages 218-229, April.
    17. Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
    19. Jinghong Shen & Jianquan Cheng & Wencong Huang & Fantao Zeng, 2020. "An Exploration of Spatial and Social Inequalities of Urban Sports Facilities in Nanning City, China," Sustainability, MDPI, vol. 12(11), pages 1-19, May.
    20. Jiamin Wang, 2007. "The (beta)-Reliable Median on a Network with Discrete Probabilistic Demand Weights," Operations Research, INFORMS, vol. 55(5), pages 966-975, October.

    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:sae:envirb:v:18:y:1991:i:3:p:347-360. 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: SAGE Publications (email available below). General contact details of provider: .

    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.