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.
Keywords: Location-allocation problem, capacitated Weber problem, fixed cost, cell-based approach, Furthest Distance Rule
@article{RO_2021__55_3_2055_0,
author = {Jamil, Nur Shifa Farah Ain and Abdul-Rahman, Syariza and Luis, Martino and Benjamin, Aida Mauziah},
title = {Hybrid {Cell} {Selection-based} {Heuristic} for capacitated multi-facility {Weber} problem with continuous fixed costs},
journal = {RAIRO. Operations Research},
pages = {2055--2068},
year = {2021},
publisher = {EDP-Sciences},
volume = {55},
number = {3},
doi = {10.1051/ro/2021077},
mrnumber = {4281740},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2021077/}
}
TY - JOUR AU - Jamil, Nur Shifa Farah Ain AU - Abdul-Rahman, Syariza AU - Luis, Martino AU - Benjamin, Aida Mauziah TI - Hybrid Cell Selection-based Heuristic for capacitated multi-facility Weber problem with continuous fixed costs JO - RAIRO. Operations Research PY - 2021 SP - 2055 EP - 2068 VL - 55 IS - 3 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2021077/ DO - 10.1051/ro/2021077 LA - en ID - RO_2021__55_3_2055_0 ER -
%0 Journal Article %A Jamil, Nur Shifa Farah Ain %A Abdul-Rahman, Syariza %A Luis, Martino %A Benjamin, Aida Mauziah %T Hybrid Cell Selection-based Heuristic for capacitated multi-facility Weber problem with continuous fixed costs %J RAIRO. Operations Research %D 2021 %P 2055-2068 %V 55 %N 3 %I EDP-Sciences %U https://www.numdam.org/articles/10.1051/ro/2021077/ %R 10.1051/ro/2021077 %G en %F RO_2021__55_3_2055_0
Jamil, Nur Shifa Farah Ain; Abdul-Rahman, Syariza; Luis, Martino; Benjamin, Aida Mauziah. Hybrid Cell Selection-based Heuristic for capacitated multi-facility Weber problem with continuous fixed costs. RAIRO. Operations Research, Tome 55 (2021) no. 3, pp. 2055-2068. doi: 10.1051/ro/2021077
[1] , and , Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem. Ann. Oper. Res. 222 (2014) 45–71. | MR | Zbl | DOI
[2] , , and , A nonlinear model for a capacitated location-allocation problem with Bernoulli demand using sub-sources. Int. J. Eng. Trans. B: App. 26 (2013) 1007–1016.
[3] , , and , A capacitated location-allocation problem with stochastic demands using sub-sources: an empirical study. Appl. Soft Comput. 34 (2015) 551–571. | DOI
[4] , and , New heuristic methods for the capacitated multi-facility Weber problem. Nav. Res. Logist. 54 (2007) 21–32. | MR | Zbl | DOI
[5] , and , Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms, edited by , , , , and . In: Metaheuristics: Progress in Complex Systems Optimization. Springer, US (2007) 91–112. | Zbl | DOI
[6] , and , Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem. J. Oper. Res. Soc. 59 (2008) 64–79. | Zbl | DOI
[7] and , A continuous location-allocation problem with zone-dependent fixed cost. Ann. Oper. Res. 136 (2005) 99–115. | MR | Zbl | DOI
[8] , , and , Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper. Res. 48 (2000) 444–460. | DOI
[9] , and , The multi-source Weber problem with constant opening cost. J. Oper. Res. Soc. 55 (2004) 640–646. | Zbl | DOI
[10] , , and , A survey of solution methods for the continuous location-allocation problem. Int. J. Oper. Res. 5 (2018) 1–12. | MR | Zbl
[11] , The transportation-location problem. Oper. Res. 20 (1972) 94–108. | MR | Zbl | DOI
[12] , Network and Discrete Location – Models, Algorithms and Applications. John Wiley & Sons, Inc. (1995). | MR | Zbl | DOI
[13] , and , Optimization of blood sample collection with timing and quality constraints. Int. Trans. Oper. Res. 25 (2018) 191–214. | MR | DOI
[14] and , Constructive heuristics for the uncapacitated continuous location-allocation problem. J. Oper. Res. Soc. 52 (2001) 821–829. | Zbl | DOI
[15] and , A cellular heuristic for the multisource Weber problem. Comput. Oper. Res. 30 (2003) 1609–1624. | MR | Zbl | DOI
[16] , and , Heuristic solution of the multisource Weber problem as a -median problem. Oper. Res. Lett. 22 (1998) 55–62. | MR | Zbl | DOI
[17] , and , A fuzzy algorithm for continuous capacitated location allocation model with risk consideration. Appl. Math. Model. 38 (2014) 983–1000. | MR | DOI
[18] , and , A cross entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost. Comput. Ind. Eng. 83 (2015) 151–158. | DOI
[19] , , and , The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches. Eur. J. Oper. Res. 263 (2017) 94–107. | MR | DOI
[20] , , and , The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem. Ann. Oper. Res. 275 (2019) 367–392. | MR | DOI
[21] , and , The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods. J. Glob. Optim. 78 (2020) 271–294. | MR | DOI
[22] , A note on Fermat’s problem. Math. Program. 4 (1973) 98–107. | MR | Zbl | DOI
[23] , and , Global optimization algorithm for capacitated multi-facility continuous location-allocation problems. J. Glob. Optim. 71 (2018) 871–889. | MR | DOI
[24] , and , Region-rejection based heuristics for the capacitated multi-source Weber problem. Comput. Oper. Res. 36 (2009) 2007–2017. | Zbl | DOI
[25] , and , A guided reactive GRASP for the capacitated multi-source Weber problem. Comput. Oper. Res. 38 (2011) 1014–1024. | MR | Zbl | DOI
[26] , and , A constructive method and a guided hybrid grasp for the capacitated multi-source Weber problem in the presence of fixed cost. J. Algorithms Comput. Tech. 9 (2015) 215–232. | MR | DOI
[27] , and , A two-stage method for the capacitated multi-facility location-allocation problem. Int. J. Oper. Res. 35 (2019) 366–377. | MR | DOI
[28] , and , New heuristic methods for the single-source capacitated multi facility Weber problem. Int. J. Adv. Manuf. Technol. 69 (2013) 1569–1579. | DOI
[29] , and , Single-source capacitated multi-facility Weber problem – an iterative two phase heuristic algorithm. Comput. Oper. Res. 39 (2012) 1465–1476. | MR | Zbl | DOI
[30] , and , A new GA based solution for capacitated multi source Weber problem. Int. J. Comput. Intell. Syst. 3 (2010) 514–521.
[31] and , Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm. Appl. Math. Model. 37 (2013) 5109–5119. | MR | DOI
[32] , , and , Health service network design: a robust possibilistic approach. Int. Trans. Oper. Res. 25 (2018) 337–373. | MR | DOI
[33] , Heuristics for the single source capacitated multi-facility Weber problem. Comput. Ind. Eng. 64 (2013) 959–971. | DOI
[34] and , Combining possibilistic linear programming and fuzzy AHP for solving the multi-objective capacitated multi-facility location problem. Inf. Sci. 268 (2014) 185–201. | MR | DOI
[35] and , A squared-euclidean distance location-allocation problem. Nav. Res. Logist. 39 (1992) 447–469. | MR | Zbl | DOI
[36] , and , A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem. Discrete Appl. Math. 49 (1994) 357–378. | MR | Zbl | DOI
[37] , , , Global optimization procedures for the capacitated euclidean and distance multifacility location-allocation problems. Oper. Res. 50 (2002) 433–448. | MR | Zbl | DOI
[38] and , Efficient heuristics for single-source capacitated multi-facility Weber problems. In: Proceedings of the 38th International Conference on Computers and Industrial Engineering (2008).
[39] , , and , A self-learning particle swarm optimization for robust multi-echelon capacitated location–allocation–inventory problem. Int. J. Adv. Manuf. Technol. 18 (2019) 677–694.
[40] , , and , A robust green location-allocation-inventory problem to design an urban waste management system under uncertainty. Waste Manage. 102 (2020) 340–350. | DOI
[41] , and , Sustainable fuzzy multi-trip location-routing problem for medical waste management during the COVID-19 outbreak. Sci. Total Environ. 756 (2021) 143607. | DOI
[42] and , A perturbation-based heuristic for the capacitated multisource Weber problem. Eur. J. Oper. Res. 179 (2007) 1194–1207. | Zbl | DOI
[43] and , New stochastic models for capacitated location-allocation problem. Comput. Ind. Eng. 45 (2003) 111–125. | DOI
Cité par Sources :
