955 resultados para Dynamic Marginal Cost
Resumo:
A graph theoretic approach is developed for accurately computing haulage costs in earthwork projects. This is vital as haulage is a predominant factor in the real cost of earthworks. A variety of metrics can be used in our approach, but a fuel consumption proxy is recommended. This approach is novel as it considers the constantly changing terrain that results from cutting and filling activities and replaces inaccurate “static” calculations that have been used previously. The approach is also capable of efficiently correcting the violation of top down cutting and bottom up filling conditions that can be found in existing earthwork assignments and sequences. This approach assumes that the project site is partitioned into uniform blocks. A directed graph is then utilised to describe the terrain surface. This digraph is altered after each cut and fill, in order to reflect the true state of the terrain. A shortest path algorithm is successively applied to calculate the cost of each haul and these costs are summed to provide a total cost of haulage
Resumo:
The pulse power characteristics of ultracapacitors appear well suited to electric vehicle applications, where they may supply the peak power more efficiently than the battery, and can prevent excessive over sizing of the battery pack due to peak power demands. Operation of ultracapacitors in battery electric vehicles is examined for possible improvements in system efficiency, vehicle driving range, battery pack lifetime, and potential reductions in system lifecycle cost. The lifecycle operation of these ultracapacitors is simulated using custom-built, dynamic simulation code constructed in Matlab. Despite apparent gains in system efficiency and driving range, the results strongly suggest that the inclusion of ultracapacitors in the electric vehicle does not make sense from a lifecycle cost perspective. Furthermore, a comparison with results from earlier work shows that this outcome is highly dependant upon the efficiency and cost of the battery under consideration. However, it is likely that the lifecycle cost benefits of ultracapacitors in these electric vehicles would be, at most, marginal and do not justify the additional capital costs and system complexity that would be incurred in the vehicle
Resumo:
The pulse power characteristics of ultracapacitors appear well suited to electric vehicle applications, where they may supply the peak power more efficiently than the battery, and can prevent excessive over sizing of the battery pack due to peak power demands. Operation of ultracapacitors in battery electric vehicles (BEVs) is examined for possible improvements in system efficiency, vehicle driving range, battery pack lifetime, and potential reductions in system lifecycle cost. The lifecycle operation of these ultracapacitors is simulated using a custom-built, dynamic simulation code constructed in Matlab. Despite apparent gains in system efficiency and driving range, the lifecycle cost benefits as simulated appear to be marginal, and are heavily influenced by the incremental cost of power components. However, additional factors are identified which, in reality, will drive ultracapacitors towards viability in electric vehicle applications.
Resumo:
This paper presents a new method to determine feeder reconfiguration scheme considering variable load profile. The objective function consists of system losses, reliability costs and also switching costs. In order to achieve an optimal solution the proposed method compares these costs dynamically and determines when and how it is reasonable to have a switching operation. The proposed method divides a year into several equal time periods, then using particle swarm optimization (PSO), optimal candidate configurations for each period are obtained. System losses and customer interruption cost of each configuration during each period is also calculated. Then, considering switching cost from a configuration to another one, dynamic programming algorithm (DPA) is used to determine the annual reconfiguration scheme. Several test systems were used to validate the proposed method. The obtained results denote that to have an optimum solution it is necessary to compare operation costs dynamically.
Resumo:
A dynamic accumulator is an algorithm, which gathers together a large set of elements into a constant-size value such that for a given element accumulated, there is a witness confirming that the element was indeed included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set such that the cost of an addition or deletion operation is independent of the number of accumulated elements. Although the first accumulator was presented ten years ago, there is still no standard formal definition of accumulators. In this paper, we generalize formal definitions for accumulators, formulate a security game for dynamic accumulators so-called Chosen Element Attack (CEA), and propose a new dynamic accumulator for batch updates based on the Paillier cryptosystem. Our construction makes a batch of update operations at unit cost. We prove its security under the extended strong RSA (es-RSA) assumption
Resumo:
This paper describes and analyzes research on the dynamics of long-term care and the policy relevance of identifying the sources of persistence in caregiving arrangements (including the effect of dynamics on parameter estimates, implications for family welfare, parent welfare, child welfare, and cost of government programs). We discuss sources and causes of observed persistence in caregiving arrangements including inertia/state dependence (confounded by unobserved heterogeneity) and costs of changing caregivers. We comment on causes of dynamics including learning/human capital accumulation; burnout; and game-playing. We suggest how to deal with endogenous geography; dynamics in discrete and continuous choices; and equilibrium issues (multiple equilibria, dynamic equilibria). We also present an overview of commonly used longitudinal data sets and evaluate their relative advantages/disadvantages. We also discuss other data issues related to noisy measures of wealth and family structure. Finally, we suggest some methods to handle econometric problems such as endogeneous geography. © 2014 Springer Science+Business Media New York.
Resumo:
Objective: To estimate the relative inpatient costs of hospital-acquired conditions. Methods: Patient level costs were estimated using computerized costing systems that log individual utilization of inpatient services and apply sophisticated cost estimates from the hospital's general ledger. Occurrence of hospital-acquired conditions was identified using an Australian ‘condition-onset' flag for diagnoses not present on admission. These were grouped to yield a comprehensive set of 144 categories of hospital-acquired conditions to summarize data coded with ICD-10. Standard linear regression techniques were used to identify the independent contribution of hospital-acquired conditions to costs, taking into account the case-mix of a sample of acute inpatients (n = 1,699,997) treated in Australian public hospitals in Victoria (2005/06) and Queensland (2006/07). Results: The most costly types of complications were post-procedure endocrine/metabolic disorders, adding AU$21,827 to the cost of an episode, followed by MRSA (AU$19,881) and enterocolitis due to Clostridium difficile (AU$19,743). Aggregate costs to the system, however, were highest for septicaemia (AU$41.4 million), complications of cardiac and vascular implants other than septicaemia (AU$28.7 million), acute lower respiratory infections, including influenza and pneumonia (AU$27.8 million) and UTI (AU$24.7 million). Hospital-acquired complications are estimated to add 17.3% to treatment costs in this sample. Conclusions: Patient safety efforts frequently focus on dramatic but rare complications with very serious patient harm. Previous studies of the costs of adverse events have provided information on ‘indicators’ of safety problems rather than the full range of hospital-acquired conditions. Adding a cost dimension to priority-setting could result in changes to the focus of patient safety programmes and research. Financial information should be combined with information on patient outcomes to allow for cost-utility evaluation of future interventions.
Resumo:
This paper develops a dynamic model for cost-effective selection of sites for restoring biodiversity when habitat quality develops over time and is uncertain. A safety-first decision criterion is used for ensuring a minimum level of habitats, and this is formulated in a chance-constrained programming framework. The theoretical results show; (i) inclusion of quality growth reduces overall cost for achieving a future biodiversity target from relatively early establishment of habitats, but (ii) consideration of uncertainty in growth increases total cost and delays establishment, and (iii) cost-effective trading of habitat requires exchange rate between sites that varies over time. An empirical application to the red listed umbrella species - white-backed woodpecker - shows that the total cost of achieving habitat targets specified in the Swedish recovery plan is doubled if the target is to be achieved with high reliability, and that equilibrating price on a habitat trading market differs considerably between different quality growth combinations. © 2013 Elsevier GmbH.
Resumo:
The aim of this project was to evaluate the cost-effectiveness of hand hygiene interventions in resource-limited hospital settings. Using data from north-east Thailand, the research found that such interventions are likely to be very cost-effective in intensive care unit settings as a result of reduced incidence of methicillin-resistant Staphylococcus aureus bloodstream infection alone. This study also found evidence showing that the World Health Organization's (WHO) multimodal intervention is effective and when adding either goal-setting, reward incentives, or accountability strategies to the WHO intervention, compliance could be further improved.
Resumo:
During the past few decades, developing efficient methods to solve dynamic facility layout problems has been focused on significantly by practitioners and researchers. More specifically meta-heuristic algorithms, especially genetic algorithm, have been proven to be increasingly helpful to generate sub-optimal solutions for large-scale dynamic facility layout problems. Nevertheless, the uncertainty of the manufacturing factors in addition to the scale of the layout problem calls for a mixed genetic algorithm–robust approach that could provide a single unlimited layout design. The present research aims to devise a customized permutation-based robust genetic algorithm in dynamic manufacturing environments that is expected to be generating a unique robust layout for all the manufacturing periods. The numerical outcomes of the proposed robust genetic algorithm indicate significant cost improvements compared to the conventional genetic algorithm methods and a selective number of other heuristic and meta-heuristic techniques.
Resumo:
Dynamic Bayesian Networks (DBNs) provide a versatile platform for predicting and analysing the behaviour of complex systems. As such, they are well suited to the prediction of complex ecosystem population trajectories under anthropogenic disturbances such as the dredging of marine seagrass ecosystems. However, DBNs assume a homogeneous Markov chain whereas a key characteristics of complex ecosystems is the presence of feedback loops, path dependencies and regime changes whereby the behaviour of the system can vary based on past states. This paper develops a method based on the small world structure of complex systems networks to modularise a non-homogeneous DBN and enable the computation of posterior marginal probabilities given evidence in forwards inference. It also provides an approach for an approximate solution for backwards inference as convergence is not guaranteed for a path dependent system. When applied to the seagrass dredging problem, the incorporation of path dependency can implement conditional absorption and allows release from the zero state in line with environmental and ecological observations. As dredging has a marked global impact on seagrass and other marine ecosystems of high environmental and economic value, using such a complex systems model to develop practical ways to meet the needs of conservation and industry through enhancing resistance and/or recovery is of paramount importance.
Resumo:
Two prerequisites for realistically embarking upon an eradication programme are that cost-benefit analysis favours this strategy over other management options and that sufficient resources are available to carry the programme through to completion. These are not independent criteria, but it is our view that too little attention has been paid to estimating the investment required to complete weed eradication programmes. We deal with this problem by using a two-pronged approach: 1) developing a stochastic dynamic model that provides an estimation of programme duration; and 2) estimating the inputs required to delimit a weed incursion and to prevent weed reproduction over a sufficiently long period to allow extirpation of all infestations. The model is built upon relationships that capture the time-related detection of new infested areas, rates of progression of infestations from the active to the monitoring stage, rates of reversion of infestations from the monitoring to active stage, and the frequency distribution of time since last detection for all infestations. This approach is applied to the branched broomrape (Orobanche ramosa) eradication programme currently underway in South Australia. This programme commenced in 1999 and currently 7450 ha are known to be infested with the weed. To date none of the infestations have been eradicated. Given recent (2008) levels of investment and current eradication methods, model predictions are that it would take, on average, an additional 73 years to eradicate this weed at an average additional cost (NPV) of $AU67.9m. When the model was run for circumstances in 2003 and 2006, the average programme duration and total cost (NPV) were predicted to be 159 and 94 years, and $AU91.3m and $AU72.3m, respectively. The reduction in estimated programme length and cost may represent progress towards the eradication objective, although eradication of this species still remains a long term prospect.
Resumo:
Obtaining drinking water from seawater is usually done through the process of desalination. The conventional desalination processes at present are centralized, require huge capital cost, and enormous amount of concentrated energy from fossil fuel. Issues like optimal chamber pressure, pressure control and energy savings for desalination are not adequately addressed. This paper proposes a novel pressure control method by means of dynamic pressure modulation within the evaporation chamber. A performance index is proposed that results in a dynamic optimal external pressure and maximum energy saving for a specific flow rate. Experimental results from the laboratory setup that validate the proposed concepts are presented in the paper. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
We predict the dynamic light scattering intensity S(q,t) for the L3 phase (anomalous isotropic phase) of dilute surfactant solutions. Our results are based on a Landau-Ginzburg approach, which was previously used to explain the observed static structure factor S(q, 0). In the extreme limit of small q, we find a monoexponential decay with marginal or irrelevant hydrodynamic interactions. In most other regimes the decay of S(q,t) is strongly nonexponential; in one case, it is purely algebraic at long times.
Resumo:
We address the optimal control problem of a very general stochastic hybrid system with both autonomous and impulsive jumps. The planning horizon is infinite and we use the discounted-cost criterion for performance evaluation. Under certain assumptions, we show the existence of an optimal control. We then derive the quasivariational inequalities satisfied by the value function and establish well-posedness. Finally, we prove the usual verification theorem of dynamic programming.