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 Mixed Capacitated General Routing Problem (MCGRP) is defined over a mixed graph, for which some vertices must be visited and some links must be traversed at least once. The problem consists of determining a set of least-cost vehicle routes that satisfy this requirement and respect the...

This paper describes anticipatory algorithms for the dynamic vehicle dispatching problem with pickups and deliveries, a problem faced by local area courier companies. These algorithms evaluate alternative solutions through a short-term demand sampling and a fully sequential procedure for...

This paper deals with the probabilistic multi-vehicle pickup and delivery problem. We develop an efficient neighborhood evaluation procedure which allows to reduce the computational complexity by two orders of magnitude with respect to a straightforward approach. The numerical experiments...