Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Förlorad i övergången från aritmetik till algebra : Hur gymnasieelever översätter aritmetik till algebra

The aim of this thesis is to look for signs of students’ understanding of algebra by studying how they make the transition from arithmetic to algebra. Students in an Upper Secondary class on the Natural Science program and Science and Technology program were given a questionnaire with a number of algebraic problems of different levels of difficulty. Especially important for the study was that students leave comments and explanations of how they solved the problems. According to earlier research, transitions are the most critical steps in problem solving. The Algebraic Cycle is a theoretical tool that can be used to make different phases in problem solving visible. To formulate and communicate how the solution was made may lead to students becoming more aware of their thought processes. This may contribute to students gaining more understanding of the different phases involved in mathematical problem solving, and to students becoming more successful in mathematics in general.The study showed that the students could solve mathematical problems correctly, but that they in just over 50% of the cases, did not give any explanations to their solutions.

Herbrand's Theorem and Equational Reasoning: Problems and Solutions

The famous Herbrand's theorem of mathematical logic plays an important role in automated theorem proving. In the first part of this article, we recall the theorem and formulate a number of natural decision problems related to it. Somewhat surprisingly, these problems happen to be equivalent. One of these problems is the so-called simultaneous rigid E-unification problem. In the second part, we survey recent result on the simultaneous rigid E-unification problem.

Competition and cooperation between international courts: a critical approach to the new paradigms of cross-border dispute resolution model

This article examines the arising cross-border dispute resolution models (Cooperation and Competition among national Courts) from a critical perspective. Although they have been conceived to surpass the ordinary solution of a Modern paradigm (exclusive jurisdiction, choice of court, lis pendens, forum non conveniens, among others), they are insufficient to deal with problems raised with present globalization, as they do not abandon aspects of that paradigm, namely, (i) statebased Law; and (ii) standardization of cultural issues.

Effect of Fusarium graminearum and infection index on germination and vigor of maize seeds

Patógenos em sementes de milho (Zea mays) causam sérios problemas, como a perda de sua capacidade germinativa. O objetivo do trabalho foi determinar qual o melhor tempo para infecção das sementes de milho com Fusarium graminearum, para posterior avaliação dos danos causados pelo fungo na germinação e vigor das mesmas. As sementes foram colocadas sobre meio de BDA contendo o patógeno e incubadas por 4, 8, 16 e 32 h. Após os respectivos períodos de incubação, estas foram submetidas ao teste de sanidade (papel de filtro), com duas variações, sem e com assepsia superficial, usando hipoclorito de sódio a 1% de cloro ativo, por 3 min. Determinado o melhor tempo para infecção, outras sementes foram infetadas com o patógeno, para realização dos testes de germinação e vigor (envelhecimento acelerado e teste de frio) com uma mistura de sementes sadias (colocadas sobre o meio BDA) e sementes inoculadas, resultando em 0, 20, 40, 60, 80 e 100% de sementes infetadas com o fungo em estudo. Os resultados obtidos mostraram que o período de incubação de 32 h foi suficiente para se obter sementes infetadas. Com relação à germinação, não houve diferenças significativas entre os diferentes níveis de infecção, provavelmente devido ao alto vigor das sementes de milho testadas. Quanto aos testes de vigor, os níveis de infecção diferiram significativamente da testemunha, apesar de não terem diferido entre si.

Desenvolvimento de um sistema de automação para uma planta de inertização de resíduos por plasma

The traditional processes for treatment of hazardous waste are questionable for it generates other wastes that adversely affect people s health. As an attempt to minimize these problems, it was developed a system for treatment of hazardous waste by thermal plasma, a more appropriate technology since it produces high temperatures, preventing the formation of toxic pollutants to human beings. The present work brings out a solution of automation for this plant. The system has local and remote monitoring resources to ensure the operators security as well as the process itself. A special attention was given to the control of the main reactor temperature of the plant as it is the place where the main processing occurs and because it presents a complex mathematical model. To this, it was employed cascaded controls based on Fuzzy logic. A process computer, with a particular man-machine interface (MMI), provides information and controls of the plant to the operator, including by Internet. A compact PLC module is in charge of the central element of management automation and plant control which receives information from sensors, and sends it to the MMI

Controlador preditivo não linear aplicado ao controle de golfadas em processos de produção de petróleo

