Reformulações para o problema integrado de dimensionamento e sequenciamento da produção

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

Algorithms for UAS insertion in civil air space

One of the most interesting challenge of the next years will be the Air Space Systems automation. This process will involve different aspects as the Air Traffic Management, the Aircrafts and Airport Operations and the Guidance and Navigation Systems. The use of UAS (Uninhabited Aerial System) for civil mission will be one of the most important steps in this automation process. In civil air space, Air Traffic Controllers (ATC) manage the air traffic ensuring that a minimum separation between the controlled aircrafts is always provided. For this purpose ATCs use several operative avoidance techniques like holding patterns or rerouting. The use of UAS in these context will require the definition of strategies for a common management of piloted and piloted air traffic that allow the UAS to self separate. As a first employment in civil air space we consider a UAS surveillance mission that consists in departing from a ground base, taking pictures over a set of mission targets and coming back to the same ground base. During all mission a set of piloted aircrafts fly in the same airspace and thus the UAS has to self separate using the ATC avoidance as anticipated. We consider two objective, the first consists in the minimization of the air traffic impact over the mission, the second consists in the minimization of the impact of the mission over the air traffic. A particular version of the well known Travelling Salesman Problem (TSP) called Time-Dependant-TSP has been studied to deal with traffic problems in big urban areas. Its basic idea consists in a cost of the route between two clients depending on the period of the day in which it is crossed. Our thesis supports that such idea can be applied to the air traffic too using a convenient time horizon compatible with aircrafts operations. The cost of a UAS sub-route will depend on the air traffic that it will meet starting such route in a specific moment and consequently on the avoidance maneuver that it will use to avoid that conflict. The conflict avoidance is a topic that has been hardly developed in past years using different approaches. In this thesis we purpose a new approach based on the use of ATC operative techniques that makes it possible both to model the UAS problem using a TDTSP framework both to use an Air Traffic Management perspective. Starting from this kind of mission, the problem of the UAS insertion in civil air space is formalized as the UAS Routing Problem (URP). For this reason we introduce a new structure called Conflict Graph that makes it possible to model the avoidance maneuvers and to define the arc cost function of the departing time. Two Integer Linear Programming formulations of the problem are proposed. The first is based on a TDTSP formulation that, unfortunately, is weaker then the TSP formulation. Thus a new formulation based on a TSP variation that uses specific penalty to model the holdings is proposed. Different algorithms are presented: exact algorithms, simple heuristics used as Upper Bounds on the number of time steps used, and metaheuristic algorithms as Genetic Algorithm and Simulated Annealing. Finally an air traffic scenario has been simulated using real air traffic data in order to test our algorithms. Graphic Tools have been used to represent the Milano Linate air space and its air traffic during different days. Such data have been provided by ENAV S.p.A (Italian Agency for Air Navigation Services).

Product warranty logistics: Issues and challenges

Warranty is an important element of marketing new products. The servicing of warranty results in additional costs to the manufacturer. Warranty logistics deals with various issues relating to the servicing of warranty. Proper management of warranty logistics is needed not only to reduce the warranty servicing cost but also to ensure customer satisfaction as customer dissatisfaction has a negative impact on sales and revenue. Unfortunately, warranty logistics has received very little attention. The paper links the literature on warranty and on logistics and then discusses the different issues in warranty logistics. It highlights the challenges and identifies some research topics of potential interest to operational researchers. (C) 2003 Elsevier B.V. All rights reserved.

A study on the deployment of GA in a grid computing framework

Dissertação de Mestrado, Engenharia Informática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, 2015

Vehicle routing and location routing problems with minimum latency: algorithms and models

Latency can be defined as the sum of the arrival times at the customers. Minimum latency problems are specially relevant in applications related to humanitarian logistics. This thesis presents algorithms for solving a family of vehicle routing problems with minimum latency. First the latency location routing problem (LLRP) is considered. It consists of determining the subset of depots to be opened, and the routes that a set of homogeneous capacitated vehicles must perform in order to visit a set of customers such that the sum of the demands of the customers assigned to each vehicle does not exceed the capacity of the vehicle. For solving this problem three metaheuristic algorithms combining simulated annealing and variable neighborhood descent, and an iterated local search (ILS) algorithm, are proposed. Furthermore, the multi-depot cumulative capacitated vehicle routing problem (MDCCVRP) and the multi-depot k-traveling repairman problem (MDk-TRP) are solved with the proposed ILS algorithm. The MDCCVRP is a special case of the LLRP in which all the depots can be opened, and the MDk-TRP is a special case of the MDCCVRP in which the capacity constraints are relaxed. Finally, a LLRP with stochastic travel times is studied. A two-stage stochastic programming model and a variable neighborhood search algorithm are proposed for solving the problem. Furthermore a sampling method is developed for tackling instances with an infinite number of scenarios. Extensive computational experiments show that the proposed methods are effective for solving the problems under study.

On the Hamilton-Waterloo problem

