987 resultados para Berth allocation problem
Resumo:
[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player
Resumo:
Despite global environmental governance has traditionally couched global warming in terms of annual CO2 emissions (a flow), global mean temperature is actually determined by cumulative CO2 emissions in the atmosphere (a stock). Thanks to advances of scientific community, nowadays it is possible to quantify the \global carbon budget", that is, the amount of available cumulative CO2 emissions before crossing the 2oC threshold (Meinshausen et al., 2009). The current approach proposes to analyze the allocation of such global carbon budget among countries as a classical conflicting claims problem (O'Neill, 1982). Based on some appealing principles, it is proposed an efficient and sustainable allocation of the available carbon budget from 2000 to 2050 taking into account different environmental risk scenarios. Keywords: Carbon budget, Conflicting claims problem, Distribution, Climate change. JEL classification: C79, D71, D74, H41, H87, Q50, Q54, Q58.
Resumo:
A minimum cost spanning tree (mcst) problem analyzes the way to efficiently connect individuals to a source when they are located at different places. Once the efficient tree is obtained, the question on how allocating the total cost among the involved agents defines, in a natural way, a confliicting claims situation. For instance, we may consider the endowment as the total cost of the network, whereas for each individual her claim is the maximum amount she will be allocated, that is, her connection cost to the source. Obviously, we have a confliicting claims problem, so we can apply claims rules in order to obtain an allocation of the total cost. Nevertheless, the allocation obtained by using claims rules might not satisfy some appealing properties (in particular, it does not belong to the core of the associated cooperative game). We will define other natural claims problems that appear if we analyze the maximum and minimum amount that an individual should pay in order to support the minimum cost tree. Keywords: Minimum cost spanning tree problem, Claims problem, Core JEL classification: C71, D63, D71.
Resumo:
This thesis discusses the basic problem of the modern portfolio theory about how to optimise the perfect allocation for an investment portfolio. The theory provides a solution for an efficient portfolio, which minimises the risk of the portfolio with respect to the expected return. A central feature for all the portfolios on the efficient frontier is that the investor needs to provide the expected return for each asset. Market anomalies are persistent patterns seen in the financial markets, which cannot be explained with the current asset pricing theory. The goal of this thesis is to study whether these anomalies can be observed among different asset classes. Finally, if persistent patterns are found, it is investigated whether the anomalies hold valuable information for determining the expected returns used in the portfolio optimization Market anomalies and investment strategies based on them are studied with a rolling estimation window, where the return for the following period is always based on historical information. This is also crucial when rebalancing the portfolio. The anomalies investigated within this thesis are value, momentum, reversal, and idiosyncratic volatility. The research data includes price series of country level stock indices, government bonds, currencies, and commodities. The modern portfolio theory and the views given by the anomalies are combined by utilising the Black-Litterman model. This makes it possible to optimise the portfolio so that investor’s views are taken into account. When constructing the portfolios, the goal is to maximise the Sharpe ratio. Significance of the results is studied by assessing if the strategy yields excess returns in a relation to those explained by the threefactormodel. The most outstanding finding is that anomaly based factors include valuable information to enhance efficient portfolio diversification. When the highest Sharpe ratios for each asset class are picked from the test factors and applied to the Black−Litterman model, the final portfolio results in superior riskreturn combination. The highest Sharpe ratios are provided by momentum strategy for stocks and long-term reversal for the rest of the asset classes. Additionally, a strategy based on the value effect was highly appealing, and it basically performs as well as the previously mentioned Sharpe strategy. When studying the anomalies, it is found, that 12-month momentum is the strongest effect, especially for stock indices. In addition, a high idiosyncratic volatility seems to be positively correlated with country indices on stocks.
Resumo:
In practice we often face the problem of assigning indivisible objects (e.g., schools, housing, jobs, offices) to agents (e.g., students, homeless, workers, professors) when monetary compensations are not possible. We show that a rule that satisfies consistency, strategy-proofness, and efficiency must be an efficient generalized priority rule; i.e. it must adapt to an acyclic priority structure, except -maybe- for up to three agents in each object's priority ordering.
Resumo:
L’industrie forestière est un secteur qui, même s’il est en déclin, se trouve au cœur du débat sur la mondialisation et le développement durable. Pour de nombreux pays tels que le Canada, la Suède et le Chili, les objectifs sont de maintenir un secteur florissant sans nuire à l’environnement et en réalisant le caractère fini des ressources. Il devient important d’être compétitif et d’exploiter de manière efficace les territoires forestiers, de la récolte jusqu’à la fabrication des produits aux usines, en passant par le transport, dont les coûts augmentent rapidement. L’objectif de ce mémoire est de développer un modèle de planification tactique/opérationnelle qui permet d’ordonnancer les activités pour une année de récolte de façon à satisfaire les demandes des usines, sans perdre de vue le transport des quantités récoltées et la gestion des inventaires en usine. L’année se divise en 26 périodes de deux semaines. Nous cherchons à obtenir les horaires et l’affectation des équipes de récolte aux blocs de coupe pour une année. Le modèle mathématique développé est un problème linéaire mixte en nombres entiers dont la structure est basée sur chaque étape de la chaine d’approvisionnement forestière. Nous choisissons de le résoudre par une méthode exacte, le branch-and-bound. Nous avons pu évaluer combien la résolution directe de notre problème de planification était difficile pour les instances avec un grand nombre de périodes. Cependant l’approche des horizons roulants s’est avérée fructueuse. Grâce à elle en une journée, il est possible de planifier les activités de récolte des blocs pour l’année entière (26 périodes).
Resumo:
The The The The growing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demandgrowing demand for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of for the expansion of the the the the publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system publicly funded system of education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goodof education as merit and free goods emphasized emphasized emphasized emphasized emphasized emphasized emphasized emphasized emphasized emphasized on large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation large allocation of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds on of funds for promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting educationfor promoting education. Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to . Compared to the rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of Indiathe rest of India, Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead , Kerala is far ahead in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect in this respect primarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the eprimarily because of the earlierarlierarlierarlierarlierarlier political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social political and social compulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions ofcompulsions of the state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The prethe state. The presumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of sumption of assured assured assured assured assured assured assured assured and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed and guaranteed employment in employment in employment in employment in employment in employment in employment in employment in employment in employment in employment in employment in the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East the Middle East and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other and also in other countries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased furthecountries increased further the scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher educationthe scope of higher education in KeralaKeralaKeralaKeralaKeralaKerala, particularparticularparticularparticularparticularparticularparticularparticularparticularparticularly the technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe technical educationthe
Resumo:
We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other. There is also a maximum amount of money available for the compensation. We characterize a family of asymmetrically fair rules that are immune to strategic behavior, guarantee minimal welfare levels for the agents, and satisfy the budget constraint.
Resumo:
En problemes d'assignació de recursos, normalment s'han de tenir en compte les incerteses que poden provocar canvis en les dades inicials. Aquests canvis dificulten l'aplicabilitat de les planificacions que s'hagin fet inicialment. Aquesta tesi se centra en l'elaboració de tècniques que consideren la incertesa alhora de cercar solucions robustes, és a dir solucions que puguin continuar essent vàlides encara que hi hagi canvis en l'entorn. Particularment, introduïm el concepte de robustesa basat en reparabilitat, on una solució robusta és una que pot ser reparada fàcilment en cas que hi hagi incidències. La nostra aproximació es basa en lògica proposicional, codificant el problema en una fórmula de satisfactibilitat Booleana, i aplicant tècniques de reformulació per a la generació de solucions robustes. També presentem un mecanisme per a incorporar flexibilitat a les solucions robustes, de manera que es pugui establir fàcilment el grau desitjat entre robustesa i optimalitat de les solucions.
Resumo:
The Stochastic Diffusion Search (SDS) was developed as a solution to the best-fit search problem. Thus, as a special case it is capable of solving the transform invariant pattern recognition problem. SDS is efficient and, although inherently probabilistic, produces very reliable solutions in widely ranging search conditions. However, to date a systematic formal investigation of its properties has not been carried out. This thesis addresses this problem. The thesis reports results pertaining to the global convergence of SDS as well as characterising its time complexity. However, the main emphasis of the work, reports on the resource allocation aspect of the Stochastic Diffusion Search operations. The thesis introduces a novel model of the algorithm, generalising an Ehrenfest Urn Model from statistical physics. This approach makes it possible to obtain a thorough characterisation of the response of the algorithm in terms of the parameters describing the search conditions in case of a unique best-fit pattern in the search space. This model is further generalised in order to account for different search conditions: two solutions in the search space and search for a unique solution in a noisy search space. Also an approximate solution in the case of two alternative solutions is proposed and compared with predictions of the extended Ehrenfest Urn model. The analysis performed enabled a quantitative characterisation of the Stochastic Diffusion Search in terms of exploration and exploitation of the search space. It appeared that SDS is biased towards the latter mode of operation. This novel perspective on the Stochastic Diffusion Search lead to an investigation of extensions of the standard SDS, which would strike a different balance between these two modes of search space processing. Thus, two novel algorithms were derived from the standard Stochastic Diffusion Search, ‘context-free’ and ‘context-sensitive’ SDS, and their properties were analysed with respect to resource allocation. It appeared that they shared some of the desired features of their predecessor but also possessed some properties not present in the classic SDS. The theory developed in the thesis was illustrated throughout with carefully chosen simulations of a best-fit search for a string pattern, a simple but representative domain, enabling careful control of search conditions.
Resumo:
In this paper, we develop an energy-efficient resource-allocation scheme with proportional fairness for downlink multiuser orthogonal frequency-division multiplexing (OFDM) systems with distributed antennas. Our aim is to maximize energy efficiency (EE) under the constraints of the overall transmit power of each remote access unit (RAU), proportional fairness data rates, and bit error rates (BERs). Because of the nonconvex nature of the optimization problem, obtaining the optimal solution is extremely computationally complex. Therefore, we develop a low-complexity suboptimal algorithm, which separates subcarrier allocation and power allocation. For the low-complexity algorithm, we first allocate subcarriers by assuming equal power distribution. Then, by exploiting the properties of fractional programming, we transform the nonconvex optimization problem in fractional form into an equivalent optimization problem in subtractive form, which includes a tractable solution. Next, an optimal energy-efficient power-allocation algorithm is developed to maximize EE while maintaining proportional fairness. Through computer simulation, we demonstrate the effectiveness of the proposed low-complexity algorithm and illustrate the fundamental trade off between energy and spectral-efficient transmission designs.
Resumo:
The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. In this problem, the allocation of multiple individuals that match a required set of skills as a group must be chosen to maximise one or several social positive attributes. Speci�cally, the aim of the current research is two-fold. First, two new dimensions of the TFP are added by considering multiple projects and fractions of people's dedication. This new problem is named the Multiple Team Formation Problem (MTFP). Second, an optimization model consisting in a quadratic objective function, linear constraints and integer variables is proposed for the problem. The optimization model is solved by three algorithms: a Constraint Programming approach provided by a commercial solver, a Local Search heuristic and a Variable Neighbourhood Search metaheuristic. These three algorithms constitute the first attempt to solve the MTFP, being a variable neighbourhood local search metaheuristic the most effi�cient in almost all cases. Applications of this problem commonly appear in real-life situations, particularly with the current and ongoing development of social network analysis. Therefore, this work opens multiple paths for future research.
Resumo:
We develop a model to study shelf space allocation in retail. Retailers compete for consumers not only choosing prices but also by the space allocated to each product on shelves. Our approach depart from the existing literature on shelf allocation, as we model the problem of price setting and shelf allocation in an oligopolistic retail market. We present a simple model of retail competition in which prices are dispersed in the crosssection of stores but shelf allocation is not.
Resumo:
We study the problem of centralized allocation of indivisible objects in multiple markets. We show that the set of allocation rules that are group strategy-proof and Pareto-efficient are sequential dictatorships. Therefore, the solution of the joint al-location in multiple markets is significantly narrower than in the single-market case. Our result also applies to dynamic allocation problems. Finally, we provide conditions under which the solution of the single-market allocation coincides with the multiple-market case, and we apply this result to the study of the school choice problem with sibling priorities.
Resumo:
This article starts by analysing healthcare litigation in Brazil by means of a literature review of articles that contribute with empirical findings on this phenomenon. Based on this review, I argue that health care litigation in Brazil makes the public health system less fair and rational. In the second part of this article, I discuss the three most overarching responses to control the level of litigation and its impact on the public health system: (i) the public hearing held by the Supreme Federal Court and the criteria the court established thereafter; (ii) the recommendations by the National Council of Justice aimed at building courts’ institutional capacity; and (iii) the enactment of the Federal Law 12.401/11, which created a new health technology assessment system. I argue that latter is the best response because it keeps the substantive decisions on the allocation of healthcare resources in the institution that is in the best position to make them. Moreover, this legislation will make the decisions about provision of health treatments more explicit, making easier for courts to control the procedure and the reasons for these decisions.