IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v3y1969i4p352-360.html
   My bibliography  Save this article

Optimal Locations for Centers in a Network

Author

Listed:
  • A. J. Goldman

    (National Bureau of Standards, Washington, D.C.)

Abstract

The problem treated is that of locating n centers (processing facilities) in a network, so as to minimize the total transportation cost associated with their use. On the assumption that all movements occur between a vertex and a center nearest it, Hakimi has shown that only vertex locations for the centers need be considered. The present paper shows that this conclusion remains valid under alternative assumptions more appropriate for some applications.

Suggested Citation

  • A. J. Goldman, 1969. "Optimal Locations for Centers in a Network," Transportation Science, INFORMS, vol. 3(4), pages 352-360, November.
    • Handle: RePEc:inm:ortrsc:v:3:y:1969:i:4:p:352-360
    DOI: 10.1287/trsc.3.4.352
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.3.4.352
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.3.4.352?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Oded Berman & Rongbing Huang, 2007. "The Minisum Multipurpose Trip Location Problem on Networks," Transportation Science, INFORMS, vol. 41(4), pages 500-515, November.
    3. Zheng, Jianfeng & Qi, Jingwen & Sun, Zhuo & Li, Feng, 2018. "Community structure based global hub location problem in liner shipping," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 1-19.
    4. Chang, Yu-Chun & Lee, Wei-Hao & Wu, Chi-Hung, 2019. "Airline new route selection using compromise programming - The case of Taiwan-Europe," Journal of Air Transport Management, Elsevier, vol. 76(C), pages 10-20.
    5. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    6. Wang, Min & Cheng, Qing & Huang, Jincai & Cheng, Guangquan, 2021. "Research on optimal hub location of agricultural product transportation network based on hierarchical hub-and-spoke network model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    7. Rahimeh Neamatian Monemi & Shahin Gelareh & Anass Nagih & Dylan Jones, 2021. "Bi-objective load balancing multiple allocation hub location: a compromise programming approach," Annals of Operations Research, Springer, vol. 296(1), pages 363-406, January.
    8. Chen, Dongxu & Yang, Zhongzhen, 2018. "Systematic optimization of port clusters along the Maritime Silk Road in the context of industry transfer and production capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 174-189.
    9. Farid Momayezi & S. Kamal Chaharsooghi & Mohammad Mehdi Sepehri & Ali Husseinzadeh Kashan, 2021. "The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm," Operational Research, Springer, vol. 21(1), pages 139-166, March.
    10. Hüseyin Güden, 2021. "New complexity results for the p-hub median problem," Annals of Operations Research, Springer, vol. 298(1), pages 229-247, March.
    11. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    12. Saber Shiripour & Milad Hematian & Nezam Mahdavi-Amiri, 2023. "A robust optimization model for dynamic virtual hub location problem under uncertainty using an M/M/C/K queuing model: two metaheuristic algorithms," Operational Research, Springer, vol. 23(3), pages 1-52, September.
    13. Rahmati, Reza & Neghabi, Hossein & Bashiri, Mahdi & Salari, Majid, 2023. "Stochastic regional-based profit-maximizing hub location problem: A sustainable overview," Omega, Elsevier, vol. 121(C).
    14. Ting L. Lei, 2019. "Evaluating the Vulnerability of Time-Sensitive Transportation Networks: A Hub Center Interdiction Problem," Sustainability, MDPI, vol. 11(17), pages 1-13, August.
    15. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    16. Mohammad Mahdi Nasiri & Amir Khaleghi & Kannan Govindan & Ali Bozorgi-Amiri, 2023. "Sustainable hierarchical multi-modal hub network design problem: bi-objective formulations and solution algorithms," Operational Research, Springer, vol. 23(2), pages 1-62, June.
    17. Honora Smith & Daniel Cakebread & Maria Battarra & Ben Shelbourne & Naseem Cassim & Lindi Coetzee, 2017. "Location of a hierarchy of HIV/AIDS test laboratories in an inbound hub network: case study in South Africa," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1068-1081, September.
    18. Zheng, Jianfeng & Zhang, Wenlong & Qi, Jingwen & Wang, Shuaian, 2019. "Canal effects on a liner hub location problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 130(C), pages 230-247.
    19. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).

    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:inm:ortrsc:v:3:y:1969:i:4:p:352-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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.