Slugging is a well-known slugging phenomenon in multiphase flow, which may cause problems such as vibration in pipeline and high liquid level in the separator. It can be classified according to the place of its occurrence. The most severe, known as slugging in the riser, occurs in the vertical pipe which feeds the platform. Also known as severe slugging, it is capable of causing severe pressure fluctuations in the flow of the process, excessive vibration, flooding in separator tanks, limited production, nonscheduled stop of production, among other negative aspects that motivated the production of this work . A feasible solution to deal with this problem would be to design an effective method for the removal or reduction of the system, a controller. According to the literature, a conventional PID controller did not produce good results due to the high degree of nonlinearity of the process, fueling the development of advanced control techniques. Among these, the model predictive controller (MPC), where the control action results from the solution of an optimization problem, it is robust, can incorporate physical and /or security constraints. The objective of this work is to apply a non-conventional non-linear model predictive control technique to severe slugging, where the amount of liquid mass in the riser is controlled by the production valve and, indirectly, the oscillation of flow and pressure is suppressed, while looking for environmental and economic benefits. The proposed strategy is based on the use of the model linear approximations and repeatedly solving of a quadratic optimization problem, providing solutions that improve at each iteration. In the event where the convergence of this algorithm is satisfied, the predicted values of the process variables are the same as to those obtained by the original nonlinear model, ensuring that the constraints are satisfied for them along the prediction horizon. A mathematical model recently published in the literature, capable of representing characteristics of severe slugging in a real oil well, is used both for simulation and for the project of the proposed controller, whose performance is compared to a linear MPC

Quality of TEC Estimated with Mod Ion Using GPS and GLONASS Data

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Stochastic stability for Markovian jump linear systems associated with a finite number of jump times

This paper deals with a stochastic stability concept for discrete-time Markovian jump linear systems. The random jump parameter is associated to changes between the system operation modes due to failures or repairs, which can be well described by an underlying finite-state Markov chain. In the model studied, a fixed number of failures or repairs is allowed, after which, the system is brought to a halt for maintenance or for replacement. The usual concepts of stochastic stability are related to pure infinite horizon problems, and are not appropriate in this scenario. A new stability concept is introduced, named stochastic tau-stability that is tailored to the present setting. Necessary and sufficient conditions to ensure the stochastic tau-stability are provided, and the almost sure stability concept associated with this class of processes is also addressed. The paper also develops equivalences among second order concepts that parallels the results for infinite horizon problems. (C) 2003 Elsevier B.V. All rights reserved.

A bounded upwinding scheme for computing convection-dominated transport problems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Bifurcation Analysis of a Van der Pol-Duffing Circuit with Parallel Resistor

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

GPS Satellite Kinematic Relative Positioning: Analyzing and Improving the Functional Mathematical Model Using Wavelets

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Evaluation of a bounded high order upwind scheme for 3D incompressible free surface flow computations

fit the context of normalized variable formulation (NVF) of Leonard and total variation diminishing (TVD) constraints of Harten. this paper presents an extension of it previous work by the authors for solving unsteady incompressible flow problems. The main contributions of the paper are threefold. First, it presents the results of the development and implementation of a bounded high order upwind adaptative QUICKEST scheme in the 3D robust code (Freeflow), for the numerical solution of the full incompressible Navier-Stokes equations. Second, it reports numerical simulation results for 1D hock tube problem, 2D impinging jet and 2D/3D broken clam flows. Furthermore, these results are compared with existing analytical and experimental data. and third, it presents the application of the numerical method for solving 3D free surface flow problems. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved,

About the Use of the HdHr Algorithm Group in Integrating the Movement Equation with Nonlinear Terms

This work summarizes the HdHr group of Hermitian integration algorithms for dynamic structural analysis applications. It proposes a procedure for their use when nonlinear terms are present in the equilibrium equation. The simple pendulum problem is solved as a first example and the numerical results are discussed. Directions to be pursued in future research are also mentioned. Copyright (C) 2009 H.M. Bottura and A. C. Rigitano.

Binary integer programming formulations for scheduling in market-driven foundries

This paper describes the development and solution of binary integer formulations for production scheduling problems in market-driven foundries. This industrial sector is comprised of small and mid-sized companies with little or no automation, working with diversified production, involving several different metal alloy specifications in small tailor-made product lots. The characteristics and constraints involved in a typical production environment at these industries challenge the formulation of mathematical programming models that can be computationally solved when considering real applications. However, despite the interest on the part of these industries in counting on effective methods for production scheduling, there are few studies available on the subject. The computational tests prove the robustness and feasibility of proposed models in situations analogous to those found in production scheduling at the analyzed industrial sector. (C) 2010 Elsevier Ltd. All rights reserved.