In this paper, we introduce a last-mile delivery concept that is well suited for urban areas. By jointly optimizing the tour of a truck and a cargo bike, we ensure that each vehicle is used optimally. Here, we assume that the bike is restocked by meeting up with the truck so that no dedicated...

In this paper, we present an outer approximation algorithm for computing the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems (MOMILPs). It produces the extreme points (i.e., the vertices) as well as the facets of the Edgeworth–Pareto hull. We note that...

The planning of efficient shift schedules is a key challenge for many service companies whose economic success heavily relies on the efficient employment of personnel. In spite of the recent advances in autonomous driving, mobility services, such as ride pooling, still heavily rely on the use of...

The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real...

Bike-sharing systems have become a popular transportation alternative. Unfortunately, station networks are often unbalanced, with some stations being empty, while others being congested. Given the complexity of the underlying planning problems to rebalance station inventories via trucks, many...

The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...