Scheduling of Multiple Chillers in Trigeneration Plants

The scheduling of both absorption cycle and vapour compression cycle chillers in trigeneration plants is investigated in this work. Many trigeneration plants use absorption cycle chillers only but there are potential performance advantages to be gained by using a combination of absorption and compression chillers especially in situations where the building electrical demand to be met by the combined heat and power (CHP) plant is variable. Simulation models of both types of chillers are developed together with a simple model of a variable-capacity CHP engine developed by curve-fitting to supplier’s data. The models are linked to form an optimisation problem in which the contribution of both chiller types is determined at a maximum value of operating cost (or carbon emission) saving. Results show that an optimum operating condition arises at moderately high air conditioning demands and moderately low power demand when the air conditioning demand is shared between both chillers, all recovered heat is utilised, and the contribution arising from the compression chiller results in an increase in CHP power generation and, hence, engine efficiency

A bi-objective genetic algorithm approach to risk mitigation in project scheduling

A problem of risk mitigation in project scheduling is formulated as a bi-objective optimization problem, where the expected makespan and the expected total cost are both to be minimized. The expected total cost is the sum of four cost components: overhead cost, activity execution cost, cost of reducing risks and penalty cost for tardiness. Risks for activities are predefined. For each risk at an activity, various levels are defined, which correspond to the results of different preventive measures. Only those risks with a probable impact on the duration of the related activity are considered here. Impacts of risks are not only accounted for through the expected makespan but are also translated into cost and thus have an impact on the expected total cost. An MIP model and a heuristic solution approach based on genetic algorithms (GAs) is proposed. The experiments conducted indicate that GAs provide a fast and effective solution approach to the problem. For smaller problems, the results obtained by the GA are very good. For larger problems, there is room for improvement

Computing server power modeling in a data center: survey,taxonomy and performance evaluation

Data centers are large scale, energy-hungry infrastructure serving the increasing computational demands as the world is becoming more connected in smart cities. The emergence of advanced technologies such as cloud-based services, internet of things (IoT) and big data analytics has augmented the growth of global data centers, leading to high energy consumption. This upsurge in energy consumption of the data centers not only incurs the issue of surging high cost (operational and maintenance) but also has an adverse effect on the environment. Dynamic power management in a data center environment requires the cognizance of the correlation between the system and hardware level performance counters and the power consumption. Power consumption modeling exhibits this correlation and is crucial in designing energy-efficient optimization strategies based on resource utilization. Several works in power modeling are proposed and used in the literature. However, these power models have been evaluated using different benchmarking applications, power measurement techniques and error calculation formula on different machines. In this work, we present a taxonomy and evaluation of 24 software-based power models using a unified environment, benchmarking applications, power measurement technique and error formula, with the aim of achieving an objective comparison. We use different servers architectures to assess the impact of heterogeneity on the models' comparison. The performance analysis of these models is elaborated in the paper

Time Series Analysis of Pavement Roughness Condition Data for use in Asset Management

Roughness is a direct measure of the unevenness of a longitudinal section of road pavement. Increased roughness corresponds to decreased ride comfort and increased road user costs. Roughness is relatively inexpensive to measure. Measuring roughness progression over time enables pavement deterioration, which is the result of a complex and chaotic system of environmental and road management influences, to be monitored. This in turn enables the long term functional behaviour of a pavement network to be understood and managed. A range of approaches has been used to model roughness progression for assistance in pavement asset management. The type of modelling able to be undertaken by road agencies depends upon the frequency and extent of data collection, which are consequences of funding available. The aims of this study are to increase the understanding of unbound granular pavement performance by investigating roughness progression, and to model roughness progression to improve roughness prediction methods. The pavement management system in place within the project partner road agency and the data available to this study lend themselves to a methodology allowing roughness progression to be investigated using financial maintenance and physical condition information available for each 1km pavement segment in a 16,000km road network

Image analysis and statistical modelling for measurement and quality assessment of ornamental horticulture crops in glasshouses

Image analysis for ornamental crops is discussed with examples from the bedding plant industry. Feed-forward artificial neural networks are used to segment top and side view images of three contrasting species of bedding plants. The segmented images provide objective measurements of leaf and flower cover, colour, uniformity and leaf canopy height. On each imaging occasion, each pack was scored for quality by an assessor panel and it is shown that image analysis can explain 88.5%, 81.7% and 70.4% of the panel quality scores for the three species, respectively. Stereoscopy for crop height and uniformity is outlined briefly. The methods discussed here could be used for crop grading at marketing or for monitoring and assessment of growing crops within a glasshouse during all stages of production

Optimization of 5-Axis milling processes based on the process models with application to airfoil machining

5-axis milling is widely used in machining of complex surfaces such as airfoils. Improper selection of machining parameters may cause low productivity and undesired results during machining. There are several constraints such as available power and torque, chatter stability, tool breakage etc. In order to respect such constraints proper machining parameters should be determined. In this paper, methodologies for improving 5-axis milling processes are presented. Selection of machining parameters is performed using process simulations. The developed methodologies are presented on an example airfoil

Efficient Multi-way Theta-Join Processing Using MapReduce

Multi-way Theta-join queries are powerful in describing complex relations and therefore widely employed in real practices. However, existing solutions from traditional distributed and parallel databases for multi-way Theta-join queries cannot be easily extended to fit a shared-nothing distributed computing paradigm, which is proven to be able to support OLAP applications over immense data volumes. In this work, we study the problem of efficient processing of multi-way Theta-join queries using MapReduce from a cost-effective perspective. Although there have been some works using the (key,value) pair-based programming model to support join operations, efficient processing of multi-way Theta-join queries has never been fully explored. The substantial challenge lies in, given a number of processing units (that can run Map or Reduce tasks), mapping a multi-way Theta-join query to a number of MapReduce jobs and having them executed in a well scheduled sequence, such that the total processing time span is minimized. Our solution mainly includes two parts: 1) cost metrics for both single MapReduce job and a number of MapReduce jobs executed in a certain order; 2) the efficient execution of a chain-typed Theta-join with only one MapReduce job. Comparing with the query evaluation strategy proposed in [23] and the widely adopted Pig Latin and Hive SQL solutions, our method achieves significant improvement of the join processing efficiency.Comment: VLDB201