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

In this paper, we consider the problem of managing a fleet of trucks with different capacity to serve the requests of different customers that arise randomly over time. The problem is formulated via dynamic programming. Linear programming approximations of the problem are presented and their...

This paper addresses the elementary shortest path problem with forbidden paths. The main aim is to find the shortest paths from a single origin node to every other node of a directed graph, such that the solution does not contain any path belonging to a given set (i.e., the forbidden set). It is...

In this note we show how to manage, by means of Generalized Precedence Relationships, some kinds of temporal constraints introduced by Chen et al. (1997) in project networks.

The paper addresses restaurant revenue management from both a strategic and an operational point of view. Strategic decisions in restaurants are mainly related to defining the most profitable combination of tables that will constitute the restaurant. We propose new formulations of the so-called...