Amiri-Aref, M., Shiripour, S. and Ruiz-Hernández, D. (2021) Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier. Computers & Operations Research, 132. 105293. ISSN 0305-0548
Abstract
In this article, we propose an extension of the multi-Weber facility location problem with rectilinear-distance in the presence of passages over a non-horizontal line barrier. For the single-facility case, we develop an exact heuristic based on a divide-and-conquer approach that outperforms alternative heuristics available in literature. The multiple facilities case is solved by means of the application of an alternate-location-allocation heuristic, characterized by embedded exact and approximate procedures. For large instances, we propose a heuristic (with polynomial time complexity) which provides near-optimal solutions in a short computational time and a negligible gap. Finally, for testing purposes, we use a benchmark based on the transformation of the main problem into an equivalent p-median problem. Experimental results evidence the efficiency and validity of the proposed heuristics, which are capable of obtaining high quality solutions within acceptable computation times.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2021 Elsevier. This is an author produced version of a paper subsequently published in Computers and Operations Research. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). |
Keywords: | Facility location; Multi-facility Weber problem; Line barrier; Heuristics; P-median |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Social Sciences (Sheffield) > Management School (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 09 Apr 2021 11:03 |
Last Modified: | 27 Sep 2022 00:13 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.cor.2021.105293 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:172961 |