Thematische Bibliographien / Locational problems

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Locational problems“

Autor: Grafiati
Veröffentlicht am 18. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Locational problems" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Locational problems"

1

Okabe, Atsuyuki, und Atsuo Suzuki. „Locational optimization problems solved through Voronoi diagrams“. European Journal of Operational Research 98, Nr. 3 (Mai 1997): 445–56. http://dx.doi.org/10.1016/s0377-2217(97)80001-x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Tellier, L. N. „From the Weber Problem to a ‘Topodynamic’ Approach to Locational Systems“. Environment and Planning A: Economy and Space 24, Nr. 6 (Juni 1992): 793–806. http://dx.doi.org/10.1068/a240793.

Der volle Inhalt der Quelle
Annotation:
In any given space, a sequence of interdependent Weber problems of a certain type leads to a pattern of locations which can be mathematically characterized. Conversely, the observed evolution of a given locational system corresponds to certain characteristics of an analogous Weberian locational system. Determining such characteristics leads to the simulating and forecasting of the evolution of the observed locational system. A model corresponding to such a ‘topodynamic’ approach is presented and an application is made. Three different effects are integrated into the model: an interdependency effect which determines the polarization level; an ‘attraction — repulsion’ effect which determines the center — periphery equilibrium; and a distance deterrence effect which determines the diffusion process and the inertia level.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Cromley, Ellen K. „LOCATIONAL PROBLEMS AND PREFERENCES IN PRESCHOOL CHILD CARE“. Professional Geographer 39, Nr. 3 (August 1987): 309–17. http://dx.doi.org/10.1111/j.0033-0124.1987.00309.x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Delorme, Xavier, Alexandre Dolgui und Alexander Kolokolov. „Complex Optimization Problems in Locational Analysis and Scheduling“. Journal of Mathematical Modelling and Algorithms in Operations Research 12, Nr. 2 (01.08.2012): 101–3. http://dx.doi.org/10.1007/s10852-012-9197-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Carrizosa, Emilio, und Frank Plastria. „Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints“. Top 6, Nr. 2 (Dezember 1998): 179–94. http://dx.doi.org/10.1007/bf02564786.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Barmish, B. Ross, und Tamer Basar. „Characterization and uniqueness of equilibria in locational choice problems“. Mathematical Modelling 8 (1987): 664–69. http://dx.doi.org/10.1016/0270-0255(87)90665-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Scott, A. J. „OPTIMAL DECISION PROCESSES FOR A CLASS OF DYNAMIC LOCATIONAL PROBLEMS†“. Papers in Regional Science 26, Nr. 1 (14.01.2005): 25–35. http://dx.doi.org/10.1111/j.1435-5597.1971.tb01490.x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Pelegrin, B., und F. R. Fernandez. „Determination of efficient solutions for point-objective locational decision problems“. Annals of Operations Research 18, Nr. 1 (Dezember 1989): 93–102. http://dx.doi.org/10.1007/bf02097797.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Weckx, Sam, Reinhilde D'hulst und Johan Driesen. „Locational Pricing to Mitigate Voltage Problems Caused by High PV Penetration“. Energies 8, Nr. 5 (21.05.2015): 4607–28. http://dx.doi.org/10.3390/en8054607.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Allen, Ryan. „The Distribution and Evolution of Physical Neighborhood Problems during the Great Recession“. City & Community 12, Nr. 3 (September 2013): 260–79. http://dx.doi.org/10.1111/cico.12025.

Der volle Inhalt der Quelle
Annotation:
While the Great Recession had clear effects on economic growth, unemployment, and household wealth and earnings in the United States, it also likely affected the quality of neighborhoods. Situated in the literature on locational attainment and economic shocks, this research considers how a national economic crisis affects physical neighborhood problems and existing disparities between minority and white households in experiencing these problems (e.g., street disrepair, trash, abandoned buildings, window bars). Results indicate that neighborhood problems increased between 2005 and 2009 and large and persistent disparities existed between some minority groups and white non–Hispanics in experiencing these problems, even after controlling for potentially confounding factors. However, there is little support for the idea that disparities between minorities and white non–Hispanics in experiencing neighborhood problems increased during this time. These research findings suggest that large and pervasive shocks, such as an economic recession, can influence locational attainment by changing neighborhood quality in absolute terms but may not affect the relative hierarchy of place.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Locational problems"

