Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.

Stability of nonlinear difference inclusions

The stability of difference inclusions x(k+1) is an element of F(x(k)) is studied, where F(x) = {F(x, gimel) : is an element of Lambda} and the selections F(., gimel) : E -->E assume values in a Banach space E, partially ordered by a cone K. It is assumed that the operators F(.,gimel) are heterotone or pseudoconcave. The main results concern asymptotically stable absorbing sets, and include the case of a single equilibrium point. The results are applied to a number of practical problems.

Biostatistics in Australia: Directions in the new millennium

The Biostatistics Collaboration of Australia (BCA) was formed in response to a shortage of statisticians seeking careers in the medical and health professions. The Collaboration has been successful in developing postgraduate courses (Graduate Certificate, Graduate Diploma and Masters) offered by a consortium of seven Australian Universities. These courses are available through a distance learning medium. The BCA was successful in securing funding from the Federal government to launch these courses, which commenced in March 2001. Two traineeships by the NSW Department of Health have also been awarded and a third is currently advertised. There has been close collaboration with governments, the pharmaceutical industry and research organisations to ensure that course content reflects practical problems and addresses industry needs. A second objective of the BCA is to provide ongoing workshops for practising biostatisticians to enhance professional development. These workshops serve to ring together biostatisticians from both within Australia and the Asia-Pacific region, providing a forum for discussion of current statistical thinking. (author abstract)

Modern scientific methods and their potential in wastewater science and technology

Application of novel analytical and investigative methods such as fluorescence in situ hybridization, confocal laser scanning microscopy (CLSM), microelectrodes and advanced numerical simulation has led to new insights into micro-and macroscopic processes in bioreactors. However, the question is still open whether or not these new findings and the subsequent gain of knowledge are of significant practical relevance and if so, where and how. To find suitable answers it is necessary for engineers to know what can be expected by applying these modern analytical tools. Similarly, scientists could benefit significantly from an intensive dialogue with engineers in order to find out about practical problems and conditions existing in wastewater treatment systems. In this paper, an attempt is made to help bridge the gap between science and engineering in biological wastewater treatment. We provide an overview of recently developed methods in microbiology and in mathematical modeling and numerical simulation. A questionnaire is presented which may help generate a platform from which further technical and scientific developments can be accomplished. Both the paper and the questionnaire are aimed at encouraging scientists and engineers to enter into an intensive, mutually beneficial dialogue. (C) 2002 Elsevier Science Ltd. All rights reserved.

Algoritmos genéticos: aplicação na síntese de alguns algoritmos de controlo

Mestrado em Engenharia Electrotécnica e de Computadores. Área de Especialização de Automação e Sistemas.

Constraint reasoning for differential models

The basic motivation of this work was the integration of biophysical models within the interval constraints framework for decision support. Comparing the major features of biophysical models with the expressive power of the existing interval constraints framework, it was clear that the most important inadequacy was related with the representation of differential equations. System dynamics is often modelled through differential equations but there was no way of expressing a differential equation as a constraint and integrate it within the constraints framework. Consequently, the goal of this work is focussed on the integration of ordinary differential equations within the interval constraints framework, which for this purpose is extended with the new formalism of Constraint Satisfaction Differential Problems. Such framework allows the specification of ordinary differential equations, together with related information, by means of constraints, and provides efficient propagation techniques for pruning the domains of their variables. This enabled the integration of all such information in a single constraint whose variables may subsequently be used in other constraints of the model. The specific method used for pruning its variable domains can then be combined with the pruning methods associated with the other constraints in an overall propagation algorithm for reducing the bounds of all model variables. The application of the constraint propagation algorithm for pruning the variable domains, that is, the enforcement of local-consistency, turned out to be insufficient to support decision in practical problems that include differential equations. The domain pruning achieved is not, in general, sufficient to allow safe decisions and the main reason derives from the non-linearity of the differential equations. Consequently, a complementary goal of this work proposes a new strong consistency criterion, Global Hull-consistency, particularly suited to decision support with differential models, by presenting an adequate trade-of between domain pruning and computational effort. Several alternative algorithms are proposed for enforcing Global Hull-consistency and, due to their complexity, an effort was made to provide implementations able to supply any-time pruning results. Since the consistency criterion is dependent on the existence of canonical solutions, it is proposed a local search approach that can be integrated with constraint propagation in continuous domains and, in particular, with the enforcing algorithms for anticipating the finding of canonical solutions. The last goal of this work is the validation of the approach as an important contribution for the integration of biophysical models within decision support. Consequently, a prototype application that integrated all the proposed extensions to the interval constraints framework is developed and used for solving problems in different biophysical domains.

