Non emergency patients transport - a mixed integer linear programming

This work presents a model and a heuristic to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving problems with one vehicle was presented, and this heuristic provides good results in terms of accuracy and computation time.

Lightweight adjustable partition system: evaluation of resistance to horizontal loads and functional failure from impacts

This paper presents and discusses the results of the serviciability and use condition tests carried on an innovative solution for partitions, designated AdjustMembrane developed within a research project. The proposed system is a modular non-loadbearing wall, tensioned between the pavements and ceiling slabs, which are used as anchoring elements. It allows several advantages, related with the weight reduction to achieve a good sustainable performance, such as the reduction of construction costs, energy, and materials, and it is easy to recycle and to reuse, allowing self-construction. Apart from a general presentation of the partition technology, this paper presents and discusses the results of experimental tests carried out. From the results obtained, it is possible to conclude that the solution fulfils the requirements for this typology of wall in terms of resistance to horizontal loads induced by soft and hard body impacts.

Interrelationship between partition behavior of organic compounds and proteins in aqueous dextran-Polyethylene glycol and Polyethylene glycol-sodium sulfate two-phase systems

Partition behavior of adenosine and guanine mononucleotides was examined in aqueous dextran-polyethylene glycol (PEG) and PEG-sodium sulfate two-phase systems. The partition coefficients for each series of mononucleotides were analyzed as a functions of the number of phosphate groups and found to be dependent on the nature of nucleic base and on the type of \ATPS\ utilized. It was concluded that an average contribution of a phosphate group into logarithm of partition coefficient of a mononucleotide cannot be used to estimate the difference between the electrostatic properties of the coexisting phases of ATPS. The data obtained in this study were considered together with those for other organic compounds and proteins reported previously, and the linear interrelationship between logarithms of partition coefficients in dextran-PEG, PEG-Na2SO4 and PEG-Na2SO4-0.215 M NaCl (all in 0.01 M Na- or K/Na-phosphate buffer, pH 7.4 or 6.8) was established. Similar relationship was found for the previously reported data for proteins in Dex-PEG, PEG-600-Na2SO4, and PEG-8000-Na2SO4 ATPS. It is suggested that the linear relationships of the kind established in \ATPS\ may be observed for biological properties of compounds as well.

Random walk forecast of urban water in Iran under uncertainty

There are two significant reasons for the uncertainties of water demand. On one hand, an evolving technological world is plagued with accelerated change in lifestyles and consumption patterns; and on the other hand, intensifying climate change. Therefore, with an uncertain future, what enables policymakers to define the state of water resources, which are affected by withdrawals and demands? Through a case study based on thirteen years of observation data in the Zayandeh Rud River basin in Isfahan province located in Iran, this paper forecasts a wide range of urban water demand possibilities in order to create a portfolio of plans which could be utilized by different water managers. A comparison and contrast of two existing methods are discussed, demonstrating the Random Walk Methodology, which will be referred to as the â On uncertainty pathâ , because it takes the uncertainties into account and can be recommended to managers. This On Uncertainty Path is composed of both dynamic forecasting method and system simulation. The outcomes show the advantage of such methods particularly for places that climate change will aggravate their water scarcity, such as Iran.

Synthesis of plantwide control strategies using mixed integer optimization

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2012

Optimal design in the presence of random or fixed block effects

Magdeburg, Univ., Fak. für Mathematik, Diss., 2014

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

Optimal designs for the prediction in hierarchical random coefficient regression models

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

The complexity of random ordered structures

"Vegeu el resum a l'inici del document del fitxer adjunt."

Endogenous population subgroups: the best population partition and optimal number of groups

The aim of this paper is to suggest a method to find endogenously the points that group the individuals of a given distribution in k clusters, where k is endogenously determined. These points are the cut-points. Thus, we need to determine a partition of the N individuals into a number k of groups, in such way that individuals in the same group are as alike as possible, but as distinct as possible from individuals in other groups. This method can be applied to endogenously identify k groups in income distributions: possible applications can be poverty

Shellability of noncrossing partition lattices

We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type Dn and those of exceptional type and rank at least three.

Optimal monitoring to implement clean technologies when pollution is random

We analyze a model where firms chose a production technology which, together with some random event, determines the final emission level. We consider the coexistence of two alternative technologies: a "clean" technology, and a "dirty" technology. The environmental regulation is based on taxes over reported emissions, and on penalties over unreported emissions. We show that the optimal inspection policy is a cut-off strategy, for several scenarios concerning the observability of the adoption of the clean technology and the cost of adopting it. We also show that the optimal inspection policy induces the firm to adopt the clean technology if the adoption cost is not too high, but the cost levels for which the firm adopts it depend on the scenario.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach

In the line opened by Kalai and Muller (1997), we explore new conditions on prefernce domains which make it possible to avoid Arrow's impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In the proof, we use integer programming tools, following an approach first applied to social choice theory by Sethuraman, Teo and Vohra ((2003), (2006)). In order to obtain a representation of Arrovian social welfare functions whose range can include indifference, we generalize Sethuraman et al.'s work and specify integer programs in which variables are allowed to assume values in the set {0, 1/2, 1}: indeed, we show that, there exists a one-to-one correspondence between solutions of an integer program defined on this set and the set of all Arrovian social welfare functions - without restrictions on the range.