IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v187y2008i2p357-370.html
   My bibliography  Save this article

A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach

Author

Listed:
  • Jiang, Jian-Lin
  • Yuan, Xiao-Ming

Abstract

No abstract is available for this item.

Suggested Citation

  • Jiang, Jian-Lin & Yuan, Xiao-Ming, 2008. "A heuristic algorithm for constrained multi-source Weber problem - The variational inequality approach," European Journal of Operational Research, Elsevier, vol. 187(2), pages 357-370, June.
    • Handle: RePEc:eee:ejores:v:187:y:2008:i:2:p:357-370
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00290-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Rosing, K. E., 1992. "An optimal method for solving the (generalized) multi-Weber problem," European Journal of Operational Research, Elsevier, vol. 58(3), pages 414-426, May.
    2. Jack Brimberg & Robert F. Love, 1993. "Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances," Operations Research, INFORMS, vol. 41(6), pages 1153-1163, December.
    3. Lawrence M. Ostresh, 1978. "On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem," Operations Research, INFORMS, vol. 26(4), pages 597-609, August.
    4. Durier, Roland & Michelot, Christian, 1985. "Geometrical properties of the Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 20(3), pages 332-343, 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. Emad Alzubi & Bernd Noche, 2022. "A Multi-Objective Model to Find the Sustainable Location for Citrus Hub," Sustainability, MDPI, vol. 14(21), pages 1-17, November.
    2. Wu, Zili, 2018. "Characterizations of weakly sharp solutions for a variational inequality with a pseudomonotone mapping," European Journal of Operational Research, Elsevier, vol. 265(2), pages 448-453.
    3. S. Nobakhtian & A. Raeisi Dehkordi, 2018. "An algorithm for generalized constrained multi-source Weber problem with demand substations," 4OR, Springer, vol. 16(4), pages 343-377, December.
    4. Stradi-Granados, Benito A. & Haven, Emmanuel, 2010. "The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: The case of the IN/GB method," European Journal of Operational Research, Elsevier, vol. 203(1), pages 222-229, May.
    5. Jianlin Jiang & Xiaoming Yuan, 2012. "A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand," Computational Optimization and Applications, Springer, vol. 51(3), pages 1275-1295, April.
    6. Jianlin Jiang & Su Zhang & Yibing Lv & Xin Du & Ziwei Yan, 2020. "An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge," Journal of Global Optimization, Springer, vol. 76(4), pages 793-818, April.
    7. Yan Gu & Jianlin Jiang & Shun Zhang, 2023. "Distributionally robust Weber problem with uncertain demand," Computational Optimization and Applications, Springer, vol. 85(3), pages 705-752, July.
    8. Yao, Zhishuang & Lee, Loo Hay & Jaruphongsa, Wikrom & Tan, Vicky & Hui, Chen Fei, 2010. "Multi-source facility location-allocation and inventory problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 750-762, December.

    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. Carrizosa, Emilio & Rodriguez-Chia, Antonio M., 1997. "Weber problems with alternative transportation systems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 87-93, February.
    2. Zvi Drezner, 2009. "On the convergence of the generalized Weiszfeld algorithm," Annals of Operations Research, Springer, vol. 167(1), pages 327-336, March.
    3. Jianlin Jiang & Su Zhang & Yibing Lv & Xin Du & Ziwei Yan, 2020. "An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge," Journal of Global Optimization, Springer, vol. 76(4), pages 793-818, April.
    4. Venkateshan, Prahalad & Ballou, Ronald H. & Mathur, Kamlesh & Maruthasalam, Arulanantha P.P., 2017. "A Two-echelon joint continuous-discrete location model," European Journal of Operational Research, Elsevier, vol. 262(3), pages 1028-1039.
    5. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    6. Victor Blanco & Justo Puerto & Safae El Haj Ben Ali, 2014. "Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms," Computational Optimization and Applications, Springer, vol. 58(3), pages 563-595, July.
    7. 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.
    8. Díaz-Báñez, J.M. & Korman, M. & Pérez-Lantero, P. & Ventura, I., 2013. "The 1-median and 1-highway problem," European Journal of Operational Research, Elsevier, vol. 225(3), pages 552-557.
    9. Jack Brimberg & Robert Love & Nenad Mladenović, 2009. "Extension of the Weiszfeld procedure to a single facility minisum location model with mixed ℓ p norms," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 70(2), pages 269-283, October.
    10. Burkard, Rainer E. & Galavii, Mohammadreza & Gassner, Elisabeth, 2010. "The inverse Fermat-Weber problem," European Journal of Operational Research, Elsevier, vol. 206(1), pages 11-17, October.
    11. 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.
    12. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    13. Emilio Carrizosa & Frank Plastria, 2008. "Optimal Expected-Distance Separating Halfspace," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 662-677, August.
    14. Pawel Kalczynski & Atsuo Suzuki & Zvi Drezner, 2023. "Obnoxious facility location in multiple dimensional space," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 331-354, July.
    15. Blanco, Víctor & Gázquez, Ricardo & Ponce, Diego & Puerto, Justo, 2023. "A branch-and-price approach for the continuous multifacility monotone ordered median problem," European Journal of Operational Research, Elsevier, vol. 306(1), pages 105-126.
    16. Justo Puerto & Antonio Rodríguez-Chía, 2006. "New models for locating a moving service facility," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 31-51, February.
    17. Carrizosa, E. J. & Puerto, J., 1995. "A discretizing algorithm for location problems," European Journal of Operational Research, Elsevier, vol. 80(1), pages 166-174, January.
    18. Bischoff, Martin & Dächert, Kerstin, 2009. "Allocation search methods for a generalized class of location-allocation problems," European Journal of Operational Research, Elsevier, vol. 192(3), pages 793-807, February.
    19. Adi Ben-Israel & Cem Iyigun, 2008. "Probabilistic D-Clustering," Journal of Classification, Springer;The Classification Society, vol. 25(1), pages 5-26, June.
    20. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.

    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:eee:ejores:v:187:y:2008:i:2:p:357-370. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.