1

Chakraborti, Nisith Ranjan. „Solution of certain locational problems arising in L1 Norms“. Thesis, University of North Bengal, 1994. http://hdl.handle.net/123456789/598.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Hussein, E. A. „Dual-based methods for some covering problems in locational analysis“. Thesis, University of Liverpool, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356269.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Ross, Kim A. „The locational history of Scotland's district lunatic asylums, 1857-1913“. Thesis, University of Glasgow, 2014. http://theses.gla.ac.uk/5320/.

Der volle Inhalt der Quelle
Annotation:
This thesis looks into the later ‘Asylum Age’ in Scotland, concentrating on the legislation and construction of Scotland’s district lunatic asylums from the passing of the Lunacy (Scotland) Act, 1857 to the Mental Deficiency and Lunacy (Scotland) Act, 1913. Concentrating on the specific geographies of the asylums, what Foucault refers to as “the space reserved by society for insanity” (Foucault, 1965:251), the thesis weaves a new route between previous radical/critical and progressive/simplistic interpretations of the ‘Asylum Age’, by integrating a Foucauldian interpretation with non-representational theories around the engineering of affective atmospheres. This more nuanced approach, which concentrates on the ‘affective power’ of the institutions across different geographical scales (site and situation, grounds and buildings), recognises the ways in which Scotland’s district asylums, constructed predominantly for pauper patients, were moulded and reshaped as the discourses around the treatment of insanity were developed. The moral, medical and hygienic dimensions to the discourses ultimately outlined the institutional geography, by having a profound influence on asylum location and layout. The ideal district ‘blueprint’ for asylum siting and design, as put forward by the Scottish Lunacy Commissioners, is uncovered and reconstructed by ‘picking out’ the macro and micro-geographies discussed in the annual reports of the General Board. The research then moves to uncover the system ‘on the ground’ as it was constructed in bricks-and-mortar by the various district boards. As asylum location and architecture was a relatively novel concern, questions of siting and design became more pertinent, and indeed central, in institutional planning during the decades after the mid-century lunacy reforms. Thus, despite periods of waning enthusiasm for the institution as a mechanism for ‘curing’ insanity, fitting the building to its purposes continually involved a variety of structural innovations, stylistic refinements and new ways of organising the external and internal spaces of the asylums.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Davies, Amanda Catherine. „A case of community safety : displacing complex ‘social’ problems in Fortitude Valley“. Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/50961/1/Amanda_Davies_Thesis.pdf.

Der volle Inhalt der Quelle
Annotation:
Public dialogue regarding the high concentration of drug use and crime in inner city locations is frequently legitimised through visibility of drug-using populations and a perception of high crime rates. The public space known as the Brunswick Street Mall (Valley mall), located in the inner city Brisbane suburb of Fortitude Valley, has long provided the focal point for discussions regarding the problem of illicit drug use and antisocial behaviour in Brisbane. During the late 1990s a range of stakeholders in Fortitude Valley became mobilised to tackle crime and illicit drugs. In particular they wanted to dismantle popular perceptions of the area as representing the dark and unsafe side of Brisbane. The aim of this campaign was to instil a sense of safety in the area and dislodge Fortitude Valley from its reputation as a =symbolic location of danger‘. This thesis is a case study about an urban site that became contested by the diverse aims of a range of stakeholders who were invested in an urban renewal program and community safety project. This case study makes visible a number of actors that were lured from their existing roles in an indeterminable number of heterogeneous networks in order to create a community safety network. The following analysis of the community safety network emphasises some specific actors: history, ideas, technologies, materialities and displacements. The case study relies on the work of Foucault, Latour, Callon and Law to draw out the rationalities, background contingencies and the attempts to impose order and translate a number of entities into the community safety project in Fortitude Valley. The results of this research show that the community safety project is a case of ontological politics. Specifically the data indicates that both the (reality) problem of safety and the (knowledge) solution to safety were created simultaneously. This thesis explores the idea that while violence continues to occur in the Valley, evidence that community safety got done is located through mapping its displacement and eventual disappearance. As such, this thesis argues that community safety is a =collateral reality‘.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Thangavelu, Balajee. „Single-Facility location problem among two-dimensional existing facility locations“. Ohio University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1175283985.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Dias, Fábio Carlos Sousa. „Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica“. reponame:Repositório Institucional da UFC, 2008. http://www.repositorio.ufc.br/handle/riufc/17871.

