Skip to main content
Top
Published in: Soft Computing 13/2019

02-04-2018 | Methodologies and Application

Bi-objective location problem with balanced allocation of customers and Bernoulli demands: two solution approaches

Authors: Saber Shiripour, Nezam Mahdavi-Amiri

Published in: Soft Computing | Issue 13/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference 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–55CrossRefMATH 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–55CrossRefMATH
go back to reference Albareda-Sambola M, Fernańdez E, Saldanha-da-Gama F (2011) The facility location problem with Bernoulli demands. Omega 39:335–345CrossRef Albareda-Sambola M, Fernańdez E, Saldanha-da-Gama F (2011) The facility location problem with Bernoulli demands. Omega 39:335–345CrossRef
go back to reference 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–487MathSciNetCrossRefMATH 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–487MathSciNetCrossRefMATH
go back to reference 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–2280CrossRef 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–2280CrossRef
go back to reference Bongartz I, Calamai PH, Conn AR (1994) A projection method for lp norm location-allocation problems. Math Program 66:283–312CrossRefMATH Bongartz I, Calamai PH, Conn AR (1994) A projection method for lp norm location-allocation problems. Math Program 66:283–312CrossRefMATH
go back to reference Boukani FH, Moghaddam BF, Pishvaee MS (2014) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 76:1091–1110MATH Boukani FH, Moghaddam BF, Pishvaee MS (2014) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 76:1091–1110MATH
go back to reference 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–371CrossRef 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–371CrossRef
go back to reference Cortinhal MJ, Captivo ME (2003) Upper and lower bounds for the single source capacitated location problem. Eur J Oper Res 51(151):333MathSciNetCrossRefMATH Cortinhal MJ, Captivo ME (2003) Upper and lower bounds for the single source capacitated location problem. Eur J Oper Res 51(151):333MathSciNetCrossRefMATH
go back to reference Current J, Daskin M, Schilling D (2002) Discrete network location models. In: In Drezner Z, Hamacher HW (eds) Facility location: applications and theory‘. Springer, Berlin, pp 81–118CrossRef Current J, Daskin M, Schilling D (2002) Discrete network location models. In: In Drezner Z, Hamacher HW (eds) Facility location: applications and theory‘. Springer, Berlin, pp 81–118CrossRef
go back to reference Drezner T, Drezner Z, Guyse J (2009) Equitable service by a facility: minimizing the Gini coefficient. Comput Oper Res 36:3240–3246CrossRefMATH Drezner T, Drezner Z, Guyse J (2009) Equitable service by a facility: minimizing the Gini coefficient. Comput Oper Res 36:3240–3246CrossRefMATH
go back to reference Eiselt HA, Laporte G (1995) Objectives in location problems. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, Berlin Eiselt HA, Laporte G (1995) Objectives in location problems. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, Berlin
go back to reference Erkut E (1993) Inequality measures for location problems. Locat Sci 1:199–217MATH Erkut E (1993) Inequality measures for location problems. Locat Sci 1:199–217MATH
go back to reference Galvao RD, Espejo LGA, Boffey B, Yates D (2006) Load balancing and capacity constraints in a hierarchical location model. Eur J Oper Res 172:631–646CrossRefMATH Galvao RD, Espejo LGA, Boffey B, Yates D (2006) Load balancing and capacity constraints in a hierarchical location model. Eur J Oper Res 172:631–646CrossRefMATH
go back to reference Ghosh A, Rushton G (1987) Spatial analysis and location-allocation models. Van Nostrand Reinhold Company, New York Ghosh A, Rushton G (1987) Spatial analysis and location-allocation models. Van Nostrand Reinhold Company, New York
go back to reference Hakimi S (1964) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(1):462–475MathSciNetMATH Hakimi S (1964) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13(1):462–475MathSciNetMATH
go back to reference Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territory design approach—applications, algorithms and GIS integration. TOP 13:1–56MathSciNetCrossRefMATH Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territory design approach—applications, algorithms and GIS integration. TOP 13:1–56MathSciNetCrossRefMATH
go back to reference Kalyanmoy D (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley interscience series in systems and optimization. Wiley, HobokenMATH Kalyanmoy D (2001) Multi-objective optimization using evolutionary algorithms, vol 16. Wiley interscience series in systems and optimization. Wiley, HobokenMATH
go back to reference Karp R (1972) Reducibility among combinatorial problems. Plenum, New York, pp 85–104 Karp R (1972) Reducibility among combinatorial problems. Plenum, New York, pp 85–104
go back to reference Kozanidis G (2009) Solving the linear multiple choice knapsack problem with two objectives: profit and equity. Comput Optim Appl 43:261–294MathSciNetCrossRefMATH Kozanidis G (2009) Solving the linear multiple choice knapsack problem with two objectives: profit and equity. Comput Optim Appl 43:261–294MathSciNetCrossRefMATH
go back to reference Louveaux F (1993) Stochastic location analysis. Locat Sci 1:127–54MATH Louveaux F (1993) Stochastic location analysis. Locat Sci 1:127–54MATH
go back to reference 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–163MathSciNetCrossRefMATH 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–163MathSciNetCrossRefMATH
go back to reference Marsh MT, Schilling DA (1994) Equity measurement in facility location analysis: a review and framework. Eur J Oper Res 74:1–17CrossRefMATH Marsh MT, Schilling DA (1994) Equity measurement in facility location analysis: a review and framework. Eur J Oper Res 74:1–17CrossRefMATH
go back to reference Mavrotas G (2009) Effective implementation of the e-constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455–465MathSciNetMATH Mavrotas G (2009) Effective implementation of the e-constraint method in multi-objective mathematical programming problems. Appl Math Comput 213:455–465MathSciNetMATH
go back to reference Mousavi M, Niaki T (2013) Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm. Appl Math Model 37:5109–5119MathSciNetCrossRefMATH Mousavi M, Niaki T (2013) Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm. Appl Math Model 37:5109–5119MathSciNetCrossRefMATH
go back to reference 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–1912MathSciNetCrossRefMATH 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–1912MathSciNetCrossRefMATH
go back to reference 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–87 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–87
go back to reference Park G, Lee Y, Han J (2014) A two-level location-allocation problem in designing local access fiber optic networks. Comput Oper Res 51:52–63MathSciNetCrossRefMATH Park G, Lee Y, Han J (2014) A two-level location-allocation problem in designing local access fiber optic networks. Comput Oper Res 51:52–63MathSciNetCrossRefMATH
go back to reference 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–159CrossRef 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–159CrossRef
go back to reference 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–122CrossRefMATH 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–122CrossRefMATH
go back to reference Snyder LV (2006) Facility location under uncertainty: a review. IIE Trans 38:537–54CrossRef Snyder LV (2006) Facility location under uncertainty: a review. IIE Trans 38:537–54CrossRef
go back to reference Weber A (1909) ubre den standort der Industrien, 1909; translated as Alfred Weber’s theory of the Location of Industries. University of Chicago press, Chicago Weber A (1909) ubre den standort der Industrien, 1909; translated as Alfred Weber’s theory of the Location of Industries. University of Chicago press, Chicago
go back to reference Yesilkokcen GN, Wesolowsky GO (1998) A branch-and-bound algorithm for the supply connected location-allocation problem on networks. Locat Sci 6:395–415CrossRef Yesilkokcen GN, Wesolowsky GO (1998) A branch-and-bound algorithm for the supply connected location-allocation problem on networks. Locat Sci 6:395–415CrossRef
go back to reference Zanjirani-Farahani R, Hekmatfar M (eds) (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, Berlin Zanjirani-Farahani R, Hekmatfar M (eds) (2009) Facility location: concepts, models, algorithms and case studies. Physica-Verlag, Berlin
go back to reference 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–150CrossRef 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–150CrossRef
go back to reference Zhou J, Liu B (2003) New stochastic models for capacitated location-allocation problem. Comput Ind Eng 45(1):111–125CrossRef Zhou J, Liu B (2003) New stochastic models for capacitated location-allocation problem. Comput Ind Eng 45(1):111–125CrossRef
go back to reference Zhou J, Liu B (2007) Modeling capacitated location-allocation problem with fuzzy demands. Comput Ind Eng 53(3):454–468CrossRef Zhou J, Liu B (2007) Modeling capacitated location-allocation problem with fuzzy demands. Comput Ind Eng 53(3):454–468CrossRef
Metadata
Title
Bi-objective location problem with balanced allocation of customers and Bernoulli demands: two solution approaches
Authors
Saber Shiripour
Nezam Mahdavi-Amiri
Publication date
02-04-2018
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 13/2019
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-018-3163-4

Other articles of this Issue 13/2019

Soft Computing 13/2019 Go to the issue

Premium Partner