A Dynamic Risk Optimization Model for Evaluating Profitable and Feasible Water Management Plans

Currently the South African government is advocating the cultivation of high valued crops and more efficient use of available water resources through the adoption o f more efficient irrigation technology and irrigation scheduling. A requirement of the National Water Act (Act 36 of 1998) is the compilation of water management plans. The main objective of this paper is to develop a multiperiod mathematical risk programming model able of assisting water user associations with the compilation of water management plans that are both profitable and feasible. Special care was taken to represent canal capacities and irrigation system application rates in the model. Risk simulation procedures are used to generate an appropriately correlated inter- and intra-temporal risk matrix for the programming model. A combination of subjectively elicited distributions of crop yield and objective data on crop prices were used to characterize risk. The model was applied to a representative flood irrigation farm in the Vaalharts irrigation scheme South Africa to demonstrate the capability of the model to optimize water use over a 15 year planning horizon. Model results clearly indicated the potential of high value crops and more efficient irrigation technology to soften the impact of water shortages. Furthermore infrastructure, the financial position of the farmer and the level of risk averseness have significantly impacted on the results. Policy makers and government authorities should take cognizance of these factors when evaluating water use efficiency and water management plans of different water user associations. Improvements in the adopted modeling procedure are also made.Dynamic Linear Programming, risk, irrigation, feasibility, South Africa, Resource /Energy Economics and Policy, C6, Q15, Q12,

A Hybrid optimization method for real-time pump scheduling

Session S6-02, Special Session: Evolutionary Computing in Water Resources Planning and Management IILinear, non-linear and dynamic programming, heuristics and evolutionary computation are amongst the techniques which have been applied to obtain solutions to optimal pump-scheduling problems. Most of these either greatly simplify the complex water distribution system or require significant time to solve the problem. The scheduling of pumps is frequently undertaken in near-real time, in order to minimize cost and maximize energy savings. However, this requires a computationally efficient algorithm that can rapidly identify an acceptable solution. In this paper, a hybrid optimization model is presented, coupling Linear Programming and Genetic Algorithms. The resulting hybrid optimization model has demonstrated more rapid convergence with respect to the traditional metaheuristic algorithms, whilst maintaining a good level of reliability

Optimizing the flash-RAM energy trade-off in deeply embedded systems

Deeply embedded systems often have the tightest constraints on energy consumption, requiring that they consume tiny amounts of current and run on batteries for years. However, they typically execute code directly from flash, instead of the more energy efficient RAM. We implement a novel compiler optimization that exploits the relative efficiency of RAM by statically moving carefully selected basic blocks from flash to RAM. Our technique uses integer linear programming, with an energy cost model to select a good set of basic blocks to place into RAM, without impacting stack or data storage. We evaluate our optimization on a common ARM microcontroller and succeed in reducing the average power consumption by up to 41% and reducing energy consumption by up to 22%, while increasing execution time. A case study is presented, where an application executes code then sleeps for a period of time. For this example we show that our optimization could allow the application to run on battery for up to 32% longer. We also show that for this scenario the total application energy can be reduced, even if the optimization increases the execution time of the code

Low Power Dynamic Scheduling for Computing Systems

This paper considers energy-aware control for a computing system with two states: "active" and "idle." In the active state, the controller chooses to perform a single task using one of multiple task processing modes. The controller then saves energy by choosing an amount of time for the system to be idle. These decisions affect processing time, energy expenditure, and an abstract attribute vector that can be used to model other criteria of interest (such as processing quality or distortion). The goal is to optimize time average system performance. Applications of this model include a smart phone that makes energy-efficient computation and transmission decisions, a computer that processes tasks subject to rate, quality, and power constraints, and a smart grid energy manager that allocates resources in reaction to a time varying energy price. The solution methodology of this paper uses the theory of optimization for renewal systems developed in our previous work. This paper is written in tutorial form and develops the main concepts of the theory using several detailed examples. It also highlights the relationship between online dynamic optimization and linear fractional programming. Finally, it provides exercises to help the reader learn the main concepts and apply them to their own optimizations. This paper is an arxiv technical report, and is a preliminary version of material that will appear as a book chapter in an upcoming book on green communications and networking.Comment: 26 pages, 10 figures, single spac

Designing sustainable cold chains for long-range food distribution: Energy-effective corridors on the Silk Road Belt

Modern food production-distribution processes represent a critical stressor for the environment and for natural ecosystems. The rising flows of food across growing and consumption areas couple with the higher expectations of consumers for the quality of products and compel the intensive use of refrigerated rooms and transport means throughout the food supply chain. In order to aid the design of sustainable cold chains that incorporate such aspects, this paper proposes a mixed integer linear programming model to minimize the total energy consumption associated with the cold operations experienced by perishable products. This model is intended for food traders, logistics practitioners, retail managers, and importers collaboratively called to design and plan a cost and environmentally effective supply strategy, physical channels, and infrastructures for cold chains. The proposed model is validated with a case study inspired by the distribution of two example food products, namely fresh apples and ice cream, along the New Silk Road connecting Europe and China. The illustrated analysis investigates the effect of alternative routes and transport modes on the sustainability of the cold chain. It is found that the most energy-efficient route for ice cream is via rail over a northern route and, for apples, is via a southern maritime route, and, for these two routes, the ratios of the total energy consumed to the energy content of the food are 760 and 913, respectively. By incorporating the energy lost due to the food quality decay, the model identifies the optimal route to adopt in accordance with the shelf life and the conservation temperature of each product

A multi-hop angular routing protocol for wireless sensor networks

In this article, we propose two new routing protocols for wireless sensor networks. First one is AM-DisCNT (angular multi-hop distance-based clustering network transmission) protocol which uses circular deployment of sensors (nodes) for uniform energy consumption in the network. The protocol operates in such a way that nodes with maximum residual energy are selected as cluster heads for each round. Second one is iAM-DisCNT (improved AM-DisCNT) protocol which exploits both mobile and static base stations for throughput maximization. Besides the proposition of routing protocols, iAM-DisCNT is provided with three mathematical models: two linear-programming-based models for information flow maximization and packet drop rate minimization and one model for calculating energy consumption of nodes. Graphical analysis for linear-programming-based mathematical formulation is also part of this work. Simulation results show that AM-DisCNT has 32% and iAM-DisCNT has 48% improved stability period as compared to LEACH (low-energy adaptive clustering hierarchy) and DEEC (distributed energy-efficient clustering) routing protocols. Similarly, throughput of AM-DisCNT and iAM-DisCNT is improved by 16% and 80%, respectively, in comparison with the counterpart schemes. © The Author(s) 2016