In this paper, we propose a new metaheuristic to solve the Risk constrained Cash-in-Transit Vehicle Routing Problem (rctvrp). The rctvrp is a variant of the well-known capacitated vehicle routing problem and models the problem of routing vehicles in the cash-in-transit sector. In the rctvrp, the...

We focus on the D-optimal design of screening experiments involving main-effects regression models, especially with large numbers of factors and observations. We propose a new selection strategy for the coordinate-exchange algorithm based on an orthogonality measure of the design. Computational...

We consider a routing problem for ambulances in a disaster response scenario, in which a large number of injured people require medical aid at the same time. The ambulances are used to carry medical personnel and patients. We distinguish two groups of patients: slightly injured people who can be...

In this paper we defi?ne a new problem, the aim of which is to fi?nd a set of k dissimilar alternative solutions for a vehicle routing problem (VRP) on a single instance. ?This problem has several practical applications in the cash-in-transit sector and in the transportation of hazardous...

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

In this paper, we present a variant of the vehicle routing problem (VRP) to increase security in the cash-in-transit sector. A speci?c index is used to quantify the exposure of a vehicle to the risk of being robbed along its route. In addition, the problem is subjected to a traditional capacity...