Multi-Period Asset Allocation: An Application of Discrete Stochastic Programming

The issue of modeling farm financial decisions in a dynamic framework is addressed in this paper. Discrete stochastic programming is used to model the farm portfolio over the planning period. One of the main issues of discrete stochastic programming is representing the uncertainty of the data. The development of financial scenario generation routines provides a method to model the stochastic nature of the model. In this paper, two approaches are presented for generating scenarios for a farm portfolio problem. The approaches are based on copulas and optimization. The copula method provides an alternative to the multivariate normal assumption. The optimization method generates a number of discrete outcomes which satisfy specified statistical properties by solving a non-linear optimization model. The application of these different scenario generation methods is then applied to the topic of geographical diversification. The scenarios model the stochastic nature of crop returns and land prices in three separate geographic regions. The results indicate that the optimal diversification strategy is sensitive to both scenario generation method and initial acreage assumptions. The optimal diversification results are presented using both scenario generation methods.Agribusiness, Agricultural Finance, Farm Management,

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Robust optimization for energy transactions in multi-microgrids under uncertainty

Independent operation of single microgrids (MGs) faces problems such as low self-consumption of local renewable energy, high operation cost and frequent power exchange with the grid. Interconnecting multiple MGs as a multi-microgrid (MMG) is an effective way to improve operational and economic performance. However, ensuring the optimal collaborative operation of a MMG is a challenging problem, especially under disturbances of intermittent renewable energy. In this paper, the economic and collaborative operation of MMGs is formulated as a unit commitment problem to describe the discrete characteristics of energy transaction combinations among MGs. A two-stage adaptive robust optimization based collaborative operation approach for a residential MMG is constructed to derive the scheduling scheme which minimizes the MMG operating cost under the worst realization of uncertain PV output. Transformed by its KKT optimality conditions, the reformulated model is efficiently solved by a column-and-constraint generation (C&CG) method. Case studies verify the effectiveness of the proposed model and evaluate the benefits of energy transactions in MMGs. The results show that the developed MMG operation approach is able to minimize the daily MMG operating cost while mitigating the disturbances of uncertainty in renewable energy sources. Compared to the non-interactive model, the proposed model can not only reduce the MMG operating cost but also mitigate the frequent energy interaction between the MMG and the grid

Computing (R, S) policies with correlated demand

This paper considers the single-item single-stocking non-stationary stochastic lot-sizing problem under correlated demand. By operating under a nonstationary (R, S) policy, in which R denote the reorder period and S the associated order-up-to-level, we introduce a mixed integer linear programming (MILP) model which can be easily implemented by using off-theshelf optimisation software. Our modelling strategy can tackle a wide range of time-seriesbased demand processes, such as autoregressive (AR), moving average(MA), autoregressive moving average(ARMA), and autoregressive with autoregressive conditional heteroskedasticity process(AR-ARCH). In an extensive computational study, we compare the performance of our model against the optimal policy obtained via stochastic dynamic programming. Our results demonstrate that the optimality gap of our approach averages 2.28% and that computational performance is good

Hierarchical location-allocation models for congested systems

In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served customers are referred to higher level servers. In the first model, the objective is to find the minimum number of servers and their locations that will cover a given region with a distance or time standard. The second model is cast as a Maximal Covering Location formulation. A heuristic procedure is then presented together with computational experience. Finally, some extensions of these models that address other types of spatial configurations are offered.Hierarchical location, congestion, queueing

Fluid flow queue models for fixed-mobile network evaluation

A methodology for fast and accurate end-to-end KPI, like throughput and delay, estimation is proposed based on the service-centric traffic flow analysis and the fluid flow queuing model named CURSA-SQ. Mobile network features, like shared medium and mobility, are considered defining the models to be taken into account such as the propagation models and the fluid flow scheduling model. The developed methodology provides accurate computation of these KPIs, while performing orders of magnitude faster than discrete event simulators like ns-3. Finally, this methodology combined to its capacity for performance estimation in MPLS networks enables its application for near real-time converged fixed-mobile networks operation as it is proven in three use case scenarios