The aim of this paper is to present a branch and bound algorithm, which allows the construction of a consensus ranking out of a set of complete rankings over all alternatives. Each ranking of this set corresponds to the judgement of a decision maker with respect to the given list of...

In this paper, we study the decision problem of a retailer, who wants to optimize the amount of shelf inventory of a particular product, given that the demand for the product is stochastic and replenishment lead times (from the store’s stockroom to the shelf) are negligible. The shelf...

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

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