The ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence of the customer at the delivery location. Failed deliveries result in rework which in turn has a large impact on the carriers’ delivery cost. In the classical vehicle routing...

The minimum tour duration problem (MTDP) is the variant of the traveling salesman problem with time windows, which consists of finding a time window-feasible Hamiltonian path minimizing the tour duration. We present a new effective dynamic programming (DP)-based approach for the MTDP. When...

With rapid advances in digitization, many critical processes in transportation, industries, and our daily life rely on measurements of sensors. With time, however, the measurements of sensors may get gradually biased and their precision deteriorates, leading to an enhanced risk of major...

In many practical cases one has to choose an arrangement of different objects so that they are compatible. Whenever the compatibility of the objects can be checked by a pair-wise comparison the problem can be moddeled using the graph-theoretic notion of cliques.

This paper introduces a special kind of multi-depot pickup and delivery problem. In contrast to the general pickup and delivery problem (GPDP, see e.g. [19,31]) all requests have to be picked up at or delivered to one central location which has the function of a hub or consolidation point. In...

We consider a packing problem that arises in a direct-shipping system in the food and beverage industry: Trucks are the containers, and products to be distributed are the items. The packing is constrained by two independent quantities, weight (e.g., measured in kg) and volume (number of...

Transportnetzwerk-Design ist eines der bedeutenden Anwendungsfelder des Operations Research und der mathematischen Optimierung. Es birgt große Potentiale zur Kostenreduktion und zur Verbesserung der Service-Qualität. Insbesondere gilt dies für die Planung von großen Regelnetzen, bei denen...