976 resultados para location-allocation problem
Resumo:
This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.
Resumo:
We propose a model and solution methods, for locating a fixed number ofmultiple-server, congestible common service centers or congestible publicfacilities. Locations are chosen so to minimize consumers congestion (orqueuing) and travel costs, considering that all the demand must be served.Customers choose the facilities to which they travel in order to receiveservice at minimum travel and congestion cost. As a proxy for thiscriterion, total travel and waiting costs are minimized. The travel costis a general function of the origin and destination of the demand, whilethe congestion cost is a general function of the number of customers inqueue at the facilities.
Resumo:
We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.
Resumo:
This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.
Resumo:
This article builds on the recent policy diffusion literature and attempts to overcome one of its major problems, namely the lack of a coherent theoretical framework. The literature defines policy diffusion as a process where policy choices are interdependent, and identifies several diffusion mechanisms that specify the link between the policy choices of the various actors. As these mechanisms are grounded in different theories, theoretical accounts of diffusion currently have little internal coherence. In this article we put forward an expected-utility model of policy change that is able to subsume all the diffusion mechanisms. We argue that the expected utility of a policy depends on both its effectiveness and the payoffs it yields, and we show that the various diffusion mechanisms operate by altering these two parameters. Each mechanism affects one of the two parameters, and does so in distinct ways. To account for aggregate patterns of diffusion, we embed our model in a simple threshold model of diffusion. Given the high complexity of the process that results, strong analytical conclusions on aggregate patterns cannot be drawn without more extensive analysis which is beyond the scope of this article. However, preliminary considerations indicate that a wide range of diffusion processes may exist and that convergence is only one possible outcome.
Resumo:
When siblings differ markedly in their need for food, they may benefit from signalling to each other their willingness to contest the next indivisible food item delivered by the parents. This sib-sib communication system, referred to as 'sibling negotiation', may allow them to adjust optimally to investment in begging. Using barn owl (Two alba) broods. I assessed the role of within-brood age hierarchy on sibling negotiation, and in turn on jostling for position where parents predictably deliver food (i.e. nest-box entrance), begging and within-brood food allocation. More specifically, I examined three predictions derived from a game-theoretical model of sibling negotiation where a senior and a junior sibling compete for food resources (Roulin, 2002a, Johnstone and Roulin, 2003): (1) begging effort invested by the senior sibling should be less sensitive to the junior sibling's negotiation than vice versa; (2) the junior should invest less effort in sibling negotiation than its senior sibling but a similar amount of effort in begging; and (3) within-brood food allocation should be directly related to begging but only indirectly to sibling negotiation. Two-chick broods were created and vocalization in the absence (negotiation signals directed to siblings) and presence (begging signals directed to parents) of parents was recorded. In support of the first prediction, juniors begged at a low cadence after their senior sibling negotiated intensely, probably because negotiation reflects prospective investment in begging and hence willingness to compete. In contrast, the begging of senior siblings was not sensitive to their junior sibling's negotiation. In contrast to the second prediction, juniors negotiated and begged more intensely than their senior sibling apparently because they were hungrier rather than younger. In line with the third prediction, juniors monopolized food delivered by their parents when their senior sibling begged at a low level. The begging cadence of both the junior and senior sibling, the junior's negotiation cadence, the difference in age between the two nest-mates and jostling for position were not associated with the likelihood of monopolizing food. In conclusion, sibling negotiation appears to influence begging behaviour, which, in turn, affects within-brood food allocation. Juniors may negotiate to challenge their senior siblings, and thereby determine whether seniors are less hungry before deciding to beg for food. In contrast, seniors may negotiate to deter juniors from begging.
Resumo:
This brochure provides general information about relocation assistance provided by the Iowa Department of Transportation (DOT) for those individuals who may be required to move as a result of a highway project. It is not intended to be a legal document that comprehensively explains every right or obligation you have as established by Chapter 316, Code of Iowa; Federal Public Laws 91-646 and 100-17; and 49 CFR. Your relocation adviser will provide the assistance you need to successfully relocate to a suitable replacement property. Your first contact with your relocation adviser will usually occur during the early stages of the appraisal process, and he or she will continue to work with you until you have moved and become established at a new location. Do not hesitate to ask questions so you are sure you understand the process, your rights and the benefits available to you. Please let your DOT relocation adviser know your needs and preferences. If your relocation adviser is unable to help you with a specific problem or concern, he or she may know of another person or an organization that can help you. DO NOT MOVE UNTIL YOU HAVE CONTACTED YOUR DOT RELOCATION ADVISER. Only then will you be sure you are not jeopardizing your potential rights and benefits under this program. No person who lawfully occupies real property will be required by DOT to move without being notified in writing at least 90 days in advance.
Resumo:
The results of the application of the geophysical electromagnetic prospection methods in the resolution of the problems of the spatial location of the travertine quaternary formations of the Banyoles depression are presented
Resumo:
Roux-en-Y gastric bypass (RYGBP) is currently the most common bariatric procedure. One of its late complications is the development of internal hernia, which can lead to acute intestinal obstruction or recurrent colicky abdominal pain. The aim of this paper is to present a new, unusual, and so far not reported type of internal hernia. A common computerized database is maintained for all patients undergoing bariatric surgery in our departments. The charts of patients with the diagnosis of internal hernia were reviewed. Three patients were identified who developed acute intestinal obstruction due to an internal hernia located between the jejunojejunostomy and the end of the biliopancreatic limb, directly between two jejunal limbs with no mesentery involved. Another seven patients with intermittent colicky abdominal pain, re-explored for the suspicion of internal hernia, were found to also have an open window of the same location apart from a hernia at one of the typical hernia sites. Since this gap is systematically closed during RYGBP, no other patient has been observed with this problem. Even very small defects can lead to the development of internal hernias after RYGBP. Patients with suggestive symptoms must be explored. Closure of the jejunojejunal defect with nonabsorbable sutures prevents the development of an internal hernia between the jejunal loops at the jejunojejunostomy.
Resumo:
This paper describes an optimized model to support QoS by mean of Congestion minimization on LSPs (Label Switching Path). In order to perform this model, we start from a CFA (Capacity and Flow Allocation) model. As this model does not consider the buffer size to calculate the capacity cost, our model- named BCA (Buffer Capacity Allocation)- take into account this issue and it improve the CFA performance. To test our proposal, we perform several simulations; results show that BCA model minimizes LSP congestion and uniformly distributes flows on the network
Resumo:
Recent theoretical work in economic geography has shown that agglomeration forces can mitigate 'race-to-the-bottom' tax competition, by partly or fully offsetting firms' sensitivity to tax differentials. We test this proposition using data on firm births across Swiss municipalities. We find that corporate taxes deter firm births less in more spatially concentrated sectors. Firms in sectors with an agglomeration intensity in the top quintile are less than half as responsive to differences in corporate tax burdens as firms in sectors with an agglomeration intensity in the bottom quintile. Hence, agglomeration economies do appear to attenuate the impact of tax differentials on firms' location choices.