Der volle Inhalt der Quelle
Annotation:
DIAS, Fábio Carlos Sousa. Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica. 2008. 81 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2008.
Submitted by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:13:52Z No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-06-22T17:16:23Z (GMT) No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5)
Made available in DSpace on 2016-06-22T17:16:23Z (GMT). No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5) Previous issue date: 2008
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to …nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between …xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to …nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e¢ ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
Neste trabalho, estudamos o problema de localização simples (SPLP - Simple Plant Location Problem). Usando a formulação matemática clássica e uma outra formulação proposta recentemente, desenvolvemos vários algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulação clássica, tais limites são obtidos utilizando o método de correção de dados e critérios de dominância entre os custos …xos e de transporte. Propomos uma projeção dessa formulação, que se mostrou computacionalmente atrativa. Usando a nova formulação propomos e mostramos a corretude de vários procedimentos iterativos que procuram encontrar uma solução para o problema, resolvendo uma seqüência de subproblemas paramétricos obtidos com a remoção de variáveis e restrições da formulação original. Em cada iteração desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxação lagrangeana a essa nova formulação para obter outros limites. Analisamos várias possibilidades de relaxação das restrições. Desenvolmento também algoritmos branch-and-bound baseados em ambas as formulações e nos limites obtidos. Avaliamos a e…ciência computacional de todos os algoritmos com instâncias de teste difíceis, disponíveis na literatura. Resultados computacionais e comparações com outros algoritmos da literatura são reportados.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Dias, FÃbio Carlos Sousa. „Algoritmos para o problema de localizaÃÃo simples baseados nas formulaÃÃes clÃssica e canÃnica“. Universidade Federal do CearÃ, 2008. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=2827.

Der volle Inhalt der Quelle
Annotation:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico
Neste trabalho, estudamos o problema de localizaÃÃo simples (SPLP - Simple Plant Location Problem). Usando a formulaÃÃo matemÃtica clÃssica e uma outra formulaÃÃo proposta recentemente, desenvolvemos vÃrios algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulaÃÃo clÃssica, tais limites sÃo obtidos utilizando o mÃtodo de correÃÃo de dados e critÃrios de dominÃncia entre os custos …xos e de transporte. Propomos uma projeÃÃo dessa formulaÃÃo, que se mostrou computacionalmente atrativa. Usando a nova formulaÃÃo propomos e mostramos a corretude de vÃrios procedimentos iterativos que procuram encontrar uma soluÃÃo para o problema, resolvendo uma seqÃÃncia de subproblemas paramÃtricos obtidos com a remoÃÃo de variÃveis e restriÃÃes da formulaÃÃo original. Em cada iteraÃÃo desse processo, podemos gerar limites inferiores e superiores. Aplicamos ainda relaxaÃÃo lagrangeana a essa nova formulaÃÃo para obter outros limites. Analisamos vÃrias possibilidades de relaxaÃÃo das restriÃÃes. Desenvolmento tambÃm algoritmos branch-and-bound baseados em ambas as formulaÃÃes e nos limites obtidos. Avaliamos a e…ciÃncia computacional de todos os algoritmos com instÃncias de teste difÃceis, disponÃveis na literatura. Resultados computacionais e comparaÃÃes com outros algoritmos da literatura sÃo reportados.
In this work, we study the Simple Plant Location Problem (SPLP). Using its classical mathematical programming formulation and another recently proposed formulation, we develop several algorithms to …nd lower and upper bounds for the problem as well as branch-and-bound algorithms. With the classical formulation, such bounds are obtained via the data correction method and dominance criteria between …xed and transportation costs. We propose a projection of this formulation that has shown to be computationally atractive. Using the new formulation, we propose and prove the correctness of several iterative procedures that attempt to …nd an optimal solution to the problem by solving a sequence of parametric sub-problems, each one obtained by removing some variables and constraints of the original formulation. At each iteration of this process, we can obtain lower and upper bounds. We also apply Lagrangean relaxation to this new formulation in order to get other bounds. We consider several possibilities of relaxing the constraints. In addition, we develop branch-and-bound algorithms based on both formulations and the obtained bounds. We evaluate the computational e ciency of all proposed algorithms with hard test instances from the literature. Computational results are reported and comparisons with other algorithms from the literature are carried out.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Wei, Hu. „SOLVING CONTINUOUS SPACE LOCATION PROBLEMS“. The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1205514715.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

