Volume 55, Number 3, May-June 2021
|Page(s)||2055 - 2068|
|Published online||07 July 2021|
Hybrid Cell Selection-based Heuristic for capacitated multi-facility Weber problem with continuous fixed costs
School of Quantitative Sciences, College of Arts & Sciences, Universiti Utara Malaysia, UUM Sintok, Kedah 06010, Malaysia.
2 College of Engineering, Mathematics, and Physical Sciences, University of Exeter, North Park Road, Exeter EX4 4QF, UK
* Corresponding author: firstname.lastname@example.org
Accepted: 3 May 2021
Location-allocation problem (LAP) has attracted much attention in facility location field. The LAP in continuous plane is well-known as Weber problem. This paper assessed this problem by considering capacity constraints and fixed costs as each facility has different setup cost and capacity limit to serve customers. Previous studies considered profitable areas by dividing continuous space into a discrete number of equal cells to identify optimal locations from a smaller set of promising locations. Unfortunately, it may lead to avoid choosing good locations because unprofitable areas are still considered while locating the facilities. Hence, this allows a significant increment in the transportation costs. Thus, this paper intelligently selected profitable area through a hybridization of enhanced Cell Selection-based Heuristic (CSBH) and Furthest Distance Rule (FDR) to minimize total transportation and fixed costs. The CSBH divides customer distribution into smaller set of promising locations and intelligently selected profitable area to increase possibility of finding better locations, while FDR aims to forbid the new locations of the facilities to be close to the previously selected locations. Numerical experiments tested on well-known benchmark datasets showed that the results of hybrid heuristic outperformed single CSBH and FDR, while producing competitive results when compared with previously published results, apart from significantly improving total transportation cost. The new hybrid heuristic is simple yet effective in solving LAP.
Mathematics Subject Classification: 90C59 / 90C27 / 68T20 / 90B06
Key words: Location-allocation problem / capacitated Weber problem / fixed cost / cell-based approach / Furthest Distance Rule
© The authors. Published by EDP Sciences, ROADEF, SMAI 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.