The SNS logistics network design : location and vehicle routing.

Large-scale emergencies caused by earthquake, tornado, pandemic flu, terrorism attacks and so on can wreak havoc to communities. In order to mitigate the impact of the events, emergency stockpiles of food, water, medicine and other materials have been set up around the US to be delivered to the affected areas during relief operations. One type of stockpile is called the Strategic National Stockpile (SNS). The SNS logistics network is designed to have multiple stages of facilities, each of which is managed by different levels of governmental authorities - federal, state and local authorities. The design of a logistics network for delivery of the SNS materials within a state are explored in this dissertation. There are three major areas of focus in this dissertation: (1) the SNS facility location model, which is used to determine sites for locating Receiving, Staging and Storage (RSS) and Regional Distribution Nodes (RDNs) to form a logistics network to deliver relief material to Points of Demand (PODs), where the materials are directly delivered to the affected population; (2) the SNS Vehicle Routing Problem (VRP), which is used to assist the SNS staff in determining the numbers of various types of trucks, and the routing schedules of each truck to develop an operational plan for delivering the required relief materials to the assigned PODs within the required duration; (3) the location-routing analysis of emergency scenarios, in which the facility location model and the VRP solution are integrated through the use of a computer program to run on several assumed emergency scenarios. Using real data from the department of public health in the Commonwealth of Kentucky, a transshipment and location model is formulated to determine the facility locations and the transshipment quantities of materials; a multiple-vehicle routing model allowing split deliveries and multiple routes per vehicle that must be completed within a required duration is formulated to determine the routing and scheduling of trucks. The facility location model is implemented using Microsoft Solver Foundation and C#. An algorithm combining the Clark and Wright saving algorithm and Simulated Annealing is designed and implemented in C# to solve the VRP. The algorithm can determine whether there is shortage of transportation capacity, and if so, how many of various types of trucks should be added for optimal performance. All the solution algorithms are integrated into a web-based SNS planning tool. In the location-routing analysis of emergency scenarios, a binary location model and an algorithm for solving VRP solution are integrated as a computer program to forecast the feasibility of distribution plans and the numbers of required trucks of various types. The model also compares the costs and benefits of direct and indirect shipment. A large-scale emergency scenario in which a specific type of vaccine is required to be delivered to the entire state of Kentucky is considered. The experiments are designed based on the real data provided by the Kentucky state government. Thus the experimental results provide valuable suggestions for future SNS preparedness planning

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