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

The collection depots location problem on networks

Author

Listed:
  • Oded Berman
  • Zvi Drezner
  • George O. Wesolowsky

Abstract

In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000

Suggested Citation

  • Oded Berman & Zvi Drezner & George O. Wesolowsky, 2002. "The collection depots location problem on networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(1), pages 15-24, February.
    • Handle: RePEc:wly:navres:v:49:y:2002:i:1:p:15-24
    DOI: 10.1002/nav.10000
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10000
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10000?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. Drezner, Zvi & Wesolowsky, George O., 2001. "On the collection depots location problem," European Journal of Operational Research, Elsevier, vol. 130(3), pages 510-518, May.
    2. J. N. Hooker & R. S. Garfinkel & C. K. Chen, 1991. "Finite Dominating Sets for Network Location Problems," Operations Research, INFORMS, vol. 39(1), pages 100-118, February.
    3. G. Y. Handler, 1973. "Minimax Location of a Facility in an Undirected Tree Graph," Transportation Science, INFORMS, vol. 7(3), pages 287-293, August.
    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. Oded Berman & Rongbing Huang, 2007. "The Minisum Multipurpose Trip Location Problem on Networks," Transportation Science, INFORMS, vol. 41(4), pages 500-515, November.
    2. Dongyan Chen & Chan He & Senlin Wu, 2016. "Single facility collection depots location problem with random weights," Operational Research, Springer, vol. 16(2), pages 287-299, July.
    3. Lüer-Villagra, Armin & Marianov, Vladimir & Eiselt, H.A. & Méndez-Vogel, Gonzalo, 2022. "The leader multipurpose shopping location problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 470-481.

    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. Berman, Oded & Drezner, Zvi & Wesolowsky, George O., 2007. "The transfer point location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 978-989, June.
    2. Zvi Drezner & G. O. Wesolowsky, 1991. "Facility location when demand is time dependent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 763-777, October.
    3. Noltemeier, H. & Spoerhase, J. & Wirth, H.-C., 2007. "Multiple voting location and single voting location on trees," European Journal of Operational Research, Elsevier, vol. 181(2), pages 654-667, September.
    4. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    5. Szeto, W.Y. & Farahani, R.Z. & Sumalee, Agachai, 2017. "Link-based multi-class hazmat routing-scheduling problem: A multiple demon approach," European Journal of Operational Research, Elsevier, vol. 261(1), pages 337-354.
    6. O Berman & Z Drezner, 2003. "A probabilistic one-centre location problem on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 871-877, August.
    7. 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.
    8. Lin, Zhenhong & Ogden, Joan & Fan, Yueyue & Chen, Chien-Wei, 2009. "The Fuel-Travel-Back Approach to Hydrogen Station Siting," Institute of Transportation Studies, Working Paper Series qt14p44238, Institute of Transportation Studies, UC Davis.
    9. A. Rodríguez-Chía & J. Puerto & D. Pérez-Brito & J. Moreno, 2005. "Thep-facility ordered median problem on networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(1), pages 105-126, June.
    10. Robert Cromley & Dean Hanink, 2008. "Population growth and the development of a central place system," Journal of Geographical Systems, Springer, vol. 10(4), pages 383-405, December.
    11. R. Francis & T. Lowe & M. Rayco & A. Tamir, 2009. "Aggregation error for location models: survey and analysis," Annals of Operations Research, Springer, vol. 167(1), pages 171-208, March.
    12. Bapna, Ravi & Thakur, Lakshman S. & Nair, Suresh K., 2002. "Infrastructure development for conversion to environmentally friendly fuel," European Journal of Operational Research, Elsevier, vol. 142(3), pages 480-496, November.
    13. Michael Kuby & Seow Lim, 2007. "Location of Alternative-Fuel Stations Using the Flow-Refueling Location Model and Dispersion of Candidate Sites on Arcs," Networks and Spatial Economics, Springer, vol. 7(2), pages 129-152, June.
    14. Shaw, Lipika & Das, Soumen Kumar & Roy, Sankar Kumar, 2022. "Location-allocation problem for resource distribution under uncertainty in disaster relief operations," Socio-Economic Planning Sciences, Elsevier, vol. 82(PA).
    15. Carrizosa, Emilio & Conde, Eduardo, 2002. "A fractional model for locating semi-desirable facilities on networks," European Journal of Operational Research, Elsevier, vol. 136(1), pages 67-80, January.
    16. Wei Ding & Ke Qiu, 2018. "A quadratic time exact algorithm for continuous connected 2-facility location problem in trees," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1262-1298, November.
    17. Becker, Ronald I. & Lari, Isabella & Scozzari, Andrea, 2007. "Algorithms for central-median paths with bounded length on trees," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1208-1220, June.
    18. Wei Ding & Ke Qiu, 2017. "An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1084-1095, November.
    19. Francis, R. L. & Lowe, T. J. & Tamir, A. & Emir-Farinas, H., 2004. "A framework for demand point and solution space aggregation analysis for location models," European Journal of Operational Research, Elsevier, vol. 159(3), pages 574-585, December.
    20. Conde, Eduardo, 2007. "Minmax regret location-allocation problem on a network under uncertainty," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1025-1039, 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:wly:navres:v:49:y:2002:i:1:p:15-24. 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.