Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 31176


Select areas to restrict search in scientific publication database:
10011268
Heuristic Methods for the Capacitated Location- Allocation Problem with Stochastic Demand
Abstract:
The proper number and appropriate locations of service centers can save cost, raise revenue and gain more satisfaction from customers. Establishing service centers is high-cost and difficult to relocate. In long-term planning periods, several factors may affect the service. One of the most critical factors is uncertain demand of customers. The opened service centers need to be capable of serving customers and making a profit although the demand in each period is changed. In this work, the capacitated location-allocation problem with stochastic demand is considered. A mathematical model is formulated to determine suitable locations of service centers and their allocation to maximize total profit for multiple planning periods. Two heuristic methods, a local search and genetic algorithm, are used to solve this problem. For the local search, five different chances to choose each type of moves are applied. For the genetic algorithm, three different replacement strategies are considered. The results of applying each method to solve numerical examples are compared. Both methods reach to the same best found solution in most examples but the genetic algorithm provides better solutions in some cases.
Digital Object Identifier (DOI):

References:

[1] L. Cooper, “Location-allocation problems,” Oper. Res., vol. 11, no. 3, pp. 331-343, June 1963.
[2] M. F. Goodchild, “ILACS: A Location-Allocation Model for Retail Site Selection,” J. Retailing, vol. 60, no. 1, pp. 84-100, Spring 1984.
[3] K. Gokbayrak and A. S. Kocaman, “A distance-limited continuous location-allocation problem for spatial planning of decentralized systems,” Comput. Oper. Res., vol. 88, pp. 15-29, Dec. 2017.
[4] J. Brimberg and S. Salhi, “A continuous location-allocation problem with zone-dependent fixed cost,” Ann. Oper. Res., vol. 136, pp. 99-115, Apr. 2005.
[5] S. M. Mousavi and S. T. A. Niaki, “Capacitated location allocation problem with stochastic location and fuzzy demand: A hybrid algorithm,” Appl. Math. Model., vol. 37, pp. 5109-5119, Apr. 2013.
[6] A. M. Fathollahi Fard and M. Hajaghaei-Keshteli, “A tri-level location-allocation model for forward/reverse supply chain,” Appl. Soft Comput., vol. 62, pp. 328-346, Jan. 2018.
[7] S. Khodaparasti, M. E. Bruni, P. Beraldi, H. R. Maleki, and S. Jahedi, “A multi-period location-allocation model for nursing home network planning under uncertainty,” Oper. Res. Health Care, vol. 18, pp. 4-15, Sept. 2018.
[8] P. Ghasemi, K. Khalili-Damghani, A. Hafezalkotob, and S. Raissi, “Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planning,” Appl. Math. Comput., vol. 350, pp. 105-132, June 2019.
[9] H. Baharmand, T. Comes, and M. Lauras, “Bi-objective multi-layer location-allocation model for the immediate aftermath of sudden-onset disasters,” Transport. Res. E-Log, vol. 127, pp. 86-110, July 2019.
[10] P. R. Jenkins, B. J. Lunday, and M. J. Robbins, “Robust, multi-objective optimization for the military medical evacuation location-allocation problem,” Omega, Jul. 2019, Art. no. 102088.
[11] D. Weible, P. Salamon, I. B. Christoph-Schulz, and G. Peter, “How do political, individual and contextual factors affect school milk demand? Empirical evidence from primary schools in Germany,” Food Policy, vol. 43, pp. 148-158, Dec. 2013.
[12] N. I. Benjamin and B. Lin, “Influencing factors on electricity demand in Chinese nonmetallic mineral products industry: A quantile perspective,” J. Clean. Prod., vol. 243, Jan. 2020, Art. no. 118584.
[13] B. W. Inganga, A. Njeru, K. Omburi, and O. I. Tirimba, “Factor affecting customer demand of financial services offered by commercial banks in Nairobi country,” Int. J. Sci. Res. Publ., vol. 4. no. 11, pp. 1-25 Nov. 2014.
[14] J. Cano-Belmán and H. Meyr, “Deterministic allocation models for multi-period demand fulfillment in multi-stage customer hierarchies,” Comput. Oper. Res., vol. 101, pp. 76-92, Jan. 2019.
[15] K. Afrin, B. Nepal, and L. Monplaisir, “A data-driven framework to new product demand prediction: Integrating product differentiation and transfer learning approach,” Expert Syst. Appl., vol. 108, pp. 246-257, Oct. 2018.
[16] T. V. Nguyen, L. Zhou, A. Y. L. Chong, Boying Li, and X. Pu, “Predicting customer demand for remanufacturing products: A data-mining approach,” Eur. J. Oper. Res., to be published.
[17] A. Ghodratnama, H. R. Arbabi, and A. Azaron, “Production planning in industrial townships modeled as hub location-allocation problems considering congestion in manufacturing plants,” Comput. Ind. Eng., vol. 129, pp. 479-501, Mar. 2019.
[18] S. Yan, J. Lin, Y. Chen, and F. Xie, “Rental bike location and allocation under stochastic demands,” Comput. Ind. Eng., vol. 107, pp. 1-11, May 2017.
[19] K. Wang, B. Makond, and S. Liu, “Location and allocation decisions in a two-echelon supply chain with stochastic demand – A genetic algorithm based solution,” Expert Syst. Appl., vol. 38, pp. 6125-6131, May 2011.
[20] M. Alizadeh, J. Ma, N. Mahdavi-Amiri, and M. Marufuzzaman, “A stochastic programming model for a capacitated location-allocation problem with heterogeneous demands,” Comput. Ind. Eng., vol. 137, Nov. 2019. Art. no. 106055.
[21] N. Vidyarthi and S. Jayaswal, “Efficient solution of a class of location-allocation problems with stochastic demand and congestion,” Comput. Oper. Res., vol. 48, pp. 20-30, Aug. 2014.
[22] E. Özceylan, A. Uslu, M. Erbaş, C. Çetinkaya, and S. K. İşleyen, “Optimizing the location-allocation problem of pharmacy warehouses: A case study in Gaziantep,” Int. J. Optimiz. Control, vol. 7, no. 1, pp. 117-129, 2017.
[23] M. Kaveh and M. S. Mesgari, “Improved biogeography-based optimization using migration process adjustment: An approach for location-allocation of ambulances,” Comput. Ind. Eng., vol. 135, pp. 800-813, Sept. 2019.
[24] B. R. Sarker, B. Wu, and K. P. Paudel, “Optimal number and location of storage hubs and biogas production reactors in farmland with allocation of multiple feedstocks,” Appl. Math. Model., vol. 55, pp. 447-465, Mar. 2018.
[25] Y. Lin, H. Jia, Y. Yang, G. Tian, F. Tao, and L. Ling, “An improved artificial bee colony for facility allocation problem of end-of-life vehicles recovery network,” J. Clean. Prod., vol. 205, pp. 134-144, Dec. 2018.
[26] F. Barzinpour and V. Esmaeilli, “A multi-objective relief chain location distribution model for urban disaster management,” Int. J. Adv. Manuf. Technol., vol. 70, pp. 1291-1302, Feb. 2014.
[27] B. Sharma, M. Ramkumar, N. Subramanian, and B. Malhotra, “Dynamic temporary blood facility location-allocation during and post-disaster periods,” Ann. Oper. Res., 2017.
[28] J. H. Halland, “Genetic Algorithms,” Sci. Am., vol. 267, pp. 66-72, 1992.
[29] Location Routing Problem, June 2019. (Online). Available: http://fc.isima.fr/~lacomme/lrp/lrp.html
Vol:15 No:04 2021Vol:15 No:03 2021Vol:15 No:02 2021Vol:15 No:01 2021
Vol:14 No:12 2020Vol:14 No:11 2020Vol:14 No:10 2020Vol:14 No:09 2020Vol:14 No:08 2020Vol:14 No:07 2020Vol:14 No:06 2020Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007