The vehicle routing problem with drones (VRPD) is an extension of the classic capacitated
vehicle routing problem, where not only trucks but drones are used to deliver parcels to …

This paper aims at presenting a compilation of state-of art references in which dynamic
programming (DP) and its variants have been applied as a solution methods for the …

Network flow formulations are among the most successful tools to solve optimization
problems. Such formulations correspond to determining an optimal flow in a network. One …

The best performing exact algorithms for the capacitated vehicle routing problem developed
in the last 10 years are based in the combination of cut and column generation. Some …

In this paper, we propose a vehicle-scheduling model for electric transit buses with either
battery swap** or fast charging at a battery station, and a vehicle-scheduling model with …

The convergence of a column generation algorithm can be improved in practice by using
stabilization techniques. Smoothing and proximal methods based on penalizing the …

We study pseudo-polynomial formulations for the classical bin packing and cutting stock
problems. We first propose an overview of dominance and equivalence relations among the …

Emergency department overcrowding is a global issue that poses a great threat to patient
health and safety. The timeliness of medical services provided to patients is crucial to …

We consider the shortest path problem with resource constraints arising as a subproblem in
state-of-the-art branch-cut-and-price algorithms for vehicle routing problems. We propose a …

The time dependent traveling salesman problem (TDTSP) is a generalization of the classical
traveling salesman problem (TSP), where arc costs depend on their position in the tour with …