The Hamilton-Waterloo problem asks for a 2-factorisation of K-v in which r of the 2-factors consist of cycles of lengths a(1), a(2),..., a(1) and the remaining s 2-factors consist of cycles of lengths b(1), b(2),..., b(u) (where necessarily Sigma(i)(=1)(t) a(i) = Sigma(j)(=1)(u) b(j) = v). In thus paper we consider the Hamilton-Waterloo problem in the case a(i) = m, 1 less than or equal to i less than or equal to t and b(j) = n, 1 less than or equal to j less than or equal to u. We obtain some general constructions, and apply these to obtain results for (m, n) is an element of {(4, 6)1(4, 8), (4, 16), (8, 16), (3, 5), (3, 15), (5, 15)}.

Hamilton-Waterloo problem with triangle and C9 factors

The Hamilton-Waterloo problem and its spouse-avoiding variant for uniform cycle sizes asks if Kv, where v is odd (or Kv - F, if v is even), can be decomposed into 2-factors in which each factor is made either entirely of m-cycles or entirely of n-cycles. This thesis examines the case in which r of the factors are made up of cycles of length 3 and s of the factors are made up of cycles of length 9, for any r and s. We also discuss a constructive solution to the general (m,n) case which fixes r and s.

GLOBAL WELL-POSEDNESS AND NON-LINEAR STABILITY OF PERIODIC TRAVELING WAVES FOR A SCHRODINGER-BENJAMIN-ONO SYSTEM

The objective of this paper is two-fold: firstly, we develop a local and global (in time) well-posedness theory for a system describing the motion of two fluids with different densities under capillary-gravity waves in a deep water flow (namely, a Schrodinger-Benjamin-Ono system) for low-regularity initial data in both periodic and continuous cases; secondly, a family of new periodic traveling waves for the Schrodinger-Benjamin-Ono system is given: by fixing a minimal period we obtain, via the implicit function theorem, a smooth branch of periodic solutions bifurcating a Jacobian elliptic function called dnoidal, and, moreover, we prove that all these periodic traveling waves are nonlinearly stable by perturbations with the same wavelength.

Periodic orbits near a heteroclinic loop formed by one dimensional orbit and a 2-dimensional manifold: application to the charged collinear 3-body problem

The paper is devoted to the study of a type of differential systems which appear usually in the study of some Hamiltonian systems with 2 degrees of freedom. We prove the existence of infinitely many periodic orbits on each negative energy level. All these periodic orbits pass near the total collision. Finally we apply these results to study the existence of periodic orbits in the charged collinear 3–body problem.

Problem-based learning and legal education : a case study in integrated experiential study

Resumen basado en el de la publicaci??n

Optimal pest control problem in population dynamics

One of the main goals of the pest control is to maintain the density of the pest population in the equilibrium level below economic damages. For reaching this goal, the optimal pest control problem was divided in two parts. In the first part, the two optimal control functions were considered. These functions move the ecosystem pest-natural enemy at an equilibrium state below the economic injury level. In the second part, the one optimal control function stabilizes the ecosystem in this level, minimizing the functional that characterizes quadratic deviations of this level. The first problem was resolved through the application of the Maximum Principle of Pontryagin. The Dynamic Programming was used for the resolution of the second optimal pest control problem.

Formalismo de Hamilton-Jacobi generalizado: teorias de campos com derivadas de ordem superior

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

Do cyanobacteria swim using traveling surface waves?

Bacteria that swim without the benefit of flagella might do so by generating longitudinal or transverse surface waves. For example, swimming speeds of order 25 microns/s are expected for a spherical cell propagating longitudinal waves of 0.2 micron length, 0.02 micron amplitude, and 160 microns/s speed. This problem was solved earlier by mathematicians who were interested in the locomotion of ciliates and who considered the undulations of the envelope swept out by ciliary tips. A new solution is given for spheres propagating sinusoidal waveforms rather than Legendre polynomials. The earlier work is reviewed and possible experimental tests are suggested.

Types of evolutionary stability and the problem of cooperation.

The evolutionary stability of cooperation is a problem of fundamental importance for the biological and social sciences. Different claims have been made about this issue: whereas Axelrod and Hamilton's [Axelrod, R. & Hamilton, W. (1981) Science 211, 1390-1398] widely recognized conclusion is that cooperative rules such as "tit for tat" are evolutionarily stable strategies in the iterated prisoner's dilemma (IPD), Boyd and Lorberbaum [Boyd, R. & Lorberbaum, J. (1987) Nature (London) 327, 58-59] have claimed that no pure strategy is evolutionarily stable in this game. Here we explain why these claims are not contradictory by showing in what sense strategies in the IPD can and cannot be stable and by creating a conceptual framework that yields the type of evolutionary stability attainable in the IPD and in repeated games in general. Having established the relevant concept of stability, we report theorems on some basic properties of strategies that are stable in this sense. We first show that the IPD has "too many" such strategies, so that being stable does not discriminate among behavioral rules. Stable strategies differ, however, on a property that is crucial for their evolutionary survival--the size of the invasion they can resist. This property can be interpreted as a strategy's evolutionary robustness. Conditionally cooperative strategies such as tit for tat are the most robust. Cooperative behavior supported by these strategies is the most robust evolutionary equilibrium: the easiest to attain, and the hardest to disrupt.