The multi-depot vehicle routing problem (MDVRP) is a very challenging part of supply chain optimization. We propose here a simple yet powerful heuristic for the MDVRP with an integrated look-ahead. Compared to other state-of-the-art approaches, our heuristic is significantly faster, but yields competitive results and even found several new best solutions on a set of standard benchmark problems.

This contribution gives an introduction to an integrated vehicle routing and resource allocation problem. We refer to it as the Swap Trailer Problem and formulate the mathematical model. After the analysis of dynamic decision problems and the development of a framework for this problem, we highlight the dynamic aspect of the problem. Two different solution strategies are supposed. Special prope...

In this paper we demonstrate the application of time-varying graphs (TVGs) for modeling and analyzing multi-robot foremost coverage in dynamic environments. In particular, we consider the multi-robot, multi-depot Dynamic Map Visitation Problem (DMVP), in which a team of robots must visit a collection of critical locations as quickly as possible, in an environment that may change rapidly and unp...

• A bi-objective multi-depot electric transit vehicle scheduling problem. Time-of-use electricity tariffs and peak load risk for power grids are explicitly considered. lexicographic method to reformulate the optimization model achieve win-win situations. tailored branch-and-price algorithm that embeds heuristics a trip chain pool strategy. Higher solution quality computation efficiency compared...