Skip to main content
Erschienen in: Journal of Applied Mathematics and Computing 1-2/2013

01.07.2013 | Applied mathematics

Successive computation of some efficient locations of the Weber problem with barriers

verfasst von: Ivan P. Stanimirović

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1-2/2013

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We transform a continuous Weber problem with barriers to a discrete problem by computing some efficient locations, which are considered as promising locations for a new facility. A theorem determining conditions for a location to be efficient is introduced. A method for constructing the weighted coefficients and travel costs modeled by some distance metrics, is derived. This method provides successive computation of some efficient locations. Also, we propose an algorithm for the verification of location’s efficiency. Numerical examples are provided using squared Euclidean and Manhattan distance metrics, as well as the implementation details in programming package MATHEMATICA.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
1.
Zurück zum Zitat Aneja, P.Y., Parlar, M.: Algorithms for Weber facility location in the presence of forbidden regions and/or barriers to travel. Transp. Sci. 28, 70–76 (1994) MATHCrossRef Aneja, P.Y., Parlar, M.: Algorithms for Weber facility location in the presence of forbidden regions and/or barriers to travel. Transp. Sci. 28, 70–76 (1994) MATHCrossRef
2.
Zurück zum Zitat Bischoff, M., Klamroth, K.: An efficient solution method for Weber problem with barriers based on genetic algorithms. Eur. J. Oper. Res. 177, 22–41 (2007) MathSciNetMATHCrossRef Bischoff, M., Klamroth, K.: An efficient solution method for Weber problem with barriers based on genetic algorithms. Eur. J. Oper. Res. 177, 22–41 (2007) MathSciNetMATHCrossRef
3.
Zurück zum Zitat Bischoff, M., Fleischmann, T., Klamroth, K.: The multi-facility location–allocation problem with polyhedral barriers. Comput. Oper. Res. 36, 1376–1392 (2009) MathSciNetMATHCrossRef Bischoff, M., Fleischmann, T., Klamroth, K.: The multi-facility location–allocation problem with polyhedral barriers. Comput. Oper. Res. 36, 1376–1392 (2009) MathSciNetMATHCrossRef
4.
Zurück zum Zitat Brimberg, J., Mehrez, A.: Multi-facility location using a maximin criterion and rectangular distances. Location Sci. 2, 11–19 (1994) MATH Brimberg, J., Mehrez, A.: Multi-facility location using a maximin criterion and rectangular distances. Location Sci. 2, 11–19 (1994) MATH
5.
Zurück zum Zitat Butt, S.E., Cavalier, T.M.: An efficient algorithm for facility location in the presence of forbidden regions. Eur. J. Oper. Res. 90, 56–70 (1996) MATHCrossRef Butt, S.E., Cavalier, T.M.: An efficient algorithm for facility location in the presence of forbidden regions. Eur. J. Oper. Res. 90, 56–70 (1996) MATHCrossRef
6.
Zurück zum Zitat Chen, R.: Location problems with costs being sums of powers of Euclidean distances. Comput. Oper. Res. 11, 285–294 (1984) MATHCrossRef Chen, R.: Location problems with costs being sums of powers of Euclidean distances. Comput. Oper. Res. 11, 285–294 (1984) MATHCrossRef
7.
Zurück zum Zitat Dearing, P.M., Klamroth, K., Seargs, R. Jr.: Planar location problems with block distance and barriers. Ann. Oper. Res. 136, 117–143 (2005) MathSciNetMATHCrossRef Dearing, P.M., Klamroth, K., Seargs, R. Jr.: Planar location problems with block distance and barriers. Ann. Oper. Res. 136, 117–143 (2005) MathSciNetMATHCrossRef
8.
9.
Zurück zum Zitat Hamacher, H., Klamroth, K.: Planar location problems with barriers under polyhedral gauges. Ann. Oper. Res. 96, 191–208 (2000) MathSciNetMATHCrossRef Hamacher, H., Klamroth, K.: Planar location problems with barriers under polyhedral gauges. Ann. Oper. Res. 96, 191–208 (2000) MathSciNetMATHCrossRef
10.
11.
Zurück zum Zitat Katz, I.N., Cooper, L.: Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle. Eur. J. Oper. Res. 6, 166–173 (1981) MathSciNetMATHCrossRef Katz, I.N., Cooper, L.: Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle. Eur. J. Oper. Res. 6, 166–173 (1981) MathSciNetMATHCrossRef
13.
14.
Zurück zum Zitat Klamroth, K.: Single-Facility Location Problems with Barriers. Springer Series in Operation Research. Springer, Berlin (2002) MATH Klamroth, K.: Single-Facility Location Problems with Barriers. Springer Series in Operation Research. Springer, Berlin (2002) MATH
15.
16.
Zurück zum Zitat Luis, M., Salhi, S., Nagy, G.: Region-rejection based heuristics for the capacitated multi-source Weber problem. Comput. Oper. Res. 36, 2007–2017 (2009) MATHCrossRef Luis, M., Salhi, S., Nagy, G.: Region-rejection based heuristics for the capacitated multi-source Weber problem. Comput. Oper. Res. 36, 2007–2017 (2009) MATHCrossRef
17.
Zurück zum Zitat Nickel, S.: Discretization of Planar Location Problems. Verlag Shaker, Aachen (1995) Nickel, S.: Discretization of Planar Location Problems. Verlag Shaker, Aachen (1995)
18.
Zurück zum Zitat Stanimirović, P.S., Stanimirović, I.P.: Implementation of polynomial multi-objective optimization in MATHEMATICA. Struct. Multidiscip. Optim. 36, 411–428 (2008) CrossRef Stanimirović, P.S., Stanimirović, I.P.: Implementation of polynomial multi-objective optimization in MATHEMATICA. Struct. Multidiscip. Optim. 36, 411–428 (2008) CrossRef
19.
20.
Zurück zum Zitat Wesolowsky, G.: The Weber problem: History and perspectives. Location Sci. 1, 5–23 (1993) MATH Wesolowsky, G.: The Weber problem: History and perspectives. Location Sci. 1, 5–23 (1993) MATH
21.
Zurück zum Zitat Wolfram, S.: The MATHEMATICA Book, 5th edn. Wolfram Media/Cambridge University Press, Champaign (2003). Wolfram, S.: The MATHEMATICA Book, 5th edn. Wolfram Media/Cambridge University Press, Champaign (2003).
Metadaten
Titel
Successive computation of some efficient locations of the Weber problem with barriers
verfasst von
Ivan P. Stanimirović
Publikationsdatum
01.07.2013
Verlag
Springer-Verlag
Erschienen in
Journal of Applied Mathematics and Computing / Ausgabe 1-2/2013
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-012-0637-x

Weitere Artikel der Ausgabe 1-2/2013

Journal of Applied Mathematics and Computing 1-2/2013 Zur Ausgabe