Control of a 6-DOF parallel manipulator through a mechatronic approach

This paper shows that a hierarchical architecture, distributing several control actions in growing levels of complexity and using resources of reconfigurable computing, enables one to take into account the ease of future modifications, updates and improvements in robotic applications. An experimental example of a Stewart—Gough platform control (a platform applied as the solution to countless practical problems) is presented using reconfigurable computing. The software and hardware developed are structured in independent blocks. This open architecture implementation allows easy expansion of the system and better adaptation of the platform to its related tasks.

Development of CO-releasing molecular for the treatment of inflammatory diseases

Dissertation presented to obtain a Ph.D. degree (Doutoramento) in Chemistry at the Instituto de Tecnologia Quimica e Biol6gica da Universidade Nova de Lisboa

Gestão de Obras: Aplicação prática em ambiente empresarial

O presente Relatório de estágio enquadra-se no âmbito da disciplina de Dissertação / Projeto / Estágio, do Curso de Mestrado em Engenharia Civil, do Instituto Superior de Engenharia do Porto subordinado ao tema “Gestão de Obras: Aplicação prática em ambiente empresarial”. O estágio foi realizado na empresa NEGRO S.A., empresa que atua no mercado Francês, no sector da construção civil no âmbito de obras públicas e privadas. Foi com grande satisfação que o estagiário abraçou esta oportunidade de poder realizar um estágio neste setor da engenharia civil, integrando uma equipa de trabalho com uma ampla experiência no mercado. Foi igualmente gratificante poder aplicar os conhecimentos adquiridos ao longo do curso e enriquecedor adquirir novas competências, através da resolução das dificuldades ocorridas no dia-a-dia durante o estágio. Considera-se assim esta experiencia como uma mais-valia para ingressar com êxito na futura vida profissional. Este documento descreve essencialmente as tarefas realizadas ao longo do estágio. Estas tarefas foram executadas recorrendo aos conhecimentos adquiridos durante a formação académica, nomeadamente no que se refere a planeamento, qualidade, gestão de obra e segurança e saúde no trabalho e com finalidade de alcançar os seguintes objetivos: - Proporcionar a integração do aluno no ambiente empresarial, realizando as atividades planeadas; - Propiciar a aplicação dos conhecimentos e competências adquiridas ao longo do curso, utilizando os casos reais durante o estágio; - Resolver problemas concretos de engenharia civil em meio profissional e empresarial; - Proceder a recolha de informação com vista a resolução dos problemas que surgem ao longo do estágio; - Analisar as situações que surgem durante a realização do estágio, estabelecendo conclusões; - Desenvolver metodologias aplicáveis no contexto do estágio; - Recolher dados e interpretar os mesmos no contexto do estágio; - Estabelecer conclusões sobre as experiências vividas durante o estágio; - Analisar o impacto do trabalho realizado na instituição de acolhimento.

DNA evidence collecting in criminal investigation: Portuguese and Thai legal approaches

Doctoral Thesis in Juridical Sciences (Specialty in Public Legal Sciences)

O dano biológico no direito português: alguns casos práticos

Relatório de atividade profissional de mestrado em Direito dos Contratos e da Empresa

Desenvolupament de problemes virtuals i interactius per a l’aprenentatge de la Microbiologia

