A bi-objective stochastic capacitated multi-facility location–allocation problem is presented where the customer demands have Bernoulli distributions. The capacity of a facility for accepting customers is limited so that if the number of allocated customers to the facility is more than its capacity, a shortage will occur. The problem is formulated as a bi-objective mathematical programming model. The first objective is to find optimal locations of facilities among potential locations and optimal allocations of stochastic customers to the facilities so that the total sum of fixed costs of establishment of the facilities and the expected values of servicing and shortage costs is minimized. The second objective is to balance the number of allocated customers to the facilities. To solve small problems, the augmented \(\varepsilon \)-constraint method is used. Also, two metaheuristic solution approaches, non-dominated sorting genetic algorithm II (NSGA-II) and controlled elitist non-dominated sorting genetic algorithm II (CNSGA-II), are presented for solving large problems. Several sample problems are generated and with various criteria are tested to show the performance of the proposed model and the solution approaches.
Capacitated location–allocation problem Bi-objective model Stochastic demands Augmented \(\varepsilon \)-constraint method Metaheuristic algorithm
This is a preview of subscription content, log in to check access
The first author acknowledges University of Garmsar and the second author thanks Sharif University of Technology for supporting this work.
Compliance with ethical standards
Conflict of interest
All authors declares that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
Albareda-Sambola M, Fernańdez E, Laporte G (2007) Heuristic and lower bounds for a stochastic location routing problem. Eur J Oper Res 179:940–55CrossRefMATHGoogle Scholar
Albareda-Sambola M, Fernańdez E, Saldanha-da-Gama F (2011) The facility location problem with Bernoulli demands. Omega 39:335–345CrossRefGoogle Scholar
Albareda-Sambola M, VanderVlerk MH, Fernańdez E (2006) Exact solutions to a class of stochastic generalized assignment problems. Eur J Oper Res 173:465–487MathSciNetCrossRefMATHGoogle Scholar
Alizadeha M, Mahdavi I, Mahdavi-Amiri N, Shiripour S (2016) Modeling and solving a capacitated stochastic location-allocation problem using sub-sources. Soft Comput 20(6):2261–2280CrossRefGoogle Scholar
Bongartz I, Calamai PH, Conn AR (1994) A projection method for lp norm location-allocation problems. Math Program 66:283–312CrossRefMATHGoogle Scholar
Boukani FH, Moghaddam BF, Pishvaee MS (2014) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 76:1091–1110MATHGoogle Scholar
Bozorgi-Amiri A, Jabalameli MS, Alinaghian M, Heydari M (2012) A modified particle swarm optimization for disaster relief logistics under uncertain environment. Int J Adv Manuf Technol 60(1–4):357–371CrossRefGoogle Scholar
Marín A, Nickel S, Velten S (2010) An extended covering model for flexible discrete and equity location problems. Math Methods Oper Res 71:125–163MathSciNetCrossRefMATHGoogle Scholar
Marsh MT, Schilling DA (1994) Equity measurement in facility location analysis: a review and framework. Eur J Oper Res 74:1–17CrossRefMATHGoogle Scholar
Mavrotas G (2009) Effective implementation of the e-constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455–465MathSciNetMATHGoogle Scholar
Mousavi M, Niaki T (2013) Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm. Appl Math Model 37:5109–5119MathSciNetCrossRefGoogle Scholar
Mousavi M, Niaki T, Mehdizadeh E, Tavarroth M (2013) The capacitated multi-facility location-allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms. Int J Syst Sci 44(3):1897–1912MathSciNetCrossRefMATHGoogle Scholar
Murali P, Ordóñez F, Dessouky MM (2012) Facility location under demand uncertainty: response to a large-scale bio-terror attack. Socio Econ Plan Sci 46(1):78–87Google Scholar
Rahmaniani R, Rahmaniani G, Jabbarzadeh A (2014) Variable neighborhood search based evolutionary algorithm and several approximations for balanced location-allocation design problem. Int J Adv Manuf Technol 72:145–159CrossRefGoogle Scholar
Shiripour S, Mahdavi-Amiri N, Mahdavi I (2017) A transportation network model with intelligent probabilistic travel times and two hybrid algorithms. Transp Lett 9(2):90–122CrossRefMATHGoogle Scholar
Weber A (1909) ubre den standort der Industrien, 1909; translated as Alfred Weber’s theory of the Location of Industries. University of Chicago press, ChicagoGoogle Scholar
Yesilkokcen GN, Wesolowsky GO (1998) A branch-and-bound algorithm for the supply connected location-allocation problem on networks. Locat Sci 6:395–415CrossRefGoogle Scholar
Zanjirani-Farahani R, Hekmatfar M (eds) (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, BerlinGoogle Scholar
Zarrinpoor N, Fallahnezhad MS, Pishvaee MS (2017) Design of a reliable hierarchical location-allocation model under disruptions for health service networks: a two-stage robust approach. Comput Ind Eng 109:130–150CrossRefGoogle Scholar
Zhou J, Liu B (2003) New stochastic models for capacitated location-allocation problem. Comput Ind Eng 45(1):111–125CrossRefGoogle Scholar
Zhou J, Liu B (2007) Modeling capacitated location-allocation problem with fuzzy demands. Comput Ind Eng 53(3):454–468CrossRefGoogle Scholar