IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v39y1992i5p635-649.html
   My bibliography  Save this article

Location‐allocation for distribution to a uniform demand with transshipments

Author

Listed:
  • James F. Campbell

Abstract

This article analyzes the location‐allocation problem for distribution from a single fixed origin via transshipment terminals to a continuous uniformly distributed demand. Distribution through terminals concentrates flows on the origin‐to‐terminal links and transportation economies of scale encourage the use of larger vehicles. Analytical expressions are derived for the optimal terminal locations, the optimal allocation of destinations to terminals, and the optimal transportation cost. Continuous analytic models assume either an allocation, by partitioning the service region into sectors, or terminal locations. This is unlikely to produce an optimal distribution system. The optimal cost is compared to the cost for suboptimal location‐allocation combinations. Results indicate that the location decision is not too important if destinations are allocated optimally and that allocation to the nearest terminal may be poor, even with optimal locations. © 1992 John Wiley & Sons, Inc.

Suggested Citation

  • James F. Campbell, 1992. "Location‐allocation for distribution to a uniform demand with transshipments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 635-649, August.
    • Handle: RePEc:wly:navres:v:39:y:1992:i:5:p:635-649
    DOI: 10.1002/1520-6750(199208)39:53.0.CO;2-E
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199208)39:53.0.CO;2-E
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199208)39:53.0.CO;2-E?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. Tony J. Van Roy, 1986. "A Cross Decomposition Algorithm for Capacitated Facility Location," Operations Research, INFORMS, vol. 34(1), pages 145-163, February.
    2. Z. Drezner & G. O. Weslowsky, 1980. "Optimal location of a facility relative to area demands," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(2), pages 199-206, June.
    3. Campbell, James F., 1990. "Freight consolidation and routing with transportation economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 24(5), pages 345-361, October.
    4. Leon Cooper, 1972. "The Transportation-Location Problem," Operations Research, INFORMS, vol. 20(1), pages 94-108, February.
    5. V. F. Hurdle, 1973. "Minimum Cost Locations for Parallel Public Transit Lines," Transportation Science, INFORMS, vol. 7(4), pages 340-350, November.
    6. S. Chandana Wirasinghe & Vanolin F. Hurdle & Gordon F. Newell, 1977. "Optimal Parameters for a Coordinated Rail and Bus Transit System," Transportation Science, INFORMS, vol. 11(4), pages 359-374, November.
    7. Weaver, Jerry R. & Church, Richard L., 1986. "A location model based on multiple metrics and multiple facility assignment," Transportation Research Part B: Methodological, Elsevier, vol. 20(4), pages 283-296, August.
    8. Ann S. Marucheck & Adel A. Aly, 1981. "An efficient algorithm for the location‐allocation problem with rectangular regions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(2), pages 309-323, June.
    9. Arthur M. Geoffrion, 1976. "The Purpose of Mathematical Programming is Insight, Not Numbers," Interfaces, INFORMS, vol. 7(1), pages 81-92, November.
    10. G. O. Wesolowsky & R. F. Love, 1971. "Location of facilities with rectangular distances among point and area destinations," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 18(1), pages 83-90, March.
    11. Nadia S. A. Ghoneim & S. C. Wirasinghe, 1987. "Optimum Zone Configuration for Planned Urban Commuter Rail Lines," Transportation Science, INFORMS, vol. 21(2), pages 106-114, May.
    12. Leon Cooper, 1963. "Location-Allocation Problems," Operations Research, INFORMS, vol. 11(3), pages 331-343, June.
    13. Tom M. Cavalier & Hanif D. Sherali, 1986. "Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons," Transportation Science, INFORMS, vol. 20(2), pages 107-116, May.
    14. Christofides, N. & Beasley, J. E., 1983. "Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem," European Journal of Operational Research, Elsevier, vol. 12(1), pages 19-28, January.
    15. Hanif D. Sherali & Frederick L. Nordai, 1988. "A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands," Transportation Science, INFORMS, vol. 22(1), pages 70-73, February.
    16. Umit Akinc & Basheer M. Khumawala, 1977. "An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem," Management Science, INFORMS, vol. 23(6), pages 585-594, February.
    17. Reuven Chen, 1983. "Solution of minisum and minimax location–allocation problems with Euclidean distances," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(3), pages 449-459, September.
    Full references (including those not matched with items on IDEAS)

    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. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    2. Klaus Büdenbender & Tore Grünert & Hans-Jürgen Sebastian, 2000. "A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem," Transportation Science, INFORMS, vol. 34(4), pages 364-380, November.
    3. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    4. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    5. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    6. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    7. Abareshi, Maryam & Zaferanieh, Mehdi, 2019. "A bi-level capacitated P-median facility location problem with the most likely allocation solution," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 1-20.
    8. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    9. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    10. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    11. 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.
    12. Sharma, R.R.K. & Berry, V., 2007. "Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort," European Journal of Operational Research, Elsevier, vol. 177(2), pages 803-812, March.
    13. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2019. "A directional approach to gradual cover," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 70-93, April.
    14. M. Hakan Akyüz & Temel Öncan & İ. Kuban Altınel, 2019. "Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem," Annals of Operations Research, Springer, vol. 279(1), pages 1-42, August.
    15. Chen, Peng (Will) & Nie, Yu (Marco), 2018. "Optimal design of demand adaptive paired-line hybrid transit: Case of radial route structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 71-89.
    16. Sivakumaran, Karthikgeyan & Li, Yuwei & Cassidy, Michael J. & Madanat, Samer, 2010. "Cost-Saving Properties of Schedule Coordination in a Simple Trunk-and-Feeder Transit System," University of California Transportation Center, Working Papers qt9qr8s3hx, University of California Transportation Center.
    17. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Ramesh Bollapragada & Uday S. Rao & Junying Wu, 2023. "Hub location–allocation for combined fixed-wireless and wireline broadband access networks," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 50(1), pages 115-128, March.
    19. Bouchery, Yann & Fransoo, Jan, 2015. "Cost, carbon emissions and modal shift in intermodal network design decisions," International Journal of Production Economics, Elsevier, vol. 164(C), pages 388-399.
    20. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2014. "Planning of a decentralized distribution network using bilevel optimization," Omega, Elsevier, vol. 49(C), pages 30-41.

    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:wly:navres:v:39:y:1992:i:5:p:635-649. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.