In this paper we propose a decision model aimed at increasing security in a utility network (e.g., smart grid, water network). The network consists of edges that might be a viable target for terrorists depending on several factors such as geographical location, accessibility of the network, the...

In this research, a first order Markov model is built from a corpus of bagana music, a traditional lyre from Ethiopia. Different ways in which low order Markov models can be used to build quality assessment metrics for an optimization algorithm are explained. These are then implemented in a...

Determining the optimal number and location of intermodal transshipment terminals is a decision that strongly influences the viability of the intermodal transportation alternative. In this paper, we develop a model and an optimization method that provides policy makers with a tool to help them...

In this paper a variable neighbourhood search (VNS) algorithm is developed that can generate musical fragments of arbitrary length consisting of a cantus firmus and a first species counterpoint melody. The objective function of the algorithm is based on a quantification of existing counterpoint...

In this paper a number of musical features are extracted from a large music database, which are consequently used to build three composer classification models. The first two models, an if-then ruleset and a decision tree, result in an understanding of the style differences between Bach, Haydn...

This paper describes the implementation of an Android application, called FuX1, that can continuously play a stream of newly generated fifth species counterpoint. A variable neighborhood search algorithm is implemented in order to generate the music. This algorithm is a modification of an...

This paper proposes a variant of the well-known capacitated vehicle routing problem that models the problem of routing vehicles in the cash-in-transit industry by introducing a risk constraint. In this problem, which is called the risk-constrained cash-in-transit vehicle routing problem...

Distribution companies that serve a very large number of customers, courier companies for example, often partition the geographical region served by a depot into zones. Each zone is assigned to a single vehicle and each vehicle serves a single zone. An alternative approach is to partition the...

In this paper, a variable neighborhood search (VNS) algorithm is developed and analyzed that can generate fifth species counterpoint fragments. The existing species counterpoint rules are quantified and form the basis of the objective function used by the algorithm. The VNS developed in this...

In this paper, a metaheuristic approach is presented to solve the Clustered Vehicle Routing Problem (CluVRP). The CluVRP, in which customers are grouped into predefi?ned clusters, can be seen as a generalisation of the classical Capacitated Vehicle Routing Problem (CVRP). When serving all these...