Computing a schedule for a single machine problem is often difficult for irregular criteria, but when the data are uncertain, the problem is much more complicated. In this paper, we modify a genetic algorithm to compute robust schedules when release dates are subject to small variations. Two...

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...

The multi-objective optimization paradigm prescribes that a multi-objective optimization problem should be solved in two steps executed in sequence. First an approximation of the Pareto set is determined, that contains as many non-dominated solutions as possible. Secondly, a solution is chosen...

This paper proposes a variant of the Vehicle Routing Problem in which a particular kind of risk constraint has been introduced to model the problem of routing vehicles in the cash-in-transit industry and a hard time window constraint, with no waiting times, delimits the customer's visit within a...