Algunas aportaciones de la investigación operativa a los problemas de localización

La toma de decisiones sobre localizaciones atrae, por su impacto social y económico, creciente interés de geógrafos, economistas y matemáticos. En las páginas que siguen describimos algunas aportaciones que se están realizando desde las Matemáticas (más concretamente, desde la Investigación Operativa), tanto en el modelado, como en la resolución de los problemas de Análisis de Localizaciones

Localização de serviços semiobnóxios: uma proposta de sistema de apoio à decisão

A localização de serviços semiobnóxios é caracterizada por critérios contraditórios, que podem ser expressos como forças de atracção e repulsão. Os serviços semiobnóxios definem-se como sendo desejáveis para as comunidades pelos benefícios que geram, mas que por outro lado são indesejáveis pelos efeitos negativos (obnóxios) que lhes estão associados. Exemplos de serviços semiobnóxios são: aeroportos, estações de tratamento de resíduos sólidos, estações de tratamento de águas e certos tipos de indústrias. Os agentes de decisão são assim confrontados com a necessidade de localizar esses serviços de modo a servir melhor as comunidades, simultaneamente reduzindo os impactos negativos. Outros factores tidos em conta, na localização de serviços semiobnóxios, são os custos relacionados com a distância dos serviços às comunidades que se pretendem mínimos. Pretende-se então, maximizar a acessibilidade aos serviços conjuntamente com a minimização dos efeitos obnóxios. Os modelos desenvolvidos para a resolução deste tipo de problemas são frequentemente apresentados numa linguagem mais orientada para especialistas em Investigação Operacional (IO) e menos adequada para os decisores nas diferentes organizações, quer sejam governamentais, autárquicas ou empresariais. O objectivo deste trabalho é o desenvolvimento de um Sistema de Apoio à Decisão para Problemas de Localização de Serviços Semiobnóxios. Com transferência de algum conhecimento científico da IO para os agentes de decisão, facilitando a escolha das localizações dos serviços ao apresentar alternativas de qualidade, tendo presente a simplicidade e a facilidade de utilizaçãoThe location of semi-obnoxious services is characterized by opposing criteria, which can be expressed as attraction and repulsion forces. The semi- obnoxious services can be defined as being desirable to the communities for the benefits they generate, but on the other side, are undesirable for their associated obnoxious effects. Examples of semi-obnoxious services are: airports, solid waste treatment facilities, water or effluent treatment facilities and certain types of industries. Therefore, the decision agents are faced with the need to locate those services in a way that they serve best the communities, while simultaneously reducing the negative effects. Other factors to hold in account in the location of semi-obnoxious services, are the costs concerning the distances between the services and the communities. Those costs are to minimize, which is equivalent to maximize the accessibility. Consequently, the problem becomes to maximize the accessibility while minimizing the obnoxious effects. It is frequent that the developed models to solve this type of problems are presented in an “Operations Research” (OR) experts oriented language. This may not be suitable for the decision agents at governmental or private organizations. The main goal of this work is to develop a Decision Support System for the Problem of Locating Semi-obnoxious Services. This way some of the OR scientific knowledge is transferred to the decision agents, allowing a usable system that provides quality location alternatives, making easier to select the best locations for the servicesMestrado em Gestã

ROLAND : a tool for the realistic optimisation of local access network design

Bibliography: p. 141-147.Investment in the local access network represents between 50% and 70% of capital investment of a telecommunications company. This thesis investigates algorithms that can be used to design economical access networks and presents ROLAND: a tool that incorporates several of these algorithms into an interactive environment. The software allows a network designer to explore different approaches to solving the problem, before adopting a particular one. The family of problems that are tackled by the algorithms included in ROLAND involve determining the most economical way of installing concentrators in an access network and connecting demand nodes such as distribution points to these concentrators. The Centre-of-Mass (COM) Algorithm identifies clusters of demand in the network and suggests good locations for concentrators to be installed. The problem of determining which concentrators in a set of potential sites to install is known as the concentrator location problem (CPL) and is an instance of the classical capacitated plant location problem. Linear programming techniques such as branch-and-bound can be used to find an optimal solution to this problem, but soon becomes infeasible as the network size increases. Some form of heuristic approach is needed, and ROLAND includes two such heuristics, namely the Add and Drop Heuristic. Determining the layout of multi-drop lines, which allow a number of demand nodes to share the same connection to a concentrator, is analogous to finding minimal spanning trees in a graph. Greedy approaches such as Kruskal's algorithm are not ideal however, and heuristics such as Esau-William's algorithm achieve better results. Kruskal's algorithm and Kershenbaum's Unified Algorithm (which encapsulates a number of heuristics) have been implemented and come bundled with ROLAND. ROLAND also includes an optimal terminal assignment algorithm for associating distribution points to concentrators. A description of ROLAND's architecture and GUI are provided. The graphical elements are kept separate from the algorithm implementations, and an interface class provides common data structures and routines for use by new algorithm implementations. A test data generator, able to create random or localized data, is also included. A new hybrid concentrator location algorithm, known as the Cluster-Add Heuristic is presented. The implementation of this algorithm is included in ROLAND, and demonstrates the ease with which new solution methods can be integrated into the tool's framework. Experimentation with the concentrator location algorithms is conducted to show the Cluster-Add Heuristic's relative performance

