IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v16y2016i2d10.1007_s12351-015-0200-2.html
   My bibliography  Save this article

Single facility collection depots location problem with random weights

Author

Listed:
  • Dongyan Chen

    (Harbin University of Science and Technology
    Harbin University of Science and Technology)

  • Chan He

    (Harbin University of Science and Technology
    Harbin University of Science and Technology)

  • Senlin Wu

    (Harbin University of Science and Technology)

Abstract

In this paper we consider the single facility collection depots location problem in the plane where n weighted demand points and p collection depots are given. The service of a demand point consists of the travel from the facility to the demand point and returning back to the facility through a collection depot which provides the shortest route. The weights are drawn from independent continuous distributions , and the objective is to find the location such that the probability that the maximum weighted distance of the round trip exceeds a threshold is minimized. The problem is formulated and analyzed. Computational experience is reported.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:operea:v:16:y:2016:i:2:d:10.1007_s12351-015-0200-2
    DOI: 10.1007/s12351-015-0200-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-015-0200-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-015-0200-2?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. 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. 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.
    3. Zvi Drezner & Atsuo Suzuki, 2004. "The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems," Operations Research, INFORMS, vol. 52(1), pages 128-135, February.
    4. Richard E. Wendell & Arthur P. Hurter, 1973. "Location Theory, Dominance, and Convexity," Operations Research, INFORMS, vol. 21(1), pages 314-320, February.
    5. O Berman & R Huang, 2004. "Minisum collection depots location problem with multiple facilities on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 769-779, July.
    6. George O. Wesolowsky, 1977. "Probabilistic Weights in the One-Dimensional Facility Location Problem," Management Science, INFORMS, vol. 24(2), pages 224-229, October.
    7. Plastria, Frank, 1992. "GBSSS: The generalized big square small square method for planar single-facility location," European Journal of Operational Research, Elsevier, vol. 62(2), pages 163-174, October.
    8. Oded Berman & Jiamin Wang & Zvi Drezner & George Wesolowsky, 2003. "A Probabilistic Minimax Location Problem on the Plane," Annals of Operations Research, Springer, vol. 122(1), pages 59-70, 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. Shen, Liang & Xu, Xiang & Shao, Feng & Shao, Hu & Ge, Yanxin, 2024. "A multi-objective optimization model for medical waste recycling network design under uncertainties," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    2. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "An exact and a heuristic approach for the transportation-p-facility location problem," Computational Management Science, Springer, vol. 17(3), pages 389-407, October.
    3. Meisam Nasrollahi & Jafar Razmi, 2021. "A mathematical model for designing an integrated pharmaceutical supply chain with maximum expected coverage under uncertainty," Operational Research, Springer, vol. 21(1), pages 525-552, March.
    4. Soumen Kumar Das & Sankar Kumar Roy & Gerhard Wilhelm Weber, 2020. "Heuristic approaches for solid transportation-p-facility location problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 939-961, September.

    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. Zvi Drezner & George Wesolowsky, 2014. "Covering Part of a Planar Network," Networks and Spatial Economics, Springer, vol. 14(3), pages 629-646, December.
    2. 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.
    3. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    4. 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.
    5. Rafael Blanquero & Emilio Carrizosa & Amaya Nogales-Gómez & Frank Plastria, 2014. "Single-facility huff location problems on networks," Annals of Operations Research, Springer, vol. 222(1), pages 175-195, November.
    6. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    7. Zvi Drezner & Mozart B. C. Menezes, 2016. "The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution," Annals of Operations Research, Springer, vol. 246(1), pages 205-226, November.
    8. Daniel Scholz, 2013. "Geometric branch-and-bound methods for constrained global optimization problems," Journal of Global Optimization, Springer, vol. 57(3), pages 771-782, November.
    9. Drezner, Tammy & Drezner, Zvi & Hulliger, Beat, 2014. "The Quintile Share Ratio in location analysis," European Journal of Operational Research, Elsevier, vol. 238(1), pages 166-174.
    10. Tammy Drezner & Zvi Drezner & Pawel Kalczynski, 2020. "Gradual cover competitive facility location," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 333-354, June.
    11. Zvi Drezner & George O. Wesolowsky & Tammy Drezner, 2004. "The gradual covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 841-855, September.
    12. Tammy Drezner & Zvi Drezner & Atsuo Suzuki, 2019. "A cover based competitive facility location model with continuous demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(7), pages 565-581, October.
    13. Fernandez, Jose & Pelegri'n, Blas & Plastria, Frank & Toth, Boglarka, 2007. "Solving a Huff-like competitive location and design model for profit maximization in the plane," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1274-1287, June.
    14. E. Carrizosa & J. B. G. Frenk, 1998. "Dominating Sets for Convex Functions with Some Applications," Journal of Optimization Theory and Applications, Springer, vol. 96(2), pages 281-295, February.
    15. Chan He & Yafang Lv & Horst Martini & Senlin Wu, 2023. "A Branch-and-Bound Approach for Estimating Covering Functionals of Convex Bodies," Journal of Optimization Theory and Applications, Springer, vol. 196(3), pages 1036-1055, March.
    16. Maria Barbati & Giuseppe Bruno & Alfredo Marín, 2016. "Balancing the arrival times of users in a two-stage location problem," Annals of Operations Research, Springer, vol. 246(1), pages 273-288, November.
    17. Gökhan Altay & M. Hakan Akyüz & Temel Öncan, 2023. "Solving a minisum single facility location problem in three regions with different norms," Annals of Operations Research, Springer, vol. 321(1), pages 1-37, February.
    18. T Drezner & Z Drezner, 2008. "Lost demand in a competitive environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 362-371, March.
    19. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    20. O Berman & Z Drezner & G O Wesolowsky, 2008. "The multiple location of transfer points," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 805-811, June.

    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:operea:v:16:y:2016:i:2:d:10.1007_s12351-015-0200-2. 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.