nach oben

Erschienen in:

2015 | OriginalPaper | Buchkapitel

18. Demand Point Aggregation for Some Basic Location Models

verfasst von : Richard L. Francis, Timothy J. Lowe

Erschienen in: Location Science

Verlag: Springer International Publishing

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

Location problems occurring in urban or regional settings may involve many tens of thousands of “demand points,” usually individual residences. In modeling such problems it is common to aggregate demand points to obtain tractable models. We discuss aggregation approaches to a large class of location models, consider various aggregation error measures, and identify some effective measures. In particular, we focus on an upper bounding methodology for the error associated with aggregation. The chapter includes an example application.

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren

Vorheriges Kapitel Stochastic Location Models with Congestion

Nächstes Kapitel Location and GIS

Agarwal PK, Varadarajan KR (1999) Approximation algorithms for bipartite and nonbipartite matchings in the plane. In: 10th ACM-SIAM symposium on discrete algorithms (SODA), pp 805–814

Agarwal PK, Efrat A, Sharir M (1999) Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J Comput 29:912–953CrossRef

Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications, exercise 12.23. Prentice-Hall, Englewood Cliffs, p 505

Bender T, Hennes H, Kalcsics J, Melo T, Nickel S (2001) Location software and interface with GIS and supply chain management. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, Berlin

Casillas PA (1987) Data aggregation and the p-median problem in continuous space. In: Ghosh A, Rushton G (eds) Spatial analysis and location-allocation models. Van Nostrand Reinhold Publishers, New York, pp 227–244

Chelst KR, Schultz JP, Sanghvi N (1988) Issues and decision aids for designing branch networks. J Retail Bank 10:5–17

Daskin MS (2013) Network and discrete location: models, algorithms, and applications, 2nd edn. Wiley, HobokenCrossRef

Daskin MS, Haghani AE, Khanal M, Malandraki C (1989) Aggregation effects in maximum covering models. Ann Oper Res 18:115–139CrossRef

Dekle J, Lavieri M, Martin E, Emir-Farinas H, Francis RL (2005) A Florida county locates disaster recovery centers. Interfaces 35:133–139CrossRef

Domich PD, Hoffman KL, Jackson RHF, McClain MA (1991) Locating tax facilities: a graphics-based microcomputer optimization model. Manag Sci 37:960–979CrossRef

Drezner Z (ed) (1995) Facility location: a survey of applications and methods. Springer, Berlin

Drezner Z, Hamacher HW (eds) (2002) Facility location: theory and algorithms. Springer, Berlin

Dyer M, Frieze A (1985) A simple heuristic for the p-center problem. Oper Res Lett 3:285–288CrossRef

Efrat A, Itai A, Katz MJ (2001) Geometry helps in bottleneck matching and related problems. Algorithmica 31:1–28CrossRef

Erkut E, Bozkaya B (1999) Analysis of aggregation errors for the p-median problem. Comput Oper Res 26:1075–1096CrossRef

Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40:275–291CrossRef

Ernst A, Hamacher HW, Jiang HW, Krishnamorthy M, Woeginger G (2002a) Uncapacitated single and multiple allocation p-hub center problems. Report CSIRO, Melbourne

Ernst A, Hamacher HW, Jiang HW, Krishnamorthy M, Woeginger G (2002b) Heuristic algorithms for the uncapacitated hub center single allocation problem. Report CSIRO, Melbourne

Francis RL, Lowe TJ (1992) On worst-case aggregation analysis for network location problems. Ann Oper Res 40:229–246CrossRef

Francis RL, White JA (1974) Facility layout and location: an analytical approach, problem 7.25. Prentice-Hall, Englewood Cliffs, p 324

Francis RL, McGinnis LF, White JA (1992) Facility layout and location: an analytical approach, 2nd edn. Prentice-Hall, Englewood Cliffs

Francis RL, Lowe TJ, Rushton G, Rayco MB (1999) A synthesis of aggregation methods for multi-facility location problems: strategies for containing error. Geogr Anal 31:67–87