La finalitat del projecte ha estat desenvolupar un espai virtual teòric-pràctic per a l’aprenentatge de la Microbiologia. Aquest espai virtual, basat en l'aprenentatge a través de problemes, s’ha anomenat “Microbiologia Interactiva” i proposa a l’alumne les següents àrees temàtiques: Introducció a les tècniques de la Microbiologia; Estructura i funció de la cèl.lula microbiana; Creixement i control microbià; Microbiologia molecular; Fisiologia i metabolisme microbians; Virologia; Ecologia Microbiana; Diversitat microbiana. Per a cada temàtica s’han definit unes competències a assolir a través de la resolució de problemes teòrics o pràctics. En aquest darrer cas, se li proposa a l’alumne que entri en el laboratori virtual per a la resolució dels casos pràctics plantejats. A més, per a la resolució dels problemes, l’alumne disposa d’un seguit de recursos per a cada temàtica. Finalment, també s’inclouen activitats de relació i d’ampliació per tal d’estimular la discussió, l’esperit crìtic, el treball en grup i la recerca bibliogràfica. A més, per tal de facilitar el seu ús, el web disposa també d'un tutorial. El web “Microbiologia Interactiva” es va introduir de forma pilat en l’ensenyament de l'assignatura de Microbiologia de la Llicenciatura de Biologia i de la de Microbiologia I de la llicenciatura de Biotecnologia de la Universitat Autònoma de Barcelona (UAB) durant el curs 2007-08. Al llarg d'aquest curs es va valorar la seva utilitat i acceptació per part dels alumnes mitjançant enquestes. Els bons resultats obtinguts van aconsellar que aquesta eina fora ja utilitzada en totes les assignatures generals de Microbiologia de les llicenciatures de Biologia, Biotecnologia, Bioquímica, Química, Enginyeria Química, Ciències Ambientals i Ciència i Tecnologia dels Aliments de la UAB. Actualment el web s’està també utilitzant amb molt bons resultats a les assignatures de Microbiologia dels nous graus que ofereix la Facultat de Biociències de la UAB. Així doncs, en aquest projecte s’han assolit amb escreix els objectius previstos. Es pot consultar el web desenvolupat a l’adreça http://microbiologia.uab.cat//Microbiologia_Interactiva_Web/.

Compositional data analysis: where we are and where should we be heading?

We take stock of the present position of compositional data analysis, of what has beenachieved in the last 20 years, and then make suggestions as to what may be sensibleavenues of future research. We take an uncompromisingly applied mathematical view,that the challenge of solving practical problems should motivate our theoreticalresearch; and that any new theory should be thoroughly investigated to see if it mayprovide answers to previously abandoned practical considerations. Indeed a main themeof this lecture will be to demonstrate this applied mathematical approach by a number ofchallenging examples

Grain size analyses in tin-lead glazes based on 2d-sections

A problem in the archaeometric classification of Catalan Renaissance pottery is the fact, thatthe clay supply of the pottery workshops was centrally organized by guilds, and thereforeusually all potters of a single production centre produced chemically similar ceramics.However, analysing the glazes of the ware usually a large number of inclusions in the glaze isfound, which reveal technological differences between single workshops. These inclusionshave been used by the potters in order to opacify the transparent glaze and to achieve a whitebackground for further decoration.In order to distinguish different technological preparation procedures of the single workshops,at a Scanning Electron Microscope the chemical composition of those inclusions as well astheir size in the two-dimensional cut is recorded. Based on the latter, a frequency distributionof the apparent diameters is estimated for each sample and type of inclusion.Following an approach by S.D. Wicksell (1925), it is principally possible to transform thedistributions of the apparent 2D-diameters back to those of the true three-dimensional bodies.The applicability of this approach and its practical problems are examined using differentways of kernel density estimation and Monte-Carlo tests of the methodology. Finally, it istested in how far the obtained frequency distributions can be used to classify the pottery

Bayesian networks for evaluating forensic DNA profiling evidence: a review and guide to literature

Almost 30 years ago, Bayesian networks (BNs) were developed in the field of artificial intelligence as a framework that should assist researchers and practitioners in applying the theory of probability to inference problems of more substantive size and, thus, to more realistic and practical problems. Since the late 1980s, Bayesian networks have also attracted researchers in forensic science and this tendency has considerably intensified throughout the last decade. This review article provides an overview of the scientific literature that describes research on Bayesian networks as a tool that can be used to study, develop and implement probabilistic procedures for evaluating the probative value of particular items of scientific evidence in forensic science. Primary attention is drawn here to evaluative issues that pertain to forensic DNA profiling evidence because this is one of the main categories of evidence whose assessment has been studied through Bayesian networks. The scope of topics is large and includes almost any aspect that relates to forensic DNA profiling. Typical examples are inference of source (or, 'criminal identification'), relatedness testing, database searching and special trace evidence evaluation (such as mixed DNA stains or stains with low quantities of DNA). The perspective of the review presented here is not exclusively restricted to DNA evidence, but also includes relevant references and discussion on both, the concept of Bayesian networks as well as its general usage in legal sciences as one among several different graphical approaches to evidence evaluation.