Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 124-130).

We introduce two online models for the vertex k-center and the vertex k-median problems. Clients (i.e., graph vertices) and their corresponding links (i.e., graph edges) are revealed sequentially, determining the topology of a graph over time. Clients are revealed by an adversary to an online algorithm that selects existing graph vertices on which to open facilities; once open, a facility cannot be removed or relocated. We define two models: an online algorithm may be restricted to open a facility only at the location of the most recent client or at the location of any existing client. We examine these models on three classes of graphs under two types of adversaries. We establish lower bounds on the respective competitive ratios attainable by any online algorithm for each combination of model, adversary, and graph class. Finally, we describe algorithms whose competitive ratios provide corresponding upper bounds on the best competitive ratios achievable.

We introduce two online models for the vertex k-center and the vertex k-median problems. Clients (i.e., graph vertices) and their corresponding links (i.e., graph edges) are revealed sequentially, determining the topology of a graph over time. Clients are revealed by an adversary to an online algorithm that selects existing graph vertices on which to open facilities; once open, a facility cannot be removed or relocated. We define two models: an online algorithm may be restricted to open a facility only at the location of the most recent client or at the location of any existing client. We examine these models on three classes of graphs under two types of adversaries. We establish lower bounds on the respective competitive ratios attainable by any online algorithm for each combination of model, adversary, and graph class. Finally, we describe algorithms whose competitive ratios provide corresponding upper bounds on the best competitive ratios achievable.

Dissertation (Ph.D.)--Auburn University, 2006. / Abstract. Includes bibliographic references (p.149-156).

Thesis (M.S.) in Computer Engineering--University of Maine, 2008. / Includes vita. Includes bibliographical references (leaves 110-113).

L’objectif de cette thèse est de proposer des solutions efficaces à des problèmes de décision qui ont un impact sur la vie des citoyens, et qui reposent sur des données incertaines. Au niveau des applications, nous nous intéressons à deux problèmes de localisation qui ont un impact sur l’espace public, notamment la localisation de nouveaux logements, et la localisation de vendeurs mobiles dans l’espace urbain. Les problèmes de localisation ne sont pas un sujet récent dans la littérature, toutefois, pour ces deux problèmes qui reposent sur des modèles de choix pour le comportement d’achat des consommateurs, l’incertitude dans le modèle génère un cas spécial qui permet d’étendre la littérature sur l’Optimisation Robuste. Les contributions de cette thèse peuvent s’appliquer à divers problèmes génériques d’optimisation. / We address decision problems under uncertain information with non-linear structures of parameter variation, and devise solution methods in the spirit of Bertsimas and Sim’s Γ-Robustness approach. Furthermore, although the non-linear impact of uncertainty often introduces discrete structures to the problem, for tractability, we provide the conditions under which the complexity class of the nominal model is preserved for the robust counterpart. We extend the Γ-Robustness approach in three avenues. First, we propose a generic case of non-linear impact of parameter variation, and model it with a piecewise linear approximation of the impact function. We show that the subproblem of determining the worst-case variation can be dualized despite the discrete structure of the piece-wise function. Next, we built a robust model for the location of new housing where the non-linearity is introduced by a choice model, and propose a solution combining Γ-Robustness with a scenario-based approach. We show that the subproblem is tractable and leads to a linear formulation of the robust problem. Finally, we model the demand in a Location Problem through a Poisson Process inducing, when demands are uncertain, non-linear structures of parameter variation. We propose the concept of Nested Uncertainty Budgets to manage uncertainty in a tractable way through a hierarchical structure and, under this framework, obtain a subproblem that includes both continuous and discrete deviation variables.

<p> This dissertation examines the facility location problems in the presence of barrier regions and consists basically of four essays exploring new problems. Despite the fact that the facility location problems considering barriers to travel are more realistic than their unrestricted counterparts, research in the area is relatively limited. This is due to the computational complexity associated with them. </p> <p> The first essay analyzes the problem of locating a facility in a region in the presence of a probabilistic line barrier. The objective is to locate the facility such that the sum of the volume times distances between the facility and demand points is minimized. Some convexity results are presented and a solution algorithm is proposed. </p> <p> Another interrelated problem is locating a facility in a region where a fixed line barrier such as a borderline divides the region into two. The regions communicate with each other through a number of passage points located on the line barrier. A version of this problem with minisum objective has been studied in the literature where the locations of the passage points are known. The second essay considers a number of extensions to this problem and proposes an efficient solution methodology based on the Outer Approximation algorithm. </p> <p> The third essay discusses the problem of locating a rectangular barrier facility m an area where interactions among existing facilities are present. The problem has two objectives. The first objective is to minimize the interference of the barrier facility to the interactions among the existing facilities. The second objective is to find a center (minimax) location for the barrier facility. The problem is formulated as a bi-objective problem and a mixed integer program is proposed as a solution methodology. A Simulated Annealing algorithm is presented for an extension of the problem where expropriation of existing facilities is also possible. </p> <p> Finally, the last essay suggests a practical analog approach for facility location problems in the presence of barriers. The use of the analog for certain problems is justified through some analytical results and a number of problems that appeared in the literature are solved efficiently. </p> / Thesis / Doctor of Philosophy (PhD)

No description available.

Thesis--Auburn University, 2009. / Abstract. Vita. Includes bibliographic references (p.44-49).

DIAS, Fábio Carlos Sousa. Algoritmos para o problema de localização simples baseados nas formulações clássica e canônica. 2008. 89 f. Dissertação (Mestrado em ciência da computação)- Universidade Federal do Ceará, Fortaleza-CE, 2008. / Submitted by Elineudson Ribeiro (elineudsonr@gmail.com) on 2016-07-11T15:12:03Z No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5) / Approved for entry into archive by Rocilda Sales (rocilda@ufc.br) on 2016-07-15T15:32:35Z (GMT) No. of bitstreams: 1 2008_dis_fcsdias.pdf: 533140 bytes, checksum: 547c9cf8d771e2646884c423f5a39936 (MD5) / Made available in DSpace on 2016-07-15T15:32:35Z (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.