IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v196y2023i1d10.1007_s10957-022-02133-9.html
   My bibliography  Save this article

Customized Alternating Direction Methods of Multipliers for Generalized Multi-facility Weber Problem

Author

Listed:
  • Jianlin Jiang

    (Nanjing University of Aeronautics and Astronautics)

  • Liyun Ling

    (Nanjing University of Aeronautics and Astronautics)

  • Yan Gu

    (Nanjing University of Aeronautics and Astronautics)

  • Su Zhang

    (Nankai University)

  • Yibing Lv

    (Yangtze University)

Abstract

This paper addresses a generalized multi-facility Weber problem (GMFWP) where the gauge is used to measure distance and locational constraints are imposed on new facilities. This problem has important applications in real situations, either itself or as subproblems. In order to solve GMFWP efficiently, we reformulate it as a separable minimization problem and then two customized alternating direction methods of multipliers (ADMMs) based on augmented Lagrangian function are contributed to solving the resulted separable problem. Specifically, for unconstrained GMFWP, a convergent ADMM for two-block problem is presented. For constrained GMFWP, the direct application of ADMM for multi-block problem has no convergence guarantee. As one of main contributions, this paper proposes a new ADMM for the general multi-block separable problem, and its global convergence is established under mild assumptions. We then apply the new convergent ADMM to solve constrained GMFWP. Some satisfactory numerical results for numerous GMFWPs are reported, which verify the efficiency of proposed ADMM algorithms.

Suggested Citation

  • Jianlin Jiang & Liyun Ling & Yan Gu & Su Zhang & Yibing Lv, 2023. "Customized Alternating Direction Methods of Multipliers for Generalized Multi-facility Weber Problem," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 362-389, January.
    • Handle: RePEc:spr:joptap:v:196:y:2023:i:1:d:10.1007_s10957-022-02133-9
    DOI: 10.1007/s10957-022-02133-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02133-9
    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/s10957-022-02133-9?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. B. S. He & H. Yang & S. L. Wang, 2000. "Alternating Direction Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 106(2), pages 337-356, August.
    2. Bingsheng He & Xiaoming Yuan & Wenxing Zhang, 2013. "A customized proximal point algorithm for convex minimization with linear constraints," Computational Optimization and Applications, Springer, vol. 56(3), pages 559-572, December.
    3. J. B. Rosen & G. L. Xue, 1993. "On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem," Operations Research, INFORMS, vol. 41(6), pages 1164-1171, December.
    4. 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.
    5. J. B. Rosen & G. L. Xue, 1992. "On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem," Operations Research, INFORMS, vol. 40(1), pages 188-191, February.
    6. Frank Plastria, 2011. "The Weiszfeld Algorithm: Proof, Amendments, and Extensions," International Series in Operations Research & Management Science, in: H. A. Eiselt & Vladimir Marianov (ed.), Foundations of Location Analysis, chapter 0, pages 357-389, Springer.
    7. William Miehle, 1958. "Link-Length Minimization in Networks," Operations Research, INFORMS, vol. 6(2), pages 232-243, April.
    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. 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.
    2. Fadda, Edoardo & Manerba, Daniele & Cabodi, Gianpiero & Camurati, Paolo Enrico & Tadei, Roberto, 2021. "Comparative analysis of models and performance indicators for optimal service facility location," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    3. Kun Jin & Yevgeniy Vorobeychik & Mingyan Liu, 2021. "Multi-Scale Games: Representing and Solving Games on Networks with Group Structure," Papers 2101.08314, arXiv.org.
    4. Vergis, Anastasios & Steiglitz, Kenneth & Dickinson, Bradley, 1986. "The complexity of analog computation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 28(2), pages 91-113.
    5. Dolgopolik, Maksim V., 2021. "The alternating direction method of multipliers for finding the distance between ellipsoids," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    6. Simeon Reich & Truong Minh Tuyen, 2023. "The Generalized Fermat–Torricelli Problem in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 78-97, January.
    7. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    8. Plastria, Frank, 2016. "How bad can the centroid be?," European Journal of Operational Research, Elsevier, vol. 252(1), pages 98-102.
    9. 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.
    10. Lijun Xu & Bo Yu & Yin Zhang, 2017. "An alternating direction and projection algorithm for structure-enforced matrix factorization," Computational Optimization and Applications, Springer, vol. 68(2), pages 333-362, November.
    11. Jing Yao & Alan T. Murray, 2014. "Serving regional demand in facility location," Papers in Regional Science, Wiley Blackwell, vol. 93(3), pages 643-662, August.
    12. Tom Blockmans & Marie-Anne Guerry, 2016. "Coalition Formation Procedures: The Impact of Issue Saliences and Consensus Estimation," Group Decision and Negotiation, Springer, vol. 25(3), pages 481-499, May.
    13. Z. K. Jiang & X. M. Yuan, 2010. "New Parallel Descent-like Method for Solving a Class of Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 145(2), pages 311-323, May.
    14. Dirk A. Lorenz & Quoc Tran-Dinh, 2019. "Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence," Computational Optimization and Applications, Springer, vol. 74(1), pages 67-92, September.
    15. Yunhai Xiao & Hong Zhu & Soon-Yi Wu, 2013. "Primal and dual alternating direction algorithms for ℓ 1 -ℓ 1 -norm minimization problems in compressive sensing," Computational Optimization and Applications, Springer, vol. 54(2), pages 441-459, March.
    16. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    17. Wu, Yiqian & Zhang, Xuan & Sun, Hongbin, 2021. "A multi-time-scale autonomous energy trading framework within distribution networks based on blockchain," Applied Energy, Elsevier, vol. 287(C).
    18. X. Wang & S. Li & X. Kou & Q. Zhang, 2015. "A new alternating direction method for linearly constrained nonconvex optimization problems," Journal of Global Optimization, Springer, vol. 62(4), pages 695-709, August.
    19. Frank Plastria, 2021. "Using the power of ideal solutions: simple proofs of some old and new results in location theory," 4OR, Springer, vol. 19(3), pages 449-467, September.
    20. Ying Gao & Wenxing Zhang, 2023. "An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function," Computational Optimization and Applications, Springer, vol. 85(1), pages 263-291, May.

    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:joptap:v:196:y:2023:i:1:d:10.1007_s10957-022-02133-9. 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.