Francis RL, Lowe TJ, Tamir A (2000) On aggregation error bounds for a class of location models. Oper Res 48:294–307CrossRef

Francis RL, Lowe TJ, Rayco MB, Tamir A (2003) Exploiting self-canceling demand point aggregation error for some planar rectilinear median problems. Nav Res Logist 50:614–637CrossRef

Francis RL, Lowe TJ, Tamir A (2004a) Demand point aggregation analysis for a class of constrained location models: a penalty function approach. IIE Trans 36:601–609CrossRef

Francis RL, Lowe TJ, Tamir A, Emir-Farinas H (2004b) Aggregation decomposition and aggregation guidelines for a class of minimax and covering location models. Geogr Anal 36:332–349CrossRef

Francis RL, Lowe TJ, Tamir A, Emir-Farinas H (2004c) A framework for demand point and solution space aggregation analysis for location models. Eur J Oper Res 159:574–585CrossRef

Francis RL, Rayco MB, Lowe TJ, Tamir A (2009) Aggregation error for location models: survey and analysis. Ann Oper Res 167:171–208CrossRef

Gavriliouk EO (2003) Aggregation in hub location models. M.Sc. thesis, Department of Mathematics, Clemson University, Clemson

Geoffrion A (1977) Objective function approximations in mathematical programming. Math Prog 13:23–37CrossRef

Goldberg R (1976) Methods of real analysis, 2nd edn. Wiley, New York

Hakimi SL (1965) Optimum location of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459CrossRef

Handler GY, Mirchandani PB (1979) Location on networks: theory and algorithms. The MIT Press, Cambridge

Hillsman EL, Rhoda R (1978) Errors in measuring distances from populations to service centers. Ann Reg Sci 12:74–88CrossRef

Hooker JN, Garfinkel RS, Chen CK (1991) Finite dominating sets for network location problems. Oper Res 39:100–118CrossRef

Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems: part 1, the p-centers; part 2, the p-medians. SIAM J Appl Math 37:513–560CrossRef

Kolen A, Tamir A (1990) Covering problems. In: Mirchandani PB, Francis RL (eds) Discrete location theory. Wiley-Interscience, New York, pp 263–304

Love R, Morris J, Wesolowsky G (1988) Facility location: models and methods. North-Holland Publishers, Amsterdam

Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:182–196CrossRef

Mirchandani PB, Francis RL (eds) (1990) Discrete location theory. Wiley-Interscience, New York

Murray AT, Gottsegen JM (1997) The influence of data aggregation on the stability of p-median location model solutions. Geogr Anal 29:200–213CrossRef

Nickel S, Puerto J (2005) Location theory: a unified approach. Springer, Berlin

Pardalos PM, Resende M (eds) (2002) Handbook of applied optimization. Oxford University Press, Oxford

Plastria F (2000) New error bounds in continuous minisum location for aggregation at the gravity centre. Stud Locat Anal 14:101–119

Plastria F (2001) On the choice of aggregation points for continuous p-median problems: a case for the gravity center. TOP 9:217–242CrossRef

Reeves C (1993) Modern heuristic techniques for combinatorial problems. Blackwell Scientific Press, Oxford

Resende MGC, de Sousa JP (eds) (2004) Metaheuristics: computer decision-making. Kluwer Academic Press, Boston

Sheffi Y (1985) Urban transportation networks: equilibrium analysis with mathematical programming models. Prentice-Hall, Englewood Cliffs, pp 14–16

Varadarajan KR (1998) A divide and conquer algorithm for min-cost perfect matching in the plane. In: Proceedings 38th annual IEEE symposium on foundations of computer sciences, pp 320−331

Titel: Demand Point Aggregation for Some Basic Location Models
verfasst von: Richard L. Francis
Timothy J. Lowe
Verlag: Springer International Publishing
Buch: Location Science
Print ISBN: 978-3-319-13110-8

Electronic ISBN: 978-3-319-13111-5

Copyright-Jahr: 2015
DOI: https://doi.org/10.1007/978-3-319-13111-5_18

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"