Part I: Advanced Tutorials -- Supporting Time-Critical Decision Making with Real Time Simulations -- Metamodel-based Robust Simulation-Optimization: An Overview -- Simulation-Based Modelling of a Stochastic Equilibrium -- Part II: Uncertainty Management Using Sequential Parameter Optimization --...

The present paper makes use of the minimum of a random number of nonnegative random variables and a nonnegative random variable for formulating a stochastic multiplicative model. Sufficient conditions for evaluating the distribution function of the model are also established. Moreover, the paper...

The emergence and survival of cooperation is one of the hardest problems still open in science. Several factors such as the existence of punishment, repeated interactions, topological effects and the formation of prestige may all contribute to explain the counter-intuitive prevalence of...

This paper develops tools for analyzing properties of stochastic objective functions which take the form (formula). The paper analyzes the relationship between properties of the primitive functions, such as utility functions u and probability distributions F, and properties of the stochastic...

In this paper we present the algorithmic framework and practical aspects of implementing a parallel version of a primal-dual semidefinite programming solver on a distributed memory computer cluster. Our implementation is based on the CSDP solver and uses a message passing interface (MPI), and...

Clarke & Wright algorithm is a well-known algorithm for Vehicle Routing Problem (VRP). Using this algorithm one can find the best possible route for fleet allocation and movement by calculating distances from the home position to all points; distances between points; and then calculating the...

Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem...

We give sufficient conditions under which a policy that assigns customers to the Fastest Available Server, labelled FAS, is optimal among non-idling policies in queuing models with multiple independent Markov-modulated Poisson arrival processes and heterogeneous parallel exponential servers with...