Problemas de localização-distribuição de serviços semiobnóxios: aproximações e apoio à decisão

Doutoramento em Gestão IndustrialA presente tese resulta de um trabalho de investigação cujo objectivo se centrou no problema de localização-distribuição (PLD) que pretende abordar, de forma integrada, duas actividades logísticas intimamente relacionadas: a localização de equipamentos e a distribuição de produtos. O PLD, nomeadamente a sua modelação matemática, tem sido estudado na literatura, dando origem a diversas aproximações que resultam de diferentes cenários reais. Importa portanto agrupar as diferentes variantes por forma a facilitar e potenciar a sua investigação. Após fazer uma revisão e propor uma taxonomia dos modelos de localização-distribuição, este trabalho foca-se na resolução de alguns modelos considerados como mais representativos. É feita assim a análise de dois dos PLDs mais básicos (os problema capacitados com procura nos nós e nos arcos), sendo apresentadas, para ambos, propostas de resolução. Posteriormente, é abordada a localização-distribuição de serviços semiobnóxios. Este tipo de serviços, ainda que seja necessário e indispensável para o público em geral, dada a sua natureza, exerce um efeito desagradável sobre as comunidades contíguas. Assim, aos critérios tipicamente utilizados na tomada de decisão sobre a localização destes serviços (habitualmente a minimização de custo) é necessário adicionar preocupações que reflectem a manutenção da qualidade de vida das regiões que sofrem o impacto do resultado da referida decisão. A abordagem da localização-distribuição de serviços semiobnóxios requer portanto uma análise multi-objectivo. Esta análise pode ser feita com recurso a dois métodos distintos: não interactivos e interactivos. Ambos são abordados nesta tese, com novas propostas, sendo o método interactivo proposto aplicável a outros problemas de programação inteira mista multi-objectivo. Por último, é desenvolvida uma ferramenta de apoio à decisão para os problemas abordados nesta tese, sendo apresentada a metodologia adoptada e as suas principais funcionalidades. A ferramenta desenvolvida tem grandes preocupações com a interface de utilizador, visto ser direccionada para decisores que tipicamente não têm conhecimentos sobre os modelos matemáticos subjacentes a este tipo de problemas.This thesis main objective is to address the location-routing problem (LRP) which intends to tackle, using an integrated approach, two highly related logistics activities: the location of facilities and the distribution of materials. The LRP, namely its mathematical formulation, has been studied in the literature, and several approaches have emerged, corresponding to different real-world scenarios. Therefore, it is important to identify and group the different LRP variants, in order to segment current research and foster future studies. After presenting a review and a taxonomy of location-routing models, the following research focuses on solving some of its variants. Thus, a study of two of the most basic LRPs (capacitated problems with demand either on the nodes or on the arcs) is performed, and new approaches are presented. Afterwards, the location-routing of semi-obnoxious facilities is addressed. These are facilities that, although providing useful and indispensible services, given their nature, bring about an undesirable effect to adjacent communities. Consequently, to the usual objectives when considering their location (cost minimization), new ones must be added that are able to reflect concerns regarding the quality of life of the communities impacted by the outcome of these decisions. The location-routing of semi-obnoxious facilities therefore requires to be analysed using multi-objective approaches, which can be of two types: noninteractive or interactive. Both are discussed and new methods proposed in this thesis; the proposed interactive method is suitable to other multi-objective mixed integer programming problems. Finally, a newly developed decision-support tool to address the LRP is presented (being the adopted methodology discussed, and its main functionalities shown). This tool has great concerns regarding the user interface, as it is directed at decision makers who typically don’t have specific knowledge of the underlying models of this type of problems

Qualitative Characteristics and Quantitative Measures of Solution's Reliability in Discrete Optimization: Traditional Analytical Approaches, Innovative Computational Methods and Applicability

The purpose of this thesis is twofold. The first and major part is devoted to sensitivity analysis of various discrete optimization problems while the second part addresses methods applied for calculating measures of solution stability and solving multicriteria discrete optimization problems. Despite numerous approaches to stability analysis of discrete optimization problems two major directions can be single out: quantitative and qualitative. Qualitative sensitivity analysis is conducted for multicriteria discrete optimization problems with minisum, minimax and minimin partial criteria. The main results obtained here are necessary and sufficient conditions for different stability types of optimal solutions (or a set of optimal solutions) of the considered problems. Within the framework of quantitative direction various measures of solution stability are investigated. A formula for a quantitative characteristic called stability radius is obtained for the generalized equilibrium situation invariant to changes of game parameters in the case of the H¨older metric. Quality of the problem solution can also be described in terms of robustness analysis. In this work the concepts of accuracy and robustness tolerances are presented for a strategic game with a finite number of players where initial coefficients (costs) of linear payoff functions are subject to perturbations. Investigation of stability radius also aims to devise methods for its calculation. A new metaheuristic approach is derived for calculation of stability radius of an optimal solution to the shortest path problem. The main advantage of the developed method is that it can be potentially applicable for calculating stability radii of NP-hard problems. The last chapter of the thesis focuses on deriving innovative methods based on interactive optimization approach for solving multicriteria combinatorial optimization problems. The key idea of the proposed approach is to utilize a parameterized achievement scalarizing function for solution calculation and to direct interactive procedure by changing weighting coefficients of this function. In order to illustrate the introduced ideas a decision making process is simulated for three objective median location problem. The concepts, models, and ideas collected and analyzed in this thesis create a good and relevant grounds for developing more complicated and integrated models of postoptimal analysis and solving the most computationally challenging problems related to it.Siirretty Doriast

Automation of the longwall mining system

Cost effective, safe, and technologically sound applications of automation technology to underground coal mining were identified. The longwall analysis commenced with a general search for government and industry experience of mining automation technology. A brief industry survey was conducted to identify longwall operational, safety, and design problems. The prime automation candidates resulting from the industry experience and survey were: (1) the shearer operation, (2) shield and conveyor pan line advance, (3) a management information system to allow improved mine logistics support, and (4) component fault isolation and diagnostics to reduce untimely maintenance delays. A system network analysis indicated that a 40% improvement in productivity was feasible if system delays associated with all of the above four areas were removed. A technology assessment and conceptual system design of each of the four automation candidate areas showed that state of the art digital computer, servomechanism, and actuator technologies could be applied to automate the longwall system

The Siting Of Multi-User Inland Intermodal Container Terminals In Transport Networks

Almost without exception, cargo movements by sea have their origins and destinations in the hinterlands and efficient land transport systems are required to support the transport of these cargo to and from the port. Furthermore, not all goods produced are exported or all goods consumed are imported. Those produced and consumed domestically also require efficient transport to move them from their production areas to areas of consumption. The use of trucks for these transport tasks and their disproportionate contribution to urban congestion and harmful emissions has led governments, transport and port authorities and other policy-makers to seek for more efficient and sustainable means of transport. A promising solution to these problems lies in the implementation of intermodal container terminals (IMTs) that interface with both road and rail or possibly inland waterway networks to promote the use of intermodal transport. This raises two important linked questions; where should IMTs be located and what will be their likely usage by individual shippers, each having a choice of whether or not to use the intermodal option. The multi-shipper feature of the problem and the existence of competing alternative modes means the demand for IMTs are outcome of many individual mode choice decisions and the prevailing cargo production and distribution patterns in the study area. This thesis introduces a novel framework underpinned by the principle of entropy maximisation to link mode choice decisions and variable cargo production and distribution problems with facility location problems. The overall model allows both decisions on facility location and usage to be driven by shipper preferences, following from the random utility interpretation of the discrete choice model. Several important properties of the proposed model are presented as propositions including the demonstration of the link between entropy maximisation and welfare maximisation. Exact and heuristic algorithms have been also developed to solve the overall problem. The computational efficiency, solution quality and properties of the heuristic algorithm are presented along with extensive numerical examples. Finally, the implementation of the model, illustration of key model features and use in practice are demonstrated through a case study