A congested capacitated location problem with continuous network demand
RAIRO. Operations Research, Tome 56 (2022) no. 5, pp. 3561-3579

This paper presents a multi-objective mixed-integer non-linear programming model for a congested multiple-server discrete facility location problem with uniformly distributed demands along the network edges. Regarding the capacity of each facility and the maximum waiting time threshold, the developed model aims to determine the number and locations of established facilities along with their corresponding number of assigned servers such that the traveling distance, the waiting time, the total cost, and the number of lost sales (uncovered customers) are minimized simultaneously. Also, this paper proposes modified versions of some of the existing heuristics and metaheuristic algorithms currently used to solve NP-hard location problems. Here, the memetic algorithm along with its modified version called the stochastic memetic algorithm, as well as the modified add and modified drop heuristics are used as the solution methods. Computational results and comparisons demonstrate that although the results obtained from the developed stochastic memetic algorithm are slightly better, the applied memetic algorithm could be considered as the most efficient approach in finding reasonable solutions with less required CPU times.

DOI : 10.1051/ro/2022167
Classification : 90B80, 90C27, 90C11
Keywords: Capacitated facility location problem, queuing theory, continuous network demand, heuristics and metaheuristic algorithms
@article{RO_2022__56_5_3561_0,
     author = {Golabi, Mahmoud and Shavarani, Seyed Mahdi and Idoumghar, Lhassane},
     title = {A congested capacitated location problem with continuous network demand},
     journal = {RAIRO. Operations Research},
     pages = {3561--3579},
     year = {2022},
     publisher = {EDP-Sciences},
     volume = {56},
     number = {5},
     doi = {10.1051/ro/2022167},
     mrnumber = {4497833},
     language = {en},
     url = {https://www.numdam.org/articles/10.1051/ro/2022167/}
}
TY  - JOUR
AU  - Golabi, Mahmoud
AU  - Shavarani, Seyed Mahdi
AU  - Idoumghar, Lhassane
TI  - A congested capacitated location problem with continuous network demand
JO  - RAIRO. Operations Research
PY  - 2022
SP  - 3561
EP  - 3579
VL  - 56
IS  - 5
PB  - EDP-Sciences
UR  - https://www.numdam.org/articles/10.1051/ro/2022167/
DO  - 10.1051/ro/2022167
LA  - en
ID  - RO_2022__56_5_3561_0
ER  - 
%0 Journal Article
%A Golabi, Mahmoud
%A Shavarani, Seyed Mahdi
%A Idoumghar, Lhassane
%T A congested capacitated location problem with continuous network demand
%J RAIRO. Operations Research
%D 2022
%P 3561-3579
%V 56
%N 5
%I EDP-Sciences
%U https://www.numdam.org/articles/10.1051/ro/2022167/
%R 10.1051/ro/2022167
%G en
%F RO_2022__56_5_3561_0
Golabi, Mahmoud; Shavarani, Seyed Mahdi; Idoumghar, Lhassane. A congested capacitated location problem with continuous network demand. RAIRO. Operations Research, Tome 56 (2022) no. 5, pp. 3561-3579. doi: 10.1051/ro/2022167

[1] A. B. Arabani and R. Z. Farahani, Facility location dynamics: An overview of classifications and applications. Comput. Ind. Eng. 62 (2012) 408–420. | DOI

[2] A. Klose and A. Drexl, Facility location models for distribution system design. Eur. J. Oper. Res. 162 (2005) 4–29. | MR | Zbl | DOI

[3] Y. Liu, Y. Yuan, J. Shen and W. Gao, Emergency response facility location in transportation networks: a literature review. J. Traffic Transp. Eng. (2021).

[4] M. Bieniek, A note on the facility location problem with stochastic demands. Omega 55 (2015) 53–60. | DOI

[5] L. V. Snyder, Facility location under uncertainty: a review. IIE Trans. 38 (2006) 547–564. | DOI

[6] X. Gao and C. Cui, A note on the warehouse location problem with data contamination. RAIRO: OR 55 (2021) 1113. | MR | Zbl | Numdam | DOI

[7] A. C. Li, L. Nozick, N. Xu and R. Davidson, Shelter location and transportation planning under hurricane conditions. Transp. Res. Part E Logist. Transp. Rev. 48 (2012) 715–729. | DOI

[8] S. An, N. Cui, Y. Bai, W. Xie, M. Chen and Y. Ouyang, Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing. Transp. Res. Part E Logist. Transp. Rev. 82 (2015) 199–216. | DOI

[9] R. Halper, S. Raghavan and M. Sahin, Local search heuristics for the mobile facility location problem. Comput. Oper. Res. 62 (2015) 210–223. | MR | Zbl | DOI

[10] S. Ilkhanizadeh, M. Golabi, S. Hesami and H. Rjoub, The Potential Use of Drones for Tourism in Crises: A Facility Location Analysis Perspective. J. Risk Financ. Manag. 13 (2020) 246. | DOI

[11] S. M. Shavarani, M. G. Nejad, F. Rismanchian and G. Izbirak, Application of hierarchical facility location problem for optimization of a drone delivery system: a case study of Amazon prime air in the city of San Francisco. J. Adv. Manuf. Technol. 95 (2018) 3141–3153. | DOI

[12] F. Torrent-Fontbona, V. Muñoz and B. López, Solving large immobile location–allocation by affinity propagation and simulated annealing. Application to select which sporting event to watch. Expert Syst. Appl. 40 (2013) 4593–4599. | DOI

[13] S. Zamani, J. Arkat, S. T. A. Niaki and F. Ahmadizar, Locations of congested facilities with interruptible immobile servers. Comput. Ind. Eng. 156 (2021) 107220. | DOI

[14] S. Basu, M. Sharma and P. S. Ghosh, Metaheuristic applications on discrete facility location problems: a survey. Opsearch 52 (2015) 530–561. | MR | Zbl | DOI

[15] Z. Ulukan and E. Demircioğlu, A survey of discrete facility location problems. Int. J. Ind. Manuf. Eng. 9 (2015) 2487–2492.

[16] D. Dinler, M. K. Tural and C. Iyigun, Heuristics for a continuous multifacility location problem with demand regions. Comput. Oper. Res. 62 (2015) 237–256. | MR | Zbl | DOI

[17] I. M. Al-Mudahka, M. S. Al-Jeraiwi and R. M’Hallah, Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier. RAIRO: OR 55 (2021) 141–165. | MR | Zbl | Numdam | DOI

[18] M. Hasanzadeh, B. Alizadeh and F. Baroughi, The cardinality constrained inverse center location problems on tree networks with edge length augmentation. Theor. Comput. Sci. 865 (2021) 12–33. | MR | Zbl | DOI

[19] S. Beheshtifar and A. Alimoahmmadi, A multiobjective optimization approach for location-allocation of clinics. Int. Trans. Oper. Res. 22 (2015) 313–328. | MR | Zbl | DOI

[20] A. Eydi and J. Mohebi, Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods. RAIRO: OR 52 (2018) 1245–1260. | MR | Zbl | Numdam | DOI

[21] R. Z. Farahani, N. Asgari, N. Heidari, M. Hosseininia and M. Goh, Covering problems in facility location: A review. Comput. Ind. Eng. 62 (2012) 368–407. | DOI

[22] K. Aardal, P. L. Van Den Berg, D. Gijswijt and S. Li, Approximation algorithms for hard capacitated k -facility location problems. Eur. J. Oper. Res. 242 (2015) 358–368. | MR | Zbl | DOI

[23] Y. Yan, An Improved Ant Colony Optimization Algorithm with Local Search for the Capacitated Facility Location Problem. Ph.D. thesis, New Mexico State University (2021).

[24] M. Charikar, S. Khuller, D. M. Mount and G. Narasimhan, Algorithms for facility location problems with outliers. SODA 1 (2001) 642–651. | Zbl | MR

[25] P. Sinha, Performance of an add-drop-interchange heuristic for the capacitated facility location problem. Int. J. Appl. Manag. Sci. 1 (2009) 388–400. | DOI

[26] I. Harris, C. L. Mumford and M. M. Naim, A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling. Transp. Res. Part E Logist. Transp. Rev. 66 (2014) 1–22. | DOI

[27] K. Abbal and Y. Benadada, Bi-level Multi-capacitated Facility location Problem, in 2020 5th International Conference on Logistics Operations Management (GOL). IEEE (2020) 1–5.

[28] B. Boffey, R. Galvão and L. Espejo, A review of congestion models in the location of facilities with immobile servers. Eur. J. Oper. Res. 178 (2007) 643–662. | MR | Zbl | DOI

[29] R. Aboolian, O. Berman and Z. Drezner, The multiple server center location problem. Ann. Oper. Res. 167 (2009) 337–352. | MR | Zbl | DOI

[30] H. R. Sayarshad and J. Y. Chow, Non-myopic relocation of idle mobility-on- demand vehicles as a dynamic location-allocation-queueing problem. Transp. Res. Part E Logist. Transp. Rev. 106 (2017) 60–77. | DOI

[31] R. Tavakkoli-Moghaddam, S. Vazifeh-Noshafagh, A. A. Taleizadeh, V. Hajipour and A. Mahmoudi, Pricing and location decisions in multi-objective facility location problem with M / M / m / k queuing systems. Eng. Optim. 49 (2017) 136–160. | MR | DOI

[32] S. M. Shavarani, S. Mosallaeipour, M. Golabi and G. İzbirak, A congested capacitated multi-level fuzzy facility location problem: An efficient drone delivery system. Comput. Oper. Res. 108 (2019) 57–68. | MR | Zbl | DOI

[33] O. Berman, D. Krass and J. Wang, Locating service facilities to reduce lost demand. IIE Trans. 38 (2006) 933–946. | DOI

[34] S. H. A. Rahmati, A. Ahmadi, M. Sharifi and A. Chambari, A multiobjective model for facility location–allocation problem with immobile servers within queuing framework. Comput. Ind. Eng. 74 (2014) 1–10. | DOI

[35] F. Etebari, A column generation algorithm for the choice-based congested location-pricing problem. Comput. Ind. Eng. 130 (2019) 687–698. | DOI

[36] S. H. R. Pasandideh, S. T. A. Niaki and V. Hajipour, A multi-objective facility location model with batch arrivals: two parameter-tuned meta-heuristic algorithms. J. Intell. Manuf. 24 (2013) 331–348. | DOI

[37] R. Jafari and J. Arkat, Network location problem with stochastic and uniformly distributed demands. Int. J. Eng. 29 (2016) 654–662.

[38] M. Golabi, S. M. Shavarani and G. Izbirak, An edge-based stochastic facility location problem in UAV-supported humanitarian relief logistics: a case study of Tehran earthquake. Nat. Hazards 87 (2017) 1545–1565. | DOI

[39] S. M. Shavarani, M. Golabi and G. Izbirak, A capacitated biobjective location problem with uniformly distributed demands in the UAV-supported delivery operation. Int. Trans. Oper. Res. 28 (2021) 3220–3243. | MR | Zbl | DOI

[40] M. Golabi, G. Izbirak and J. Arkat, Multiple-server facility location problem with stochastic demands along the network edges. J. Eng. Res. 6 (2018).

[41] M. J. Hodgson, A flow-capturing location-allocation model. Geogr. Anal. 22 (1990) 270–279. | DOI

[42] M. R. Garey and D. S. Johnson, Computers and Intractability. Freeman San Francisco, 174 (1979). | MR | Zbl

[43] M. S. Daskin and K. L. Maass, The p -median problem, in Location Science. Springer (2015) 21–45. | DOI

[44] N. Megiddo, E. Zemel and S. L. Hakimi, The maximum coverage location problem. SIAM J. Alg. Discrete Meth. 4 (1983) 253–261. | MR | Zbl | DOI

[45] S. Dantrakul, C. Likasiri and R. Pongvuthithum, Applied p -median and p -center algorithms for facility location problems. Expert Syst. Appl. 41 (2014) 3596–3604. | DOI

[46] Z.-J. M. Shen, R. L. Zhan and J. Zhang, The reliable facility location problem: Formulations, heuristics, and approximation algorithms. INFORMS J. Comput. 23 (2011) 470–482. | MR | Zbl | DOI

[47] P. Sinha, Observations on some heuristic methods for the capacitated facility location problem. Opsearch 49 (2012) 86–93. | MR | Zbl | DOI

[48] J. Wollenweber, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application. OR Spectr. 30 (2008) 655–673. | MR | Zbl | DOI

[49] R. Kissell and J. Poserina, Chapter 4 - Advanced math and statistics, in Optimal Sports Math, Statistics, and Fantasy. Academic Press (2017) 103–135. | DOI

[50] J. F. Shortle, J. M. Thompson, D. Gross and C. M. Harris, Fundamentals of Queueing Theory. John Wiley & Sons, 399 (2018). | MR | Zbl

[51] M. Ehrgott and X. Gandibleux, Multiobjective combinatorial optimization— theory, methodology, and applications, in Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. Springer (2003) 369–444. | MR | Zbl

[52] N. Krasnogor and J. Smith, A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans. Evol. Comput. 9 (2005) 474–488. | DOI

[53] R. Tavakkoli-Moghaddam, N. Safaei and F. Sassani, A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Comput. Oper. Res. 36 (2009) 402–414. | MR | Zbl | DOI

[54] P. Moscato and M. G. Norman, A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. Parallel Comput. Transp. Appl. 1 (1992) 177–186.

[55] S. Samanta, A. Choudhury, N. Dey, A. Ashour and V. Balas, Quantuminspired evolutionary algorithm for scaling factor optimization during manifold medical information embedding, in Quantum Inspired Computational Intelligence. Elsevier (2017) 285–326. | DOI

[56] A. A. Kuehn and M. J. Hamburger, A heuristic program for locating warehouses. Manag. Sci. 9 (1963) 643–666. | DOI

[57] E. Feldman, F. Lehrer and T. Ray, Warehouse location under continuous economies of scale. Manag. Sci. 12 (1966) 670–684. | DOI

Cité par Sources :