In this paper, we address a variant of the vehicle routing problem called the vehicle routing problem with time windows and multiple routes. It considers that a given vehicle can be assigned to more than one route per planning period. We propose a new exact algorithm for this problem. Our...

An iterative scheme which is based on a dynamic fixation of the variables is developed to solve the 0-1 multidimensional knapsack problem. Such a scheme has the advantage of generating memory information, which is used on the one hand to choose the variables to fix either permanently or...

In this paper, we propose an oscillation strategy heuristic combined with mathematical programming for disruption management in the airline industry (DMAI). The goal of this problem is to resume normal operations as quickly as possible during the recovery period while minimising the resulting...