In this paper, the authors consider the vehicle routing problem (VRP) with stochastic
demand and/or dynamic requests. The classical VRP consists of determining a set of routes …

This article addresses the dynamic vehicle routing problem (DVRP). DVRP is a challenging
variation of the classic vehicle routing problem in which some customers are not known in …

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of
problems, all data are known in advance, ie before the optimization process has started …

This paper investigates the optimization problem of scheduling autonomous mobile robots
(AMRs) in hospital settings, considering dynamic requests with different priorities. The …

Abstract We study the Dynamic Orienteering Problem (DOP) with changing node values and
changing budgets. It is a complex combinatorial optimization problem with many …

Network optimization models and algorithms constitute a core research area of
Mathematical Optimization and Computing. We present a wide range of state-of-the-art …

We consider logistics problems that are both dynamic and potentially large scale. A common
way to create a scalable solution for logistics problems is to use multi-agent systems. In this …

On-demand food delivery is currently the fastest-growing and most time-sensitive form of
logistics in all logistics industry. As the demographic dividend gradually diminishes, an …

Dynamic optimization problems (DOPs) have proven to be a realistic model of dynamic
environments where the fitness function, problem parameters, and/or problem constraints …