We study the General Routing Problem defined on a mixed graph and with stochastic demands. The problem under investigation is aimed at finding the minimum cost set of routes to satisfy a set of clients whose demand is not deterministically known. Since each vehicle has a limited capacity, the...

The article deals with the methodologies for credit risk evaluation. It describes an empirical analysis carried out on a sample of Italian firms belonging to the leather manufacturing and wholesale industry. The study uses the efficiency, calculated through data envelopment analysis (DEA), and...

This paper presents a hybrid metaheuristic for solving the static dial-a-ride problem with heterogeneous vehicles and fixed costs. The hybridization combines a reactive greedy randomized adaptive search, used as outer scheme, with a tabu search heuristic in the local search phase. The algorithm...

The Multi-Handler Knapsack Problem under Uncertainty is a new stochastic knapsack problem where, given a set of items, characterized by volume and random profit, and a set of potential handlers, we want to find a subset of items which maximizes the expected total profit. The item profit is given...

This paper studies a set of indicators for evaluating how the quality of a freight distribution service with time windows, which operates on a given road network to satisfy a number of requests, affects the service cost. The result of a service quality setting, expressed as the width of the time...

Multi-echelon distribution systems are quite common in supply-chain and logistic systems. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. Unfortunately, the literature on com- binatorial...