Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Nicky D. van Foreest is active.

Publication


Featured researches published by Nicky D. van Foreest.


IEEE Transactions on Smart Grid | 2014

Distributed MPC Applied to a Network of Households With Micro-CHP and Heat Storage

Gunn Larsen; Nicky D. van Foreest; Jacquelien M.A. Scherpen

This paper considers heat and power production from micro Combined Heat and Power systems and heat storage in a network of households. The goal is to balance the local heat demand and supply in combination with balancing the power supply and demand in the network. The on-off decisions of the local generators are done completely distributed based on local information and information exchange with a few neighbors in the network. This is achieved by using an information sharing model with a distributed model predictive control method based on dual-decomposition and sub-gradient iterations. Because of the binary nature of the decisions, a mixed integer quadratic problem is solved at each agent. The approach is tested with simulation, using realistic heat and power demand patterns. We conclude that the distributed control approach is suitable for embedding the distributed generation at a household level.


OR Spectrum | 2013

Analysis of finite-buffer state-dependent bulk queues

Remco Germs; Nicky D. van Foreest

In this paper, we consider a general state-dependent finite-buffer bulk queue in which the rates and batch sizes of arrivals and services are allowed to depend on the number of customers in queue and service batch sizes. Such queueing systems have rich applications in manufacturing, service operations, computer and telecommunication systems. Interesting examples include batch oven processes in the aircraft and semiconductor industry; serving of passengers by elevators, shuttle buses, and ferries; and congestion control mechanisms to regulate transmission rates in packet-switched communication networks. We develop a unifying method to study the performance of this general class of finite-buffer state-dependent bulk queueing systems. For this purpose, we use semi-regenerative analysis to develop a numerically stable method for calculating the limiting probability distribution of the queue length process. Based on the limiting probabilities, we present various performance measures for evaluating admission control and batch service policies, such as the loss probability for an arriving group of customers and for individual customers within a group. We demonstrate our method by means of numerical examples.


Journal of Computational and Applied Mathematics | 2009

Representations for the extreme zeros of orthogonal polynomials

Erik A. van Doorn; Nicky D. van Foreest; Alexander I. Zeifman

We establish some representations for the smallest and largest zeros of orthogonal polynomials in terms of the parameters in the three-terms recurrence relation. As a corollary we obtain representations for the endpoints of the true interval of orthogonality. Implications of these results for the decay parameter of a birth-death process (with killing) are displayed.


Probability in the Engineering and Informational Sciences | 2010

Loss probabilities for the mx/gy/1/k+b bulk queue

Remco Germs; Nicky D. van Foreest

In this article we analyze the MX/GY/1/K+B bulk queue. For this model, we consider three rejection policies: partial acceptance, complete rejection, and complete acceptance. For each of these policies, we are interested in the loss probability for an arriving group of customers and for individual customers within a group. To obtain these loss probabilities, we derive a numerically stable method to compute the limiting probabilities of the queue length process under all three rejection policies. At the end of the article we demonstrate our method by means of a numerical example.


advances in computing and communications | 2012

Distributed MPC for controlling μ-CHPs in a network

Gunn Larsen; Sebastian Trip; Nicky D. van Foreest; Jacquelien M.A. Scherpen

This paper describes a dynamic price mechanism to coordinate electricity generation from micro Combined Heat and Power (μ-CHP) systems in a network of households. The control is done on household level in a completely distributed manner. Distributed Model Predictive control is applied to the network of households with μ-CHP installed. Each house has a unique demand pattern based on realistic data. Information from a few neighbors are taken into account in the local optimal control problems. Desired behavior for the network model in the distributed MPC approach is showed by simulation.


IFAC Proceedings Volumes | 2011

Distributed Control in a Network of Households with

Gunn Larsen; Jacqueline Scherpen; Nicky D. van Foreest; Erik Doornbos

Abstract This is an application of a dynamic price mechanism to distributed optimization of a network of houses which are both producers and consumers of electricity. One possibility for domestic generation is the Micro Combined Heat Power system ( μ CHP). We use a pricing mechanism based on dual decomposition, that was combined with feedback controllers in Rantzer (2009), and apply it to the modeling of the electrical power grid. In the end we perform a numerical test with realistic electricity demand patterns obtained from real data.


European Journal of Operational Research | 2016

mu

Remco Germs; Nicky D. van Foreest; Onur A. Kilic

In this paper, we consider a production-clearing system with compound Poisson demand under continuous review. The production facility produces one type of item without stopping and at a constant rate, and stores the product into a buffer to meet future demand. To prevent high inventory levels, a clearing operation occasionally removes all or part of the inventory from the buffer. We prove that an (m, q)-policy, i.e., a policy that clears the buffer to level m as soon as the inventory hits a level q, minimizes the long run average holding and clearing cost. We also derive a numerically very efficient approach to compute the optimal parameters of the (m, q)-policy for models with backlogging and models with lost sales. With these numerical methods we show that tuning the clearing levels m and q in concert can lead to substantial cost savings.


Journal of Computational and Applied Mathematics | 2013

CHP

Erik A. van Doorn; Nicky D. van Foreest; Alexander I. Zeifman

We correct representations for the endpoints of the true interval of orthogonality of a sequence of orthogonal polynomials that were stated by us in the Journal of Computational and Applied Mathematics 233 (2009) 847-851.


Applied Mathematical Modelling | 2014

Optimal policies for production-clearing systems under continuous-review

Gunn Larsen; Nicky D. van Foreest; Jacquelien M.A. Scherpen


SOM Research Reports | 2014

Corrigendum to Representations for the extreme zeros of orthogonal polynomials [J. Comput. Appl. Math. 233 (2009) 847-851]

Remco Germs; Nicky D. van Foreest

Collaboration


Dive into the Nicky D. van Foreest's collaboration.

Top Co-Authors

Avatar

Remco Germs

University of Groningen

View shared research outputs
Top Co-Authors

Avatar

Gunn Larsen

University of Groningen

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge