IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2013y2013i1n624398.html

A Heuristic Algorithm for Constrained Multi‐Source Location Problem with Closest Distance under Gauge: The Variational Inequality Approach

Author

Listed:
  • Jian-Lin Jiang
  • Saeed Assani
  • Kun Cheng
  • Xiao-Xing Zhu

Abstract

This paper considers the locations of multiple facilities in the space Rp, with the aim of minimizing the sum of weighted distances between facilities and regional customers, where the proximity between a facility and a regional customer is evaluated by the closest distance. Due to the fact that facilities are usually allowed to be sited in certain restricted areas, some locational constraints are imposed to the facilities of our problem. In addition, since the symmetry of distances is sometimes violated in practical situations, the gauge is employed in this paper instead of the frequently used norms for measuring both the symmetric and asymmetric distances. In the spirit of the Cooper algorithm (Cooper, 1964), a new location‐allocation heuristic algorithm is proposed to solve this problem. In the location phase, the single‐source subproblem with regional demands is reformulated into an equivalent linear variational inequality (LVI), and then, a projection‐contraction (PC) method is adopted to find the optimal locations of facilities, whereas in the allocation phase, the regional customers are allocated to facilities according to the nearest center reclassification (NCR). The convergence of the proposed algorithm is proved under mild assumptions. Some preliminary numerical results are reported to show the effectiveness of the new algorithm.

Suggested Citation

  • Jian-Lin Jiang & Saeed Assani & Kun Cheng & Xiao-Xing Zhu, 2013. "A Heuristic Algorithm for Constrained Multi‐Source Location Problem with Closest Distance under Gauge: The Variational Inequality Approach," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:624398
    DOI: 10.1155/2013/624398
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/624398
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/624398?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. Stefan Nickel & Justo Puerto & Antonio M. Rodriguez-Chia, 2003. "An Approach to Location Models Involving Sets as Existing Facilities," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 693-715, November.
    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. C. Valero Franco & A. Rodríguez-Chía & I. Espejo Miranda, 2008. "The single facility location problem with average-distances," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 164-194, July.
    2. Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    3. André Berger & Alexander Grigoriev & Andrej Winokurow, 2017. "An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions," Computational Optimization and Applications, Springer, vol. 68(3), pages 661-669, December.
    4. Lina Mallozzi & Justo Puerto & Moisés Rodríguez-Madrena, 2019. "On Location-Allocation Problems for Dimensional Facilities," Journal of Optimization Theory and Applications, Springer, vol. 182(2), pages 730-767, August.
    5. Blanco, Víctor & Fernández, Elena & Puerto, Justo, 2017. "Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods," European Journal of Operational Research, Elsevier, vol. 262(3), pages 863-878.
    6. 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.
    7. 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.
    8. 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.
    9. Frank Plastria, 2009. "Asymmetric distances, semidirected networks and majority in Fermat–Weber problems," Annals of Operations Research, Springer, vol. 167(1), pages 121-155, March.
    10. Masashi Miyagawa, 2017. "Continuous location model of a rectangular barrier facility," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 95-110, April.
    11. Jian-lin Jiang & Ya Xu, 2006. "Minisum location problem with farthest Euclidean distances," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 285-308, October.
    12. Nazlı Dolu & Umur Hastürk & Mustafa Kemal Tural, 2020. "Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances," Computational Optimization and Applications, Springer, vol. 75(2), pages 537-560, March.
    13. Wanka, Gert & Bot, Radu Ioan & Vargyas, Emese, 2007. "Duality for location problems with unbounded unit balls," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1252-1265, June.
    14. Diaz-Banez, J.M. & Ramos, P.A. & Sabariego, P., 2007. "The maximin line problem with regional demand," European Journal of Operational Research, Elsevier, vol. 181(1), pages 20-29, August.
    15. Carrizosa, Emilio & Goerigk, Marc & Schöbel, Anita, 2017. "A biobjective approach to recoverable robustness based on location planning," European Journal of Operational Research, Elsevier, vol. 261(2), pages 421-435.

    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:jnlaaa:v:2013:y:2013:i:1:n:624398. 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://onlinelibrary.wiley.com/journal/4058 .

    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.