Stochastic dynamic vehicle routing problems have become an essential part of logistics and
mobility services. In such problems, a sequence of vehicle routing decisions has to be made …

Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …

Optimization of on-demand transportation systems and ride-sharing services involves
solving a class of complex vehicle routing problems with pickup and delivery with time …

Abstract The Dynamic Pickup and Delivery Problem (DPDP) is an essential problem in the
logistics domain, which is NP-hard. The objective is to dynamically schedule vehicles …

We discuss formulations of integer programs with a huge number of variables and their
solution by column generation methods, ie, implicit pricing of nonbasic variables to generate …

This paper presents a methodology for classifying the literature of the Vehicle Routing
Problem (VRP). VRP as a field of study and practice is defined quite broadly. It is considered …

In the last decade, there has been an increasing body of research in dynamic vehicle routing
problems. This article surveys the subclass of those problems called dynamic pickup and …

This paper is the first part of a comprehensive survey on pickup and delivery problems.
Basically, two problem classes can be distinguished. The first class, discussed in this paper …

Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a
success story in large-scale integer programming. We outline and relate the approaches …

Emerging transportation network services, such as customized buses, hold the promise of
expanding overall traveler accessibility in congested metropolitan areas. A number of …