San, Felice Mário César 1985. „Online facility location and Steiner problems = Problemas online de localização de instalações e de Steiner“. [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275552.

Der volle Inhalt der Quelle
Annotation:
Orientador: Orlando Lee
Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-27T12:18:11Z (GMT). No. of bitstreams: 1 SanFelice_MarioCesar_D.pdf: 1457706 bytes, checksum: 4813f4ed44c52462656d56537d73d5dc (MD5) Previous issue date: 2015
Resumo: Nesta tese estudamos problemas online das famílias de localização de instalações e de Steiner, através da abordagem de análise competitiva. O objetivo nestes problemas é construir uma rede de custo mínimo para atender a uma determinada demanda. Nós apresentamos resultados conhecidos para o problema Online da Localização de Instalações (OFL), o problema Online da Árvore de Steiner (OST) e o problema Online Single-Source Rent-or-Buy (OSRoB). O OFL consiste em atender a um conjunto de clientes, através da abertura de algumas instalações e da conexão de cada cliente com uma instalação aberta. O OST tem por objetivo conectar um conjunto de terminais utilizando uma árvore, que pode conter vértices não terminais, chamados vértices de Steiner. O OSRoB é uma versão rent-or-buy do OST, onde todos os terminais devem ser conectados a um nó especial chamado raíz. Os algoritmos e técnicas que apresentamos para estes problemas são importantes no desenvolvimento dos nossos algoritmos para os problemas que consideramos. Apresentamos novos resultados para o problema Online da Localização de Instalações com Coleta de Prêmios (OPFL), o problema Online da Árvore Estrela de Steiner (OSTS), e o problema Online da Localização de Instalações Conectadas (OCFL). O OPFL é uma generalização do OFL, em que alguns clientes podem ficar desconectados mediante o pagamento de penalidades. O OSTS é uma variante do OST, em que os vértices possuem custos não negativos. O OCFL é uma combinação do OFL e do OST, em que um conjunto de clientes precisa ser atendido através da abertura de algumas instalações, da conexão de cada cliente com uma instalação aberta, e da construção de uma árvore, mais custosa, que conecta as instalações abertas
Abstract: In this thesis we study online problems from the facility location and Steiner families, through the point of view of competitive analysis. The goal in these problems is to build a minimum cost network to attend a certain demand. We present known results for the Online Facility Location problem (OFL), the Online Steiner Tree problem (OST) and the Online Single-Source Rent-or-Buy problem (OSRoB). The OFL consists of serving a set of clients by opening some facilities and by connecting each client to a facility. The OST aims to connect a set of terminals in order to create a tree network, that may contain nonterminals, called Steiner nodes. The OSRoB is a rent-or-buy version of the OST, in which all terminals must be connected to a special node called root. The algorithms and techniques that we present for these problems play an important role in the design of our algorithms for the problems we consider. We present new results for the Online Prize-Collecting Facility Location problem (OPFL), the Online Steiner Tree Star problem (OSTS), and the Online Connected Facility Location problem (OCFL). The OPFL is a generalization of the OFL, in which some clients may be left unconnected by paying a penalty. The OSTS is a variant of the OST, in which the nodes have non-negative costs. The OCFL is a combination of the OFL and the OST, in which a set of clients needs to be served by opening some facilities, by connecting each client to a facility, and by creating a more expensive tree network that connects the open facilities
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Mazi, Abdullah Mazi E. „Combining heuristic and exact approach for the vertex p-centre problem and other related location problems“. Thesis, University of Kent, 2010. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.544027.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Locational problems"

1

Stochastic queue location problems. [S.l: s.n.], 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

H, Massam Bryan, und York University (Toronto, Ont.). Institute for Social Research., Hrsg. Complex location problems: Interdisciplinary approaches. [Downsview, Ont.]: Institute for Social Research, York University, 1988.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Eiselt, H. A., und Vladimir Marianov, Hrsg. Uncertainty in Facility Location Problems. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-32338-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Klamroth, Kathrin. Single-Facility Location Problems with Barriers. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/b98843.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Chhajed, Dilip. Solving structured multifacility location problems efficiently. [Urbana, Ill.]: College of Commerce and Business Administration, University of Illinois at Urbana-Champaign, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Rosenfield, Donald B. The retailer facility location problem. Cambridge, Mass: Massachusetts Institute of Technology, 1985.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Welch, Stephen Bernard. The obnoxious facility location problem. Birmingham: University of Birmingham, 1999.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Eiselt, H. A., und C. L. Sandblom. Decision Analysis, Location Models, and Scheduling Problems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24722-7.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Glen, John J. The capacitated dynamic facilities location problem. Edinburgh: University of Edinburgh. Department of BusinessStudies, 1988.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Concentrator location in telecommunications networks. New York: Springer, 2005.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Locational problems"

1

Kuhn, Harold W. „Locational Problems And Mathematical Programming“. In Mathematical Optimiation in Economics, 57–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11039-9_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Kalcsics, Jörg, und Roger Z. Ríos-Mercado. „Districting Problems“. In Location Science, 705–43. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_25.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Kalcsics, Jörg. „Districting Problems“. In Location Science, 595–622. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13111-5_23.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Campbell, James F., Andreas T. Ernst und Mohan Krishnamoorthy. „Hub Location Problems“. In Facility Location, 373–407. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-56082-8_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Plastria, Frank. „Continuous Location Problems“. In Facility Location, 225–62. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5355-6_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Berman, Oded, M. John Hodgson und Dmitry Krass. „Flow-Interception Problems“. In Facility Location, 389–426. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-5355-6_18.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Contreras, Ivan, und Morton O’Kelly. „Hub Location Problems“. In Location Science, 327–63. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Marín, Alfredo, und Mercedes Pelegrín. „p-Median Problems“. In Location Science, 25–50. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Alumur, Sibel A., und Tolga Bektaş. „Green Location Problems“. In Location Science, 591–610. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_20.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Çalık, Hatice, Martine Labbé und Hande Yaman. „p-Center Problems“. In Location Science, 51–65. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32177-2_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Locational problems"

1

Sharifi, Farid, Youmin Zhang und Brandon W. Gordon. „Voronoi-Based Coverage Control for Multi-Quadrotor UAVs“. In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48651.

Der volle Inhalt der Quelle
Annotation:
This paper investigates the problem of covering an environment using a group of quadrotor Unmanned Aerial Vehicles (UAVs) based on locational optimization techniques to assign Voronoi regions to vehicles. In comparison with the standard coverage control problems for single integrator agents, we design a planar position controller for UAVs to spread out over an environment to provide coverage. The stability of entire system is guaranteed using LaSalle’s invariance principle, and numerical simulation is provided to show the effectiveness of the proposed method.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Srivastava, Amber, und Srinivasa M. Salapaka. „Robustness Analysis for Simultaneous Resource Allocation and Route Optimization Problems“. In ASME 2017 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/dscc2017-5179.

Der volle Inhalt der Quelle
Annotation:
This paper presents the robustness analysis for an algorithm that solves simultaneous resource allocation and route optimization problem (SARO). These problems appear in the context of multi-hop routing applications in sensor networks, which require placement of multiple resource nodes and determining routes from each sensor location to a common data destination center via these resource nodes. In [1], we proposed an algorithm based on Maximum Entropy Principle that addressed the determination of locations of these resource nodes and the corresponding multi-hop routing problem such that the total communication cost is minimized. Such placement of resource nodes is sensitive to multiple parameters such as sensor locations, destination center location, communication costs between sensor and resource nodes, between resource nodes, and between resource nodes and destination center. This paper studies the sensitivity of the solution from the algorithm to these parameters. This robustness analysis is necessary since some of these parameters are typically not known precisely, the sensitivity analysis helps the network design by identifying the hierarchy in parameters in terms of how they affect the algorithm solution, and therefore also indicate how precisely these parameters need to be estimated. In this direction, we propose a modification of our algorithm to account for the uncertainty in sensor locations; here a probability distribution of sensor locations instead of their precise locations is assumed to be known. We also present and characterize a phase-transition aspect of the algorithm, where the number of distinct locations of resource nodes increase at certain critical values of annealing variable — a parameter in the algorithm. Simulations are provided that corroborate our analysis and instantiate relative sensitivities between different parameters.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Alzorba, Shaghaf, und Christian Günther. „Algorithms for multicriteria location problems“. In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756650.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Manjunatha, Hemanth, Jida Huang, Binbin Zhang und Rahul Rai. „A Sequential Sampling Algorithm for Multi-Stage Static Coverage Problems“. In ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-60305.

Der volle Inhalt der Quelle
Annotation:
It is critical in many system-engineering problems (such as surveillance, environmental monitoring, and cooperative task performance) to optimally allocate resources in the presence of limited resources. Static coverage problem is an important class of the resource allocation problems that focuses on covering an area of interest so that the activities in the area of interest can be detected/monitored with higher probability. In many practical settings (primarily due to financial constraints) a system designer has to allocate resources in multiple stages. In each stage, the system designer can assign a fixed number of resources (agents). In the multi-stage formulation, the agents locations for the next stage are dependent on all the agents location in the previous stages. Such multi-stage static coverage problems are non-trivial to solve. In this paper, we propose a robust and efficient sequential sampling algorithm to solve the multi-stage static coverage problem in the presence of probabilistic resource intensity allocation maps (RIAMs). The agents locations are determined by formulating this problem as an optimization problem in the successive stage . Three different objective functions are compared and discussed from the aspects of decreasing L2 difference and Sequential Minimum Energy Design (SMED). It is shown that utilizing SMED objective function leads to a better approximation of the RIAMs. Two heuristic algorithms, i.e. cuckoo search, and pattern search, are used as optimization algorithms. Numerical functions and real-life applications are provided to demonstrate the robustness and efficiency of the proposed approach.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Arghandeh, Reza, und Robert Broadwater. „Distributed Energy Storage Control for Optimal Adoption of Solar Energy in Residential Networks“. In 2012 20th International Conference on Nuclear Engineering and the ASME 2012 Power Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/icone20-power2012-54940.

Der volle Inhalt der Quelle
Annotation:
Environmental concerns, global warming and fossil fuel prices are creating a shift in the expectations of consumers and industries to move toward renewable energy resources. However, the inability to control the output of renewable resources, like wind and solar, results in operational challenges in power systems. The operational challenges of renewable resources can be met by energy storage systems. The energy storage systems scheduling can be used to control the effect of intermittent renewable energy resources. Furthermore, energy storage systems can be used for ancillary services, peak reduction, and mitigating contingencies in the distribution and transmission networks [1]. Distributed photovoltaic (DPV) rooftop panels are considered as renewable energy resources in this paper. Depending on the DPV size and solar irradiation, DPV adoption can create problems for the distribution network. In addition, utility companies have to pay different prices for electricity during different times of the day due to the dynamic electricity market. Therefore, the DPV adoption can be controlled with the help of real-time electricity price and the load profile. Facing these challenges, this paper presents an operational optimization algorithm for a Distributed Energy Storage (DES) system. The DES system presents a fleet of batteries connected to distribution transformers. The DES can be used for withholding DPV power before it is bid into the market. Withholding DPV generation represents a gaming method to realize higher revenues due to the time varying cost of electricity. Energy storage systems may be used to control DPV power variation and thus help distribution network operations [2]. The objective of this paper is to present a DES optimal economic control system to improve the DPV adoption in power distribution networks. The control system decisions depend on the load profiles, and the real-time Locational Marginal Price (LMP). Economic operation of the DES is a complex problem because of the time dependency of the battery capacity (where sufficient energy reserves must be maintained in case of power loss), the solar irradiation uncertainty, and the real-time electricity price variability. The mathematical approach used is the Discrete Ascent Optimal Programming (DAOP) algorithm. An advantage of DAOP is its assurance of convergence after a finite number of computational iterations.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Li, Zheng, Mo Yang und Yuwen Zhang. „Lattice Boltzmann Method Simulation of 3-D Melting Using Double MRT Model With Interfacial Tracking Method“. In ASME 2016 Heat Transfer Summer Conference collocated with the ASME 2016 Fluids Engineering Division Summer Meeting and the ASME 2016 14th International Conference on Nanochannels, Microchannels, and Minichannels. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/ht2016-7407.

Der volle Inhalt der Quelle
Annotation:
Three-dimensional melting problems are investigated numerically with Lattice Boltzmann method (LBM). Regarding algorithm’s accuracy and stability, Multiple-Relaxation-Time (MRT) models are employed to simplify the collision term in LBM. Temperature and velocity fields are solved with double distribution functions, respectively. 3-D melting problems are solved with double MRT models for the first time in this article. The key point for the numerical simulation of a melting problem is the methods to obtain the location of the melting front and this article uses interfacial tracking method. The interfacial tracking method combines advantages of both deforming and fixed grid approaches. The location of the melting front was obtained by calculating the energy balance at the solid-liquid interface. Various 3-D conduction controlled melting problems are solved firstly to verify the numerical method. Liquid fraction tendency and temperature distribution obtained from numerical methods agree with the analytical results well. The proposed double MRT model with interfacial tracking method is valid to solve 3-D melting problems. Different 3-D convection controlled melting problems are then solved with the proposed numerical method. Various locations of the heat surface have different melting front moving velocities, due to the natural convection effects. Rayleigh number’s effects to the 3-D melting process is discussed.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Alizadeh, R., und T. Nishi. „Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem“. In 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2019. http://dx.doi.org/10.1109/ieem44572.2019.8978601.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Gilbert, Jacob, MohammadTaghi Hajiaghayi, Hamed Saleh und Saeed Seddighin. „Location-Sensitive String Problems in MPC“. In SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3558481.3591090.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Plaxton, C. Greg. „Approximation algorithms for hierarchical location problems“. In the thirty-fifth ACM symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/780542.780549.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Makino, Kazuhisa. „Source Location Problems with Flow Requirements“. In 2012 Third International Conference on Networking and Computing (ICNC). IEEE, 2012. http://dx.doi.org/10.1109/icnc.2012.77.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Locational problems"

1

Schulzrinne, H., L. Liess, H. Tschofenig, B. Stark und A. Kuett. Location Hiding: Problem Statement and Requirements. RFC Editor, Januar 2012. http://dx.doi.org/10.17487/rfc6444.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Koodli, R. IP Address Location Privacy and Mobile IPv6: Problem Statement. RFC Editor, Mai 2007. http://dx.doi.org/10.17487/rfc4882.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Tschofenig, H., und H. Schulzrinne. GEOPRIV Layer 7 Location Configuration Protocol: Problem Statement and Requirements. RFC Editor, März 2010. http://dx.doi.org/10.17487/rfc5687.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Ahrens, David L., Daniel B. Olsen und Azer P. Yalin. GRI-05-0138 Development of an Open Path Laser Ignition System for a Large Bore Natural. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), März 2005. http://dx.doi.org/10.55274/r0011965.

Der volle Inhalt der Quelle
Annotation:
Using a laser, as opposed to a conventional (electrical) spark plug, to create combustion initiating spark is potentially advantageous for several reasons: flexibility in choosing and optimizing the spark location, in particular, to move the spark away from solid heat sinks; production of a more robust spark containing more energy; and obviation of electrode erosion problems. These advantages may lead to an extension of the lean limit, an increase in engine thermal efficiency, and the concomitant benefits of reduced pollutant emissions. Presented in this paper is the design and implementation of a laser ignition system appropriate for a large bore natural gas engine. Design considerations include optimization of spark location, design of beam delivery system and optical plug, and mitigation of vibration and thermal effects. A single cylinder of a four-cylinder large bore natural gas engine is operated using laser ignition. Four different laser spark locations are examined. Comparisons are made between laser spark and conventional spark plug ignition.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Paul, Kylie, Jamie Faselt, Matthew Bell, Marcel P. Huijser, David Theobald, Annika Keeley und Robert Ament. West-Wide Study to Identify Important Highway Locations for Wildlife Crossings. Western Transportation Institute, 2023. http://dx.doi.org/10.15788/1706214520.

Der volle Inhalt der Quelle
Annotation:
Wildlife-vehicle collisions (WVCs), reduced ecological connectivity, and associated impacts to wildlife and humans are widespread problems across road networks, but mitigation measures like wildlife crossings1 that can address those problems are often considered expensive. This effort aims to support transportation agencies, wildlife agencies and other decision-makers by identifying important road segments where cost-effective wildlife crossings can be deployed to address motorist safety, ecological connectivity and other conservation values across the eleven U.S. western conterminous states of Arizona, California, Colorado, Idaho, Montana, Nevada, New Mexico, Oregon, Utah, Washington, and Wyoming.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Rodi, William L. Error Analysis in the Joint Event Location/Seismic Calibration Inverse Problem. Fort Belvoir, VA: Defense Technical Information Center, Februar 2008. http://dx.doi.org/10.21236/ada479709.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Brian Harder und Chacko John. MISSING WELL LOCATIONS: AN ENVIRONMENTAL RISK ASSESSMENT AND REGULATORY PROBLEM FOR LOUISIANA. Office of Scientific and Technical Information (OSTI), April 2003. http://dx.doi.org/10.2172/820942.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Fourie und Tullmin. L51912 Corrosion-CP Monitoring of Locations Remote from a Test Station. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), April 2002. http://dx.doi.org/10.55274/r0010624.

Der volle Inhalt der Quelle
Annotation:
It is accepted that many situations exist on pipelines where a significant length of the pipeline (typically 2000 ft to 5 miles) is either totally inaccessible or access is so difficult or expensive that monitoring is not done at the required frequency. The need for finding a technique to allow the corrosion engineer to monitor CP levels of inaccessible locations from an accessible remote location has therefore been identified. A study to investigate all possible techniques available to achieve the above objective and to analyze typical scenarios requiring this approach has therefore been undertaken. Numerous techniques varying from pipe-to-soil type measurements, above ground current attenuation measurements, direct measurement of pipeline current, and measurement of the AC impedance response of the inaccessible section of pipeline were identified. In addition, some novel remote monitoring methods applicable to hostile inaccessible locations were identified. Analysis of these techniques in relation to the problem lead to the development of an algorithm to facilitate the choice of possible techniques under specific conditions.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Sloan, Steven, Shelby Peterie, Richard Miller, Julian Ivanov, J. Schwenk und Jason McKenna. Detecting clandestine tunnels by using near-surface seismic techniques. Engineer Research and Development Center (U.S.), April 2021. http://dx.doi.org/10.21079/11681/40419.

Der volle Inhalt der Quelle
Annotation:
Geophysical detection of clandestine tunnels is a complex problem that has been met with limited success. Multiple methods have been applied spanning several decades, but a reliable solution has yet to be found. This report presents shallow seismic data collected at a tunnel test site representative of geologic settings found along the southwestern U.S. border. Results demonstrate the capability of using compressional wave diffraction and surface-wave backscatter techniques to detect a purpose-built subterranean tunnel. Near-surface seismic data were also collected at multiple sites in Afghanistan to detect and locate subsurface anomalies (e.g., data collected over an escape tunnel discovered in 2011 at the Sarposa Prison in Kandahar, Afghanistan, which allowed more than 480 prisoners to escape, and data from another shallow tunnel recently discovered at an undisclosed location). The final example from Afghanistan is the first time surface-based seismic methods have detected a tunnel whose presence and location were not previously known. Seismic results directly led to the discovery of the tunnel. Interpreted tunnel locations for all examples were less than 2 m of the actual location. Seismic surface wave backscatter and body-wave diffraction methods show promise for efficient data acquisition and processing for locating purposefully hidden tunnels within unconsolidated sediments.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Meloy, John D. L51702 Precision Gas Pipeline Location-A Technology Study. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), Januar 1994. http://dx.doi.org/10.55274/r0010417.

Der volle Inhalt der Quelle
Annotation:
A review of currently used pipe-locating techniques and technologies shows a universally conservative approach to system design. Tested and proven sensors and data processors have been integrated into systems that optimize performance specifically for the pipeline-location problem. Although these systems perform well, they could be improved and augmented (that is, performance could be enhanced) by incorporating a broader sensor mix. Emerging technologies also hold promise for upgrading performance by improving, rather than changing the basic sensors. This study was undertaken to survey and evaluate the technology available to determine accurately the position of submerged or buried gas transmission pipelines, and to assess the applicability of some of the emerging technologies. The objectives are to increase accuracy and reliability while reducing the cost of surveys. This report is organized to provide an overview of the elements applicable to the problem of pipe detection, identification, and location. These elements include basic sensors and pipe-location systems made up of sensors, computers, peripherals, and data links. The report includes a qualitative comparison of both sensors and systems using a number of performance criteria. A brief description of relevant technologies that have been developed for uses other than pipeline location, as well as new and emerging technologies, is also included.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